SET 1
- Vertical Sum in a given Binary Tree
- Design a data structure that supports insert, delete, search and getRandom in constant time
- Print a Binary Tree in Vertical Order | Set 2 (Hashmap based Method)
- Longest Consecutive Subsequence
- Largest subarray with equal number of 0s and 1s
SET 2
- Largest Continuous Sequence Zero Sum
- Find Itinerary from a given list of tickets
- Find number of Employees Under every Employee
- Check if an array can be divided into pairs whose sum is divisible by k
- Longest Substring Without Repeat
SET 4:
- Find the largest subarray with 0 sum
- Anagrams
- Count distinct elements in every window of size k
- Clone a Binary Tree with Random Pointers
- Find missing elements of a range
SET 5:
- Find four elements a, b, c and d in an array such that a+b = c+d
- Find the 'K'th most frequent number in array
- Points on the Straight Line
- Fraction
- Window String
SET 6:
Comments
Post a Comment