DSA Question Pattern Wise

Best DSA Course for You: CodeForSuccess

Arrays

1. Move Zeroes (Easy)

2. Majority Element (Easy)

3. Product of Array Except Self (Medium)

4. Best Time to Buy and Sell Stock II (Medium)

5. First Missing Positive (Hard)

Strings

6. Is Subsequence (Easy)

7. Valid Palindrome (Easy)

8. Reverse Words in a String (Medium)

Bit Manipulation

9. Single Number (Easy)

10. Counting Bits (Easy)

11. Single Number III (Medium)

Hash Tables

12. Isomorphic Strings (Easy)

13. Contains Duplicate II (Easy)

14. Group Anagrams (Medium)

15. Encode and Decode TinyURL (Medium)

16. Longest Consecutive Sequence (Medium)

Two Pointers

17. Two Sum II - Input Array Is Sorted (Medium)

18. Container With Most Water (Medium)

19. 3Sum (Medium)

20. Trapping Rain Water (Hard)

Prefix Sum

21. Range Sum Query - Immutable (Easy)

23. Contiguous Array (Medium)

Sliding Window - Fixed Size

24. Find All Anagrams in a String (Medium)

25. Permutation in String (Medium)

Sliding Window - Dynamic Size

26. Longest Substring Without Repeating Characters (Medium)

27. Minimum Window Substring (Hard)

Kadane's Algorithm

28. Maximum Subarray (Medium)

29. Maximum Product Subarray (Medium)

Matrix (2D Array)

30. Spiral Matrix (Medium)

31. Rotate Image (Medium)

32. Set Matrix Zeroes (Medium)

Linked List

33. Intersection of Two Linked Lists (Easy)

34. Remove Nth Node From End of List (Medium)

35. Swap Nodes in Pairs (Medium)

36. Rotate List (Medium)

37. Add Two Numbers (Medium)

LinkedList In-place Reversal

38. Reverse Linked List (Easy)

39. Reverse Nodes in k-Group (Hard)

Fast and Slow Pointers

40. Middle of the Linked List (Easy)

41. Linked List Cycle II (Medium)

Stacks

42. Valid Parentheses (Easy)

44. Remove Duplicate Letters (Medium)

45. Longest Valid Parentheses (Hard)

Monotonic Stack

46. Daily Temperatures (Medium)

47. Largest Rectangle in Histogram (Hard)

Monotonic Queue

48. Sliding Window Maximum (Hard)

Bucket Sort

49. Top K Frequent Words (Medium)

Recursion

50. Merge Two Sorted Lists (Easy)

51. Decode String (Medium)

Divide and Conquer

52. Convert Sorted List to Binary Search Tree (Medium)

Merge Sort

53. Sort List (Medium)

QuickSort / QuickSelect

54. Sort Colors (Medium)

55. Kth Largest Element in an Array (Medium)

Binary Search

56. Find First and Last Position of Element in Sorted Array (Medium)

57. Search in Rotated Sorted Array (Medium)

58. Find Peak Element (Medium)

59. Koko Eating Bananas (Medium)

60. Search a 2D Matrix (Medium)

61. Median of Two Sorted Arrays (Hard)

Backtracking

62. Generate Parentheses (Medium)

64. Subsets (Medium)

65. Palindrome Partitioning (Medium)

66. N-Queens (Hard)

Tree Traversal - Level Order

67. Binary Tree Level Order Traversal (Medium)

68. Binary Tree Right Side View (Medium)

69. Populating Next Right Pointers in Each Node II (Medium)

Tree Traversal - Pre Order

70. Binary Tree Preorder Traversal (Easy)

71. Symmetric Tree (Easy)

72. Convert Sorted Array to Binary Search Tree (Easy)

73. Path Sum III (Medium)

74. Construct Binary Tree from Preorder and Inorder Traversal (Medium)

75. Serialize and Deserialize Binary Tree (Hard)

Tree Traversal - In Order

76. Binary Tree Inorder Traversal (Easy)

77. Validate Binary Search Tree (Medium)

78. Kth Smallest Element in a BST (Medium)

79. Binary Search Tree Iterator (Medium)

Tree Traversal - Post-Order

80. Binary Tree Postorder Traversal (Easy)

81. Invert Binary Tree (Easy)

82. Diameter of Binary Tree (Easy)

83. Lowest Common Ancestor of a Binary Tree (Medium)

84. Binary Tree Maximum Path Sum (Hard)

BST / Ordered Set

85. My Calendar I (Medium)

86. My Calendar II (Medium)

Tries

88. Implement Trie (Prefix Tree) (Medium)

89. Design Add and Search Words Data Structure (Medium)

90. Search Suggestions System (Medium)

91. Word Search II (Hard)

Heaps

92. Furthest Building You Can Reach (Medium)

93. Single-Threaded CPU (Medium)

Two Heaps

94. Find Median from Data Stream (Hard)

95. IPO (Hard)

Top K Elements

96. Kth Largest Element in a Stream (Easy)

97. Top K Frequent Elements (Medium)

98. K Closest Points to Origin (Medium)

Intervals

99. Merge Intervals (Medium)

100. Insert Interval (Medium)

101. Non-overlapping Intervals (Medium)

K-Way Merge

102. Kth Smallest Element in a Sorted Matrix (Medium)

103. Merge k Sorted Lists (Hard)

Data Structure Design

104. Design Browser History (Medium)

105. LRU Cache (Medium)

106. Insert Delete GetRandom O(1) (Medium)

107. Maximum Frequency Stack (Hard)

Greedy
 108. Jump Game II (Medium)

109. Gas Station (Medium)

110. Task Scheduler (Medium)

Depth First Search (DFS)

111. Number of Islands (Medium)

112. Clone Graph (Medium)

113. Is Graph Bipartite? (Medium)

114. Surrounded Regions (Medium)

115. Pacific Atlantic Water Flow (Medium)

Breadth First Search (BFS)

116. Rotting Oranges (Medium)

117. 01 Matrix (Medium)

118. Word Ladder (Hard)

Topological Sort

119. Course Schedule II (Medium)

Union Find

120. Number of Provinces (Medium)

121. Redundant Connection (Medium)

Minimum Spanning Tree

122. Min Cost to Connect All Points (Medium)

Shortest Path

123. Network Delay Time (Medium)

124. Cheapest Flights Within K Stops (Medium)

125. Swim in Rising Water (Hard)

1-D DP

126. Climbing Stairs (Easy)

127. House Robber II (Medium)

Knapsack DP

128. Partition Equal Subset Sum (Medium)

Unbounded Knapsack DP

130. Coin Change (Medium)

131. Coin Change II (Medium)

Longest Increasing Subsequence DP

132. Longest Increasing Subsequence (Medium)

133. Russian Doll Envelopes (Hard)

2D (Grid) DP

134. Unique Paths II (Medium)

135. Minimum Path Sum (Medium)

136. Count Square Submatrices with All Ones (Medium)

137. Longest Increasing Path in a Matrix (Hard)

String DP

138. Longest Common Subsequence (Medium)

139. Longest Palindromic Subsequence (Medium)

140. Decode Ways (Medium)

141. Word Break (Medium)

Tree / Graph DP

142. House Robber III (Medium)

143. Unique Binary Search Trees II (Medium)

144. Binary Tree Cameras (Hard)

Bitmask DP

145. Fair Distribution of Cookies (Medium)

146. Shortest Path Visiting All Nodes (Hard)

State Machine DP

147. Best Time to Buy and Sell Stock III (Hard)

Maths / Geometry

148. Palindrome Number (Easy)

149. Reverse Integer (Medium)