0% found this document useful (0 votes)
88 views9 pages

List of 250

The document is a comprehensive list of over 250 easy and medium data structure and algorithm (DSA) questions categorized by topics such as Arrays, Strings, Linked Lists, Stacks & Queues, Trees, Graphs, Dynamic Programming, Backtracking, Sorting & Searching, and Bit Manipulation. Each category includes specific problems with varying levels of difficulty, primarily focusing on easy and medium challenges. This resource serves as a guide for individuals preparing for coding interviews or enhancing their programming skills.

Uploaded by

Lakshya Jangid
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
88 views9 pages

List of 250

The document is a comprehensive list of over 250 easy and medium data structure and algorithm (DSA) questions categorized by topics such as Arrays, Strings, Linked Lists, Stacks & Queues, Trees, Graphs, Dynamic Programming, Backtracking, Sorting & Searching, and Bit Manipulation. Each category includes specific problems with varying levels of difficulty, primarily focusing on easy and medium challenges. This resource serves as a guide for individuals preparing for coding interviews or enhancing their programming skills.

Uploaded by

Lakshya Jangid
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

List of 250+ Easy and Medium DSA Questions

Arrays

1. Two Sum (Easy)

2. Best Time to Buy and Sell Stock (Easy)

3. Contains Duplicate (Easy)

4. Product of Array Except Self (Medium)

5. Maximum Subarray (Easy)

6. Find Minimum in Rotated Sorted Array (Medium)

7. Search in Rotated Sorted Array (Medium)

8. 3Sum (Medium)

9. Container With Most Water (Medium)

10. Move Zeroes (Easy)

11. Find All Numbers Disappeared in an Array (Easy)

12. Spiral Matrix (Medium)

13. Rotate Image (Medium)

14. Set Matrix Zeroes (Medium)

15. Merge Intervals (Medium)

16. Insert Interval (Medium)

17. Next Permutation (Medium)

18. Game of Life (Medium)

19. Pascal's Triangle (Easy)

20. Majority Element (Easy)

21. Single Number (Easy)

22. Missing Number (Easy)

23. Intersection of Two Arrays II (Easy)

24. Plus One (Easy)


25. Remove Duplicates from Sorted Array (Easy)

Strings

26. Valid Anagram (Easy)

27. Group Anagrams (Medium)

28. Longest Substring Without Repeating Characters (Medium)

29. Longest Palindromic Substring (Medium)

30. Minimum Window Substring (Medium)

31. Valid Parentheses (Easy)

32. Generate Parentheses (Medium)

33. Implement strStr() (Easy)

34. Longest Common Prefix (Easy)

35. Word Break (Medium)

36. Word Search (Medium)

37. Palindrome Partitioning (Medium)

38. Multiply Strings (Medium)

39. Zigzag Conversion (Medium)

40. Simplify Path (Medium)

41. Reverse Words in a String (Medium)

42. Add Binary (Easy)

43. Count and Say (Easy)

44. Length of Last Word (Easy)

45. Valid Palindrome (Easy)

46. Reverse String (Easy)

47. Reverse Vowels of a String (Easy)

48. Detect Capital (Easy)


49. To Lower Case (Easy)

50. Unique Morse Code Words (Easy)

Linked Lists

51. Reverse Linked List (Easy)

52. Merge Two Sorted Lists (Easy)

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

54. Linked List Cycle (Easy)

55. Add Two Numbers (Medium)

56. Reorder List (Medium)

57. Copy List with Random Pointer (Medium)

58. Intersection of Two Linked Lists (Easy)

59. Palindrome Linked List (Easy)

60. Swap Nodes in Pairs (Medium)

61. Odd Even Linked List (Medium)

62. Sort List (Medium)

63. Partition List (Medium)

64. Flatten a Multilevel Doubly Linked List (Medium)

65. Delete Node in a Linked List (Easy)

66. Middle of the Linked List (Easy)

67. Convert Binary Number in a Linked List to Integer (Easy)

68. Remove Linked List Elements (Easy)

69. Merge k Sorted Lists (Hard)

70. Design Linked List (Medium)

Stacks & Queues


71. Valid Parentheses (Easy)

72. Min Stack (Easy)

73. Evaluate Reverse Polish Notation (Medium)

74. Daily Temperatures (Medium)

75. Implement Queue using Stacks (Easy)

76. Decode String (Medium)

77. Basic Calculator II (Medium)

78. Design Circular Queue (Medium)

79. Exclusive Time of Functions (Medium)

80. Asteroid Collision (Medium)

81. Queue Reconstruction by Height (Medium)

82. Backspace String Compare (Easy)

83. Remove All Adjacent Duplicates In String (Easy)

84. Validate Stack Sequences (Medium)

85. Number of Recent Calls (Easy)

86. Implement Stack using Queues (Easy)

87. Simplify Path (Medium)

88. Remove K Digits (Medium)

89. Score of Parentheses (Medium)

90. Next Greater Element I (Easy)

Trees

91. Binary Tree Inorder Traversal (Easy)

92. Symmetric Tree (Easy)

93. Maximum Depth of Binary Tree (Easy)

94. Same Tree (Easy)


95. Invert Binary Tree (Easy)

96. Binary Tree Level Order Traversal (Medium)

97. Validate Binary Search Tree (Medium)

98. Kth Smallest Element in a BST (Medium)

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

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

101. Path Sum II (Medium)

102. Populating Next Right Pointers in Each Node (Medium)

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

104. Binary Tree Paths (Easy)

105. Subtree of Another Tree (Easy)

106. Balanced Binary Tree (Easy)

107. Diameter of Binary Tree (Easy)

108. Binary Tree Zigzag Level Order Traversal (Medium)

109. Binary Search Tree Iterator (Medium)

110. Sum of Left Leaves (Easy)

111. Most Frequent Subtree Sum (Medium)

112. Find Mode in Binary Search Tree (Easy)

Graphs

113. Number of Islands (Medium)

114. Clone Graph (Medium)

115. Course Schedule (Medium)

116. Pacific Atlantic Water Flow (Medium)

117. Network Delay Time (Medium)

118. Cheapest Flights Within K Stops (Medium)


119. Shortest Path in Binary Matrix (Medium)

120. Redundant Connection (Medium)

121. Flood Fill (Easy)

122. Is Graph Bipartite? (Medium)

123. All Paths From Source to Target (Medium)

124. Keys and Rooms (Medium)

125. Reconstruct Itinerary (Medium)

126. Find the Town Judge (Easy)

127. Find Center of Star Graph (Easy)

128. Find if Path Exists in Graph (Easy)

129. Number of Provinces (Medium)

130. Surrounded Regions (Medium)

131. Rotting Oranges (Medium)

132. Walls and Gates (Medium)

133. Course Schedule II (Medium)

Dynamic Programming

134. Climbing Stairs (Easy)

135. House Robber (Medium)

136. Coin Change (Medium)

137. Longest Increasing Subsequence (Medium)

138. Unique Paths (Medium)

139. Partition Equal Subset Sum (Medium)

140. Decode Ways (Medium)

141. Word Break (Medium)

142. Longest Palindromic Subsequence (Medium)


143. Minimum Path Sum (Medium)

144. Triangle (Medium)

145. Perfect Squares (Medium)

146. Jump Game (Medium)

147. Combination Sum IV (Medium)

148. Best Time to Buy and Sell Stock II (Easy)

149. House Robber II (Medium)

150. Paint House (Medium)

151. Longest Common Subsequence (Medium)

152. Coin Change 2 (Medium)

153. Target Sum (Medium)

154. Arithmetic Slices (Medium)

155. Maximal Square (Medium)

Backtracking

156. Subsets (Medium)

157. Permutations (Medium)

158. Combination Sum (Medium)

159. Letter Combinations of a Phone Number (Medium)

160. Word Search (Medium)

161. Generate Parentheses (Medium)

162. Restore IP Addresses (Medium)

163. Palindrome Partitioning (Medium)

164. Combinations (Medium)

165. Permutations II (Medium)

166. Combination Sum II (Medium)


167. Subsets II (Medium)

168. N-Queens (Hard)

169. Sudoku Solver (Hard)

170. Beautiful Arrangement (Medium)

Sorting & Searching

171. Merge Intervals (Medium)

172. Insert Interval (Medium)

173. Top K Frequent Elements (Medium)

174. K Closest Points to Origin (Medium)

175. Meeting Rooms II (Medium)

176. Search a 2D Matrix (Medium)

177. Search in Rotated Sorted Array (Medium)

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

179. H-Index (Medium)

180. Wiggle Sort II (Medium)

181. Kth Largest Element in an Array (Medium)

182. Sort Colors (Medium)

183. Find Peak Element (Medium)

184. Search Insert Position (Easy)

185. First Bad Version (Easy)

186. Find Smallest Letter Greater Than Target (Easy)

187. Peak Index in a Mountain Array (Easy)

188. Find Minimum in Rotated Sorted Array II (Medium)

189. Search a 2D Matrix II (Medium)

190. Find K Closest Elements (Medium)


Bit Manipulation

191. Single Number (Easy)

192. Counting Bits (Easy)

193. Missing Number (Easy)

194. Reverse Bits (Easy)

195. Power of Two (Easy)

196. Hamming Distance (Easy)

197. Number of 1 Bits (Easy)

198. Bitwise AND of Numbers Range (Medium)

199. Subsets (Medium)

200. Gray Code (Medium)

201. Single Number III (Medium)

202. Maximum XOR of Two Numbers in an Array (Medium)

203. Sum of Two Integers (Medium)

204. Divide Two Integers (Medium)

205. Bitwise ORs of Subarrays (Medium)

You might also like