Complete the itinerary from the collection of air tickets.
Solve the 8 puzzle
Find the best path in at most K hops
Find the sum of nodes in a BST that fall in a given range
Find the shortest transformation sequence
Implement a special stack that supports getMin() in constant time.
Minimum Cost to Connect All Cities
1: Find the peak element
2: Find the sub-array with the largest sum.
1: Number of ways to construct the array.
2: The Josephus Problem
1: Find all the combinations with the given sum
3: Find the anagram substring.
2: Number of substrings starting with a vowel.
1: Valid IP addresses.
3: Find the majority element.
2: Minimum numbers of candies required.
1: Minimum flips to turn all the bulbs on.
1: Minimum number of swaps needed to sort the array.
1: Edit distance between words.
1: Longest substring with unique characters
2: Find the duplicate number in an array
1: Remove duplicates from a sorted array without extra space.
2: Minimum letters to be added at the beginning to make palindrome.
1: Letter combinations from numbers of a keypad.
3: Find the maximum sum of the array after K negations.
2: Can the circular trip be completed with given fuel and cost?
1: Jumping steps in the array.
5: Find the maximum path sum of a binary tree.
4: Find the diameter of a binary tree.
3: Check if a binary tree is a binary search tree.
2: Convert a binary tree into a doubly linked list, in place.
1: Implement a file syncing algorithm for a low-bandwidth network
1: Partition set into sets of equal sum
2: Trapping rain water
3: Merge overlapping intervals
4: Find longest increasing subsequence in nlogn
5: Convert to strictly increasing array
6: Find next greater element