Mahmud
BAN USERlove to help people
Comments (6)
Reputation 0
Page:
1
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
0
of 0 vote
@Kamal
Definitely your algorithm return true when any pair found but you have to pay attention to few things
1. Efficiency of the algorithm : your solution is O(n*n) running time with O(1) space. Can you make it better with more space? Yes look at my first comment.
2. Also you need to look at the requirements. So you need to return the indexes of element probably not just only true.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
yes it would be enough given that 11 bit only represents positive numbers
- Mahmud September 20, 2014