1. Construct Binary Tree from given Parent Array representation
  2. Calculate XOR from 1 to n
  3. Connect Nodes at same Level
  4. Flatten Binary Tree to Linked List
  5. Clone a linked list with next and random pointer in O(1) space
  6. Detect cycle in an undirected graph
  7. Delete nodes which have a greater value on right side
  8. Find distance between two nodes of a Binary Tree
  9. Clone a Binary Tree with Random Pointers
  10. Find all possible words in a board of characters
  11. Convert a given Binary Tree to Doubly Linked List
  12. Find if there is a triplet in a Balanced BST that adds to zero
  13. Inorder Tree Traversal without Recursion
  14. Find a pair with given sum in a Balanced BST
  15. Find four elements that sum to a given value
  16. Partition a set into two subsets such that the difference of subset sums is minimum
  17. Nuts & Bolts Problem
  18. Remove minimum elements from either side such that 2*min becomes more than max
  19. Median of Stream of Running Integers
  20. K’th largest element in a stream
  21. Arrange given numbers to form the biggest number
  22. Two nodes of a BST are swapped, correct the BST
  23. Kahn’s algorithm for Topological Sorting
    Reference :- Topological Sort
  24. Given a sorted dictionary of an alien language, find order of characters
  25. Given an array arr[], find the maximum j – i such that arr[j] > arr[i]
    Reference :- A Distance Maximizing Problem

Related Posts

  1. Software Interview questions : Set 9
  2. Software Interview questions : Set 4
  3. Software Interview questions : Set 7
  4. Software Interview questions : Set 31
  5. Software Interview questions : Set 1