View All num of num See all Photos IBM www.ibm.com Engaged Employer Overview Reviews Salaries Interviews Jobs Photos Benefits 14k Reviews 34k Salaries 2.6k Interviews 19k Jobs Follow Add Interview Follow Add Interview Interview Question Software Engineer Interview(Student Candidate) Singapore (Singapore) IBM The most difficult question started of with a recursion of the fibonacci series. Then it progressed into obtaining algorithms that fit a use case eg. create a recursion that generates this subset of the sequence represented by a binary tree but has to execute in (n*logn) Tags: technical, algorithm See more , See less 8 Answer Add Tags Answer Interview Answer 1 Answer ▲ 0 ▼ I am not clear about the second question. could you give an example? Second question on Oct 26, 2014 Interviews > Software Engineer > IBM Add Answers or Comments To comment on this, Sign In or Sign Up.