Given an array of size 2n+2 of which there are n pairs and remaining two are unique. How to find them in O(n) time and constant space.
Posts
1 year ago
Mar 18, 2008
Subscribe to:
Post Comments (Atom)
skip to main |
skip to sidebar
Feel free to contribute, however it will be moderated to curb spams.
Contributors
Labels
- Arrays (12)
- Backtracking (3)
- Bit Twiddling (5)
- Coin Puzzles (2)
- Common Puzzles (2)
- Data Structure (4)
- Dynamic Programming (3)
- Graph Algorithms (6)
- Hashing (1)
- Interview Questions (1)
- J2EE (1)
- Java (5)
- Linked Lists (6)
- LVL:AVG (1)
- Numeric Puzzles (4)
- Programming (1)
- Sorting (2)
- Trees (5)
- Tries (1)
- UNSOLVED (3)
Followers
Blog Archive
-
▼
2008
(52)
-
▼
March
(18)
- Find minimum steps required
- Some java fun !
- some more stupid array questions
- a different doubly linked list
- largest common structurally similar sub tree
- Find two non repeated numbers
- simple array qusetions
- find nth max element in BST(Binary search tree)
- Find nth fibonacci number
- Randomized Shuffling Problem
- partition
- median problem
- Smallest subsequence
- extra paranthesis
- Adobe face to face interviews
- Merge point in two linked lists
- Find possible parenthesizing
- Stack with findMin() in O(1) worst case
-
▼
March
(18)
No comments:
Post a Comment