CODING PRACTICE PROBLEMS
CONTENT:
1. ARRAYS
2. STRINGS
3. SLIDING WINDOW AND TWO POINTERS
4. RECURSION AND BACKTRACKING
5. BIT MANIPULATION
6. HASHMAP
7. HEAPS
8. BINARY SEARCH
9. LINKEDLIST
10. STACKS AND QUEUES
11. TREES
12. TRIE
13. DYNAMIC PROGRAMMING
14. GRAPHS
no Questions Done
ARRAYS
1 Rotate Array
2 Squares of a sorted array
3 Kadane's Algo
4 Check if Array Is Sorted and Rotated - LeetCode
5 Remove Duplicates from Sorted Array - LeetCode
6 Move Zeroes - LeetCode
7 Max Consecutive Ones - LeetCode
8 Single Number - LeetCode
9 Two Sum - LeetCode
10 Sort Colors - LeetCode
11 maximum product subarray
12 majority element
13 majority element 2
14 Next Greater Element III
15 Max chunks to make sorted
16 Max Chunks To Make Sorted II
17 number of subarrays with bounded maximum
18 First missing positive
19 Range Addition
20 Min No. of Platform
21 Trapping rain water
22 Best Time to Buy and Sell Stock - LeetCode
STRINGS
23 Remove Outermost Parentheses - LeetCode
24 Reverse Words in a String - LeetCode
25 Largest Odd Number in String - LeetCode
26 Longest Common Prefix - LeetCode
27 Isomorphic Strings - LeetCode
28 Rotate String - LeetCode
29 Valid Anagram - LeetCode
30 Sort Characters By Frequency - LeetCode
31 Maximum Nesting Depth of the Parentheses - LeetCode
32 Roman to Integer - LeetCode
33 String to Integer (atoi) - LeetCode
34 Longest Palindromic Substring -
LeetCode
35 Sum of Beauty of All Substrings - LeetCode
36 Reverse Words in a String - LeetCode
SLIDING WINDOW AND TWO POINTERS
37 Container With Most Water
38 Two Sum
39 Two Difference
40 Longest Substring Without Repeating Characters - LeetCode
41 Max Consecutive Ones III - LeetCode
42 Longest Repeating Character Replacement - LeetCode
43 Binary Subarrays With Sum - LeetCode
44 Count Number of Nice Subarrays - LeetCode
45 Number of Substrings Containing All Three
Characters - LeetCode
46 Maximum Points You Can Obtain from
Cards - LeetCode
RECURSION AND BACKTRACKING
47 Permutations
48 Permutation Sequence
49 Combination Sum
50 Cmbination Sum 2
51 Letter combination of Phone number
52 N Queens
53 Rat in a Maze Path
BIT MANIPULATION
54 Single Element
55 Single Element 2
56 Single Number 3
57 Divide 2 Integers
58 Max AND Pair.
HASHMAP
59 Check AP sequence
60 Grid illumination
61 Brick wall
62 Count of subarray with sum = k
63 Subarray sum divisible by K
64 Insert Delete GetRandom O(1)
65 Insert delete get random duplicates allowed
66 Longest consecutive sequence
67 Find all anagrams in a string
68 Find smallest size of string containing all char of other
69 Write hashmap
70 subarray with equal number of 0 and 1
71 Substring with equal 0 1 and 2
HEAPS
72 Kth Largest Element
73 Minimum number of refueling spots
74 minimum cost to connect sticks
75 Employee Free time
76 Find Median from Data Stream
BINARY SEARCH
77 capacity to ship within D days
78 Painter's partition problem
79 search in rotated sorted array
80 Search in rotated sorted array 2
81 Allocate books
82 median of two sorted array
LINKEDLIST
83 reverse LinkedList
84 Find the middle element
85 Floyd cycle
86 Intersection point of 2 linked list
87 LRU Cache
STACKS AND QUEUES
88 Next Greater Element
89 Largest Rectangular Area Histogram
90 maximu size binary matrix containing 1
91 Valid Parentheses
92 Min Stack
93 K stacks in a single array
94 Infix evaluation
95 K reverse in a queue
96 K queue
TREES
97 Preorder Traversal
98 Inorder Traversal
99 Postorder Traversal
100 right side view
101 Left View
102 Top View
103 Bottom View
104 Vertical order
105 Diagonal Traversal
106 Boundary Traversal
107 Binary Tree Cameras
108 Max path sum
109 Delete node in bst
110 Construct from inorder and preorder
111 Next right pointer in each node
112 Convert a binary tree to circular doubly linked list
113 Conversion of sorted DLL to BST
114 Lowest common ancestor
115 serialize and deserialise
TRIE
117 Implement Trie
118 Max XOR of two numbers in an array
119 Maximum XOR with an element from Array
DYNAMIC PROGRAMMING
120 longest increasing subsequence
121 longest increasing subsequence
122 building bridges
123 Russian doll envelopes
124 Box stacking
125 Paint house
126 No. of binary string without consecutive 1
127 Possible ways to construct the building
128 Total no. of bst
129 No. of balanced parentheses sequence
130 Min cost path
131 Cherry pickup
132 Cherry pickup 2
133 best time to buy and sell stock
134 best time to buy and sell 2
135 buy and sell with transaction fee
136 best time to buy and sell with cool down
137 best time to buy and sell 3
138 best time to but and sell 4
139 burst balloons
140 Optimal BST
141 Matrix chain multiplication
142 Longest common subsequence
143 Count all pallindromic subsequence
144 Count distinct pallindromic subsequence
145 No. of sequence of type a^i+b^j+c^k
146 2 egg 100 floor
146 egg drop
148 Regular Expression Matching
149 Palindrome partitioning
150 Frog jump
151 Edit Distance
152 0-1 Knapsack
153 unbounded knapsack
154 Fractional knapsack
155 Coin change combination
156 Coin change permutation
GRAPHS
157 Number of Islands
158 Number of Distinct Islands
159 Rotting Oranges
160 Bipartite graph
161 Bus routes
162 Prim's Algo
163 Dijkstra algo
164 swim in rising water
165 0-1 matrix
166 bellman ford
167 Strongly Connected Components (Kosaraju's Algo)
168 Mother Vertex
169 Kahn's algo
170 Alien Dictionary
171 Number of Islands II
172 Regions Cut By Slashes
173 Sentence Similarity II
174 Redundant Connection
175 Redundant connection 2
176 Articulation point
177 Min swaps required to sort array
178 Sliding Puzzle
179 Floyd Warshall
180 remove max number of edges to keep graph traversal
