Software Interview questions : Set 12
Longest Palindromic Subsequence Design a stack that supports getMin() in O(1) time and O(1) extra space Depth First Traversal or DFS for a Graph Count Inversions in an array Extract Leaves of a Binary Tree in a Doubly Linked List Check if a given sequence of moves for a robot [...]