IBM Interview Question: The most difficult question s... | Glassdoor

Interview Question

Software Engineer Interview(Student Candidate) Singapore (Singapore)

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)
technical, algorithm

Interview Answer

1 Answer


I am not clear about the second question. could you give an example?

Second question on Oct 26, 2014

Add Answers or Comments

To comment on this, Sign In or Sign Up.