GitHub - TASHMITVERMA/leetcode_top150: Solving Challenging Questions.

LeetCode Top 150

Problem	Algorithms	Time Complexity	Space Complexity
49.Group Anagrams	Miscellaneous	O(N)	O(N)
121. Best Time to Buy and Sell Stock	Sliding window	O(N)	O(N)
191. Number of 1 Bits	Miscellaneous	O(N)	O(logN)
104. Maximum Depth of Binary Tree	DFS	O(N)	O(1)
502. IPO	Priority Queue Greedy	O(nlogn + klogn)	O(N)
15. 3Sum	2 pointer	O(nlog n)	O(1)
13. Roman to Integer	Misc	O(N)	O(1)
19. Remove Nth Node From End of List	slow fast	O(N)	O(1)
380. Insert Delete GetRandom O(1)	Misc	O(1)	O(1)
130. Surrounded Regions	DFS	O(V*E)	O(N)
201. Bitwise AND of Numbers Range	Bit manipulation	O(log n)	O(1)
141. Linked List Cycle	turtle hare	O(N)	O(1)
322. Coin Change	DP	O(m*n)	O(N)
173. Binary Search Tree Iterator	DFS	O(N)	O(N)
290. Word Pattern	2 way mapping	O(N)	O(N)
392. Is Subsequence	pointer	O(N)	O(1)
14. Longest Common Prefix	Misc	O(Nlog N)+N)	O(1)
134. Gas Station	misc	O(N)	O(1)
64. Minimum Path Sum	Misc	O(N*M)	O(N*M)
128. Longest Consecutive Sequence	Hash set	O(N)	O(N)
45. Jump Game II	Misc	O(N)	O(1)
39. Combination Sum	Backtrack	O(2^(n))	O(N)
162. Find Peak Element	Binary Search	O(log N)	O(1)
238. Product of Array Except Self	Left-Right prod	O(N)	O(N)
27. Remove Element	Misc	O(N)	O(1)
198. House Robber	DP	O(N)	O(N
219. Contains Duplicate II	algo-hash	O(N)	O(N)
222. Count Complete Tree Nodes	dfs	O(N)	O(N)
242. Valid Anagram	Array	O(N)	O(1)
530. Minimum Absolute Difference in BST	inorder	O(nlog(n)+n)	O(N)
17. Letter Combinations of a Phone Number	rec	O(4^digit length*n)	O(1)
5. Longest Palindromic Substring	DP	O(N^2)	O(N)
101. Symmetric Tree	DFS	O(N)	O(1)
226. Invert Binary Tree	Post order	O(N)	O(1)
36. Valid Sudoku	2D-DP	O(N^2)	O(N^2)
274. H-Index	Greedy	O(NlogN)	O(1)
151. Reverse Words in a String	2 POINTER	O(N)	O(N)
135. Candy	Greedy	O(N)	O(N)
209. Minimum Size Subarray Sum	2 POINTER	O(N)	O(1)
200. Number of Islands	DP	O(N2)	O(N2
11. Container With Most Water	sliding window	O(N)	O(1)
100. Same Tree	DFS	O(N)	O(1)
67. Add Binary	Misc	O(N)	O(1)
22. Generate Parentheses	Recursion	O(2^N)	O(1)
212. Word Search II	DFS	O(TLE)
74. Search a 2D Matrix	binary search	O(NlogN)	O(N2)
25. Reverse Nodes in k-Group	LL	O(N)	O(1)
63. Unique Paths II	Dp	O(N2)	O(N2)
295. Find Median from Data Stream	HEAP	O(N)	O(N)
30. Substring with Concatenation of All Words	Sliding window	O(N2)	O(1)
205. Isomorphic Strings	Map	O(N)	O(N)
21. Merge Two Sorted Lists	LL	O(N)	O(N)
73. Set Matrix Zeroes	Misc	O(N2)	O(N)
133. Clone Graph	DFS	O(V+E)	O(V)
106. Construct Binary Tree from Inorder and Postorder Traversal	Recur	O(N)	O(1)
70. Climbing Stairs	DP	O(N)	O(N)
33. Search in Rotated Sorted Array	Binary search	log(N)	O(1)
300. Longest Increasing Subsequence	Binary Search	O(nlogn)	O(1)
12. Integer to Roman	Misc	O(1)	O(1)
105. Construct Binary Tree from Preorder and Inorder Traversal	DFS	O(N)	O(N)
228. Summary Ranges	Misc	O(N)	O(N)
46. Permutations	Recur	O(N*N!)	O(N)
122. Best Time to Buy and Sell Stock II	DP	O(N)	O(N)
117. Populating Next Right Pointers in Each Node II	Tree	O(N)	O(N)
76. Minimum Window Substring	Sliding window with Hash	O(N)	O(1)
190. Reverse Bits	Bit Manipulation	O(n)	O(1)
50. Pow(x, n	Recur	O(logN)	O(logN)
53. Maximum Subarray	Greedy	O(N)	O(1)
34. Find First and Last Position of Element in Sorted Array	BInary search	log(N)	O(1)
120. Triangle	DP	O(N2)	O(N)
50. Evaluate Reverse Polish Notation	Misc	O(N)	O(N)
4. Median of Two Sorted Arrays	Binary search	O(log (m+n))	O(1)
215. Kth Largest Element in an Array	Misc	O(nlogn)	O(n)
189. Rotate Array	Misc	O(N)	O(1)
129. Sum Root to Leaf Numbers	BFS	O(N)	O(1)
82. Remove Duplicates from Sorted List II	LL	O(N)	O(1)
56. Merge Intervals	Misc	O(nlogn)	O(1)
124. Binary Tree Maximum Path Sum	BFS	O(N)	O(1)
25. Valid Palindrome	Misc	O(n)	O(1)
48. Rotate Image	Misc	O(n2)	O(1)
289. Game of Life	Misc	O(mn)	O(1)
79. Word Search	Recur	O(M * N * 4^L)	O(L)
3. Longest Substring Without Repeating Characters	sliding window	O(n)	O(1)
236. Lowest Common Ancestor of a Binary Tree	DFS	O(n)	O(1)
42. Trapping Rain Water	sliding window	O(N)	O(1)
28. Find the Index of the First Occurrence in a String	Misc	O(MN)	O(1)
167. Two Sum II - Input Array Is Sorted	sliding	O(n)	O(1)
383. Ransom Note	Hashing	O(n)	O(n)
68. Text Justification	Misc	O(n)	O(n)
72. Edit Distance	DP	O(N2)	O(N2)
--	--	--	--
--	--	--	--
--	--	--	--
--	--	--	--
--	--	--	--
--	--	--	--

Name		Name	Last commit message	Last commit date
Latest commit History 133 Commits
100. Same Tree.cpp		100. Same Tree.cpp
101. Symmetric Tree.cpp		101. Symmetric Tree.cpp
103. Binary Tree Zigzag Level Order Traversal.cpp		103. Binary Tree Zigzag Level Order Traversal.cpp
104. Maximum Depth of Binary Tree.cpp		104. Maximum Depth of Binary Tree.cpp
105. Construct Binary Tree from Preorder and Inorder Traversal.cpp		105. Construct Binary Tree from Preorder and Inorder Traversal.cpp
106. Construct Binary Tree from Inorder and Postorder Traversal.cpp		106. Construct Binary Tree from Inorder and Postorder Traversal.cpp
108. Convert Sorted Array to Binary Search Tree.cpp		108. Convert Sorted Array to Binary Search Tree.cpp
11. Container With Most Water.cpp		11. Container With Most Water.cpp
112. Path Sum.cpp		112. Path Sum.cpp
117. Populating Next Right Pointers in Each Node II.cpp		117. Populating Next Right Pointers in Each Node II.cpp
12. Integer to Roman.cpp		12. Integer to Roman.cpp
120. Triangle.cpp		120. Triangle.cpp
122. Best Time to Buy and Sell Stock II.cpp		122. Best Time to Buy and Sell Stock II.cpp
124. Binary Tree Maximum Path Sum.cpp		124. Binary Tree Maximum Path Sum.cpp
128. Longest Consecutive Sequence.cpp		128. Longest Consecutive Sequence.cpp
129. Sum Root to Leaf Numbers.cpp		129. Sum Root to Leaf Numbers.cpp
13. Roman to Integer.cpp		13. Roman to Integer.cpp
130. Surrounded Regions.cpp		130. Surrounded Regions.cpp
133. Clone Graph.cpp		133. Clone Graph.cpp
134. Gas Station.cpp		134. Gas Station.cpp
135. Candy.cpp		135. Candy.cpp
136. Single Number.cpp		136. Single Number.cpp
137. Single Number II.cpp		137. Single Number II.cpp
14. Longest Common Prefix.cpp		14. Longest Common Prefix.cpp
141. Linked List Cycle.cpp		141. Linked List Cycle.cpp
146. LRU Cache.cpp		146. LRU Cache.cpp
148. Sort List.cpp		148. Sort List.cpp
149. Max Points on a Line.cpp		149. Max Points on a Line.cpp
15. 3Sum.cpp		15. 3Sum.cpp
1608. Special Array With X Elements Greater Than or Equal X.cpp		1608. Special Array With X Elements Greater Than or Equal X.cpp
162. Find Peak Element.cpp		162. Find Peak Element.cpp
167. Two Sum II - Input Array Is Sorted.cpp		167. Two Sum II - Input Array Is Sorted.cpp
17. Letter Combinations of a Phone Number.cpp		17. Letter Combinations of a Phone Number.cpp
172. Factorial Trailing Zeroes.cpp		172. Factorial Trailing Zeroes.cpp
173. Binary Search Tree Iterator.cpp		173. Binary Search Tree Iterator.cpp
189. Rotate Array.cpp		189. Rotate Array.cpp
19. Remove Nth Node From End of List.cpp		19. Remove Nth Node From End of List.cpp
190. Reverse Bits.cpp		190. Reverse Bits.cpp
191. Number of 1 Bits.cpp		191. Number of 1 Bits.cpp
198. House Robber.cpp		198. House Robber.cpp
199. Binary Tree Right Side View.cpp		199. Binary Tree Right Side View.cpp
2. Add Two Numbers.cpp		2. Add Two Numbers.cpp
200. Number of Islands.cpp		200. Number of Islands.cpp
201. Bitwise AND of Numbers Range.cpp		201. Bitwise AND of Numbers Range.cpp
205. Isomorphic Strings.cpp		205. Isomorphic Strings.cpp
209. Minimum Size Subarray Sum.cpp		209. Minimum Size Subarray Sum.cpp
21. Merge Two Sorted Lists.cpp		21. Merge Two Sorted Lists.cpp
215. Kth Largest Element in an Array.cpp		215. Kth Largest Element in an Array.cpp
219. Contains Duplicate II.cpp		219. Contains Duplicate II.cpp
22. Generate Parentheses.cpp		22. Generate Parentheses.cpp
222. Count Complete Tree Nodes.cpp		222. Count Complete Tree Nodes.cpp
226. Invert Binary Tree.cpp		226. Invert Binary Tree.cpp
228. Summary Ranges.cpp		228. Summary Ranges.cpp
238. Product of Array Except Self.cpp		238. Product of Array Except Self.cpp
242. Valid Anagram.cpp		242. Valid Anagram.cpp
25. Reverse Nodes in k-Group.cpp		25. Reverse Nodes in k-Group.cpp
27. Remove Element.cpp		27. Remove Element.cpp
274. H-Index.cpp		274. H-Index.cpp
28. Find the Index of the First Occurrence in a String.cpp		28. Find the Index of the First Occurrence in a String.cpp
290. Word Pattern.cpp		290. Word Pattern.cpp
295. Find Median from Data Stream.cpp		295. Find Median from Data Stream.cpp
30. Substring with Concatenation of All Words.cpp		30. Substring with Concatenation of All Words.cpp
300. Longest Increasing Subsequence.cpp		300. Longest Increasing Subsequence.cpp
3180. Maximum Total Reward Using Operations I.cpp		3180. Maximum Total Reward Using Operations I.cpp
322. Coin Change.cpp		322. Coin Change.cpp
33. Search in Rotated Sorted Array.cpp		33. Search in Rotated Sorted Array.cpp
34. Find First and Last Position of Element in Sorted Array.cpp		34. Find First and Last Position of Element in Sorted Array.cpp
36. Valid Sudoku.cpp		36. Valid Sudoku.cpp
373. Find K Pairs with Smallest Sums.cpp		373. Find K Pairs with Smallest Sums.cpp
380. Insert Delete GetRandom O(1).cpp		380. Insert Delete GetRandom O(1).cpp
383. Ransom Note.cpp		383. Ransom Note.cpp
39. Combination Sum.cpp		39. Combination Sum.cpp
392. Is Subsequence.cpp		392. Is Subsequence.cpp
42. Trapping Rain Water.cpp		42. Trapping Rain Water.cpp
45. Jump Game II.cpp		45. Jump Game II.cpp
46. Permutations.cpp		46. Permutations.cpp
48. Rotate Image.cpp		48. Rotate Image.cpp
49. Group Anagrams.cpp		49. Group Anagrams.cpp
5. Longest Palindromic Substring.cpp		5. Longest Palindromic Substring.cpp
50. Pow(x, n).cpp		50. Pow(x, n).cpp
502. IPO.cpp		502. IPO.cpp
51. Reverse Words in a String.cpp		51. Reverse Words in a String.cpp
53. Maximum Subarray.cpp		53. Maximum Subarray.cpp
530. Minimum Absolute Difference in BST.cpp		530. Minimum Absolute Difference in BST.cpp
55. Jump Game.cpp		55. Jump Game.cpp
56. Merge Intervals.cpp		56. Merge Intervals.cpp
57. Insert Interval.cpp		57. Insert Interval.cpp
61. Rotate List.cpp		61. Rotate List.cpp
63. Unique Paths II.cpp		63. Unique Paths II.cpp
637. Average of Levels in Binary Tree.cpp		637. Average of Levels in Binary Tree.cpp
64. Minimum Path Sum.cpp		64. Minimum Path Sum.cpp
67. Add Binary.cpp		67. Add Binary.cpp
69. Sqrt(x).cpp		69. Sqrt(x).cpp
70. Climbing Stairs.cpp		70. Climbing Stairs.cpp
71. Simplify Path.cpp		71. Simplify Path.cpp
72. Edit Distance.cpp		72. Edit Distance.cpp
73. Set Matrix Zeroes.cpp		73. Set Matrix Zeroes.cpp
76. Minimum Window Substring.cpp		76. Minimum Window Substring.cpp
80. Remove Duplicates from Sorted Array II.cpp		80. Remove Duplicates from Sorted Array II.cpp
82. Remove Duplicates from Sorted List II.cpp		82. Remove Duplicates from Sorted List II.cpp

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

About

Releases

Packages

Languages

TASHMITVERMA/leetcode_top150

Folders and files

Latest commit

History

Repository files navigation

About

Topics

Resources

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages