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

Add Answers or Comments

To comment on this review, Sign In with Facebook or Sign Up