Software Engineer / Developer Interview Report
- 0of 0 votes
Answers1. Implement linked-list
- Cartman October 19, 2010
2. Use above to implement queue. Give time complexity of enqueue(), dequeue(), search(k)
3. Improve search(k) complexity to O(1) by modifying the above data stuuct( Hint: Linked Hashmaps)| Report Duplicate | Flag | PURGE
Software Engineer / Developer Data Structures - 0of 0 votes
AnswersGiven points (x1, y1) and (x2, y2) defining a line in XY plane, write functions bool isAboveLine(float x, float y) which returns true if the point (x,y) is above the give line or false if not.
- Cartman October 19, 2010| Report Duplicate | Flag | PURGE
Software Engineer / Developer Algorithm - 0of 0 votes
AnswerImplement recursive shuffle(int[] A, int n).
- Cartman October 19, 2010| Report Duplicate | Flag | PURGE
Software Engineer / Developer Algorithm - 0of 0 votes
AnswersImplement queue using stacks.
- Cartman October 19, 2010| Report Duplicate | Flag | PURGE
Software Engineer / Developer Data Structures
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.