DSAWiser

DSA question set · 393 questions

Arrays DSA Practice Questions

Explore 393 DSA questions in Arrays. Practice with DSAWiser’s code editor and visualizer.

RecursionArraysGreedyMathSortingTwo PointersSliding WindowBinary SearchHeap (Priority Queue)Hash TableDivide and ConquerBacktrackingDynamic ProgrammingGame TheoryBinary Indexed TreeStringsMonotonic StackPrefix SumQueueStackUnion FindGraphHeapMonotonic QueueBit ManipulationFenwick Tree

What’s in this set

The Arrays collection contains 393 problems: 125 basic, 120 easy, 98 medium, 50 hard. Choose a question at your current level, or follow the collection’s order below.

Topics in this collection include Recursion, Arrays, Greedy, Math, Sorting. Each question shows its own topics and difficulty so you can decide where to begin.

Practice with the code visualizer

  1. Open a question in the editor and read the statement, inputs, and expected output. Predict the result for a small example before writing code.
  2. Write a solution and run the examples. If a result differs from your prediction, reduce the input until you can follow each step.
  3. Step through your code in the visualizer. Use a breakpoint to inspect the state at a specific line, then compare it with your reasoning.

Questions in this set

393 total

Open a question in the editor to read its statement and examples. Sign in to practice.

  1. Print Array Elements in Forward OrderRecursion · ArraysBasic
  2. Print Array Elements in Reverse OrderRecursion · ArraysBasic
  3. Sum of Array ElementsRecursion · ArraysBasic
  4. Product of Array ElementsRecursion · ArraysBasic
  5. Find Maximum Element in an ArrayRecursion · ArraysBasic
  6. Find Minimum Element in an ArrayRecursion · ArraysBasic
  7. Linear Search in an ArrayRecursion · ArraysBasic
  8. Count Occurrences in an ArrayRecursion · ArraysBasic
  9. Find First Index of an ElementRecursion · ArraysBasic
  10. Count Even Numbers in an ArrayRecursion · ArraysBasic
  11. Check if Array is SortedRecursion · ArraysBasic
  12. Count Negative Numbers in an ArrayRecursion · ArraysBasic
  13. Check if All Elements are PositiveRecursion · ArraysBasic
  14. Find Last Index of an ElementRecursion · ArraysBasic
  15. Heavier BasketGreedy · ArraysBasic
  16. Take While You CanGreedy · ArraysBasic
  17. Counting Sock PairsArrays · MathBasic
  18. Largest Number from DigitsGreedy · Sorting · MathBasic
  19. Smallest Number from DigitsGreedy · Sorting · MathBasic
  20. Weekly SavingsGreedy · ArraysBasic
  21. Sticker AlternationGreedy · ArraysBasic
  22. Maximum of the ListArraysBasic
  23. Minimum of the ListArraysBasic
  24. Record-Breaking DaysArraysBasic
  25. Hotter Than YesterdayArraysBasic
  26. Longest Same-Value StretchArraysBasic
  27. Longest Warm StretchGreedy · ArraysBasic
  28. Always the Better OptionGreedy · ArraysBasic
  29. Range of the ListArraysBasic
  30. Peaks in the RowArraysBasic
  31. Increasing PrefixArraysBasic
  32. Best Trade DayGreedy · ArraysBasic
  33. Longest Run of Even NumbersArraysBasic
  34. Best Pair of NeighborsGreedy · ArraysBasic
  35. Score Reset GameGreedy · ArraysBasic
  36. Safe SpendingGreedy · ArraysBasic
  37. Merge Two Sorted ListsTwo Pointers · ArraysBasic
  38. Sum of the k LargestGreedy · Sorting · ArraysBasic
  39. Cheapest PairGreedy · ArraysBasic
  40. Both Take the LargestGreedy · Sorting · ArraysBasic
  41. Two Boxes, First FitGreedy · ArraysBasic
  42. One Free PurchaseGreedy · ArraysBasic
  43. Maximum ItemsGreedy · Sorting · ArraysBasic
  44. Take the Larger EndGreedy · Two Pointers · ArraysBasic
  45. Sum of First and Last ElementTwo Pointers · ArraysBasic
  46. Compare First and Last ElementTwo Pointers · ArraysBasic
  47. Swap Elements at Two PointersTwo Pointers · ArraysBasic
  48. Count Matching Opposite PairsTwo Pointers · ArraysBasic
  49. First Mismatched Opposite PairTwo Pointers · ArraysBasic
  50. Pairwise Sums from Outside-InTwo Pointers · ArraysBasic
  51. Pairwise Products from Outside-InTwo Pointers · ArraysBasic
  52. Check Array Symmetry (Exact Match)Two Pointers · ArraysBasic
  53. Count Elements Between Two PointersTwo Pointers · ArraysBasic
  54. Compare Values at Left and Right PointersTwo Pointers · ArraysBasic
  55. Reverse an ArrayTwo Pointers · ArraysBasic
  56. Reverse Subarray Between Two Pointer IndicesTwo Pointers · ArraysBasic
  57. Reverse Only the First K ElementsTwo Pointers · ArraysBasic
  58. Check If Array is Already Reversed Copy of AnotherTwo Pointers · ArraysBasic
  59. Move Left Pointer Until Non-ZeroTwo Pointers · ArraysBasic
  60. Move Right Pointer Until Non-ZeroTwo Pointers · ArraysBasic
  61. First and Last Occurrence of TargetTwo Pointers · ArraysBasic
  62. Trim Matching End ValuesTwo Pointers · ArraysBasic
  63. Sum of Extreme Elements After Moving Inward K StepsTwo Pointers · ArraysBasic
  64. Compare Adjacent ElementsTwo Pointers · ArraysBasic
  65. Count Consecutive Identical ElementsTwo Pointers · ArraysBasic
  66. Filter Non-Zero Elements (Write Pointer Simulation)Two Pointers · ArraysBasic
  67. Difference Between Pointers with Fixed Offset KTwo Pointers · ArraysBasic
  68. Check If Any Adjacent Pair Sums to TargetTwo Pointers · ArraysBasic
  69. Find Middle Element via Fast-Slow PointerTwo Pointers · ArraysBasic
  70. Compare Heads of Two ArraysTwo Pointers · ArraysBasic
  71. Simulate One Merge StepTwo Pointers · ArraysBasic
  72. Count Identical Elements at Matching Pointers (Lockstep)Two Pointers · ArraysBasic
  73. Sum of Elements at Two Independent PointersTwo Pointers · ArraysBasic
  74. Count Positions Where Pointer A Exceeds Pointer BTwo Pointers · ArraysBasic
  75. Check Pair Sum Against Target (Single Step Check)Two Pointers · ArraysBasic
  76. Decide Next Pointer Move for Two SumTwo Pointers · ArraysBasic
  77. First Move Inward on Sorted ExtremesTwo Pointers · ArraysBasic
  78. Difference Between Array Extremes (Max - Min in Sorted Array)Two Pointers · ArraysBasic
  79. Count Steps Until Pair Sum Condition FailsTwo Pointers · ArraysBasic
  80. Single Step Inward Swap (Odd-Even Pointer Partition Step)Two Pointers · ArraysBasic
  81. Count Inversions Between Opposing EndsTwo Pointers · ArraysBasic
  82. Check Symmetry with at Most One MismatchTwo Pointers · ArraysBasic
  83. Remove Target Value Using Write PointerTwo Pointers · ArraysBasic
  84. Merge Step: Choose Smaller from Array HeadsTwo Pointers · ArraysBasic
  85. First Window of Size KSliding Window · ArraysBasic
  86. Last Window of Size KSliding Window · ArraysBasic
  87. All Window Boundary IndicesSliding Window · ArraysBasic
  88. Outgoing and Incoming Elements on SlideSliding Window · ArraysBasic
  89. Second Window Sum from First WindowSliding Window · ArraysBasic
  90. Sum of Every Adjacent PairSliding Window · ArraysBasic
  91. Sum of Every TripletSliding Window · ArraysBasic
  92. Sum of All Fixed Windows of Size KSliding Window · ArraysBasic
  93. Maximum Sum of Window of Size 2Sliding Window · ArraysBasic
  94. Minimum Sum of Window of Size 2Sliding Window · ArraysBasic
  95. Maximum Sum of Window of Size KSliding Window · ArraysBasic
  96. Minimum Sum of Window of Size KSliding Window · ArraysBasic
  97. Average of Each Window of Size KSliding Window · ArraysBasic
  98. Count Windows with Sum Greater Than TargetSliding Window · ArraysBasic
  99. Count Windows of Size K with Even SumSliding Window · ArraysBasic
  100. Check If Any Window of Size K Sums to TargetSliding Window · ArraysBasic
  101. Count Windows Containing at Least One ZeroSliding Window · ArraysBasic
  102. Count Windows Where All Elements Are PositiveSliding Window · ArraysBasic
  103. Absolute Difference Between Window EndsSliding Window · ArraysBasic
  104. Windows of Size 3 with Strictly Increasing OrderSliding Window · ArraysBasic
  105. Windows of Size 3 Where Middle Element Is PeakSliding Window · ArraysBasic
  106. Maximum Element in Windows of Size 2Sliding Window · ArraysBasic
  107. Range in Windows of Size 2Sliding Window · ArraysBasic
  108. Product of Every Window of Size 2Sliding Window · ArraysBasic
  109. Count Odd Numbers in Each Window of Size KSliding Window · ArraysBasic
  110. Count Windows with Exactly One Negative NumberSliding Window · ArraysBasic
  111. Count Windows of Size 3 with Sum Equal to ZeroSliding Window · ArraysBasic
  112. Alternating Parity Windows of Size 2Sliding Window · ArraysBasic
  113. Compare Sum of First Window and Last WindowSliding Window · ArraysBasic
  114. Largest Difference Between Consecutive Window SumsSliding Window · ArraysBasic
  115. First Window to Reach Target SumSliding Window · ArraysBasic
  116. Index of Window with Maximum SumSliding Window · ArraysBasic
  117. Count Windows Whose Sum Equals TargetSliding Window · ArraysBasic
  118. Count Windows of Size 2 with Identical ElementsSliding Window · ArraysBasic
  119. Count Windows with at Least Half Even NumbersSliding Window · ArraysBasic
  120. Number of Zeros in Each Binary WindowSliding Window · ArraysBasic
  121. Sliding Window Step DifferencesSliding Window · ArraysBasic
  122. Count Windows Where First Element Equals Last ElementSliding Window · ArraysBasic
  123. Count Windows of Size 2 with Positive ProductSliding Window · ArraysBasic
  124. First Window with All Elements Greater Than XSliding Window · ArraysBasic
  125. Parity of Each Window SumSliding Window · ArraysBasic
  126. Recursive Binary SearchRecursion · Binary Search · ArraysEasy
  127. Check if Array is a PalindromeRecursion · Arrays · Two PointersEasy
  128. Reverse an Array In-PlaceRecursion · Arrays · Two PointersEasy
  129. Find All Indices of an ElementRecursion · ArraysEasy
  130. Check if Array is Strictly IncreasingRecursion · ArraysEasy
  131. Count Adjacent Duplicate PairsRecursion · ArraysEasy
  132. Recursive Bubble SortRecursion · Arrays · SortingEasy
  133. Recursive Selection SortRecursion · Arrays · SortingEasy
  134. Recursive Insertion SortRecursion · Arrays · SortingEasy
  135. Merge Two Sorted Arrays RecursivelyRecursion · Arrays · SortingEasy
  136. Alternating Sum of ArrayRecursion · ArraysEasy
  137. Check if Two Arrays are IdenticalRecursion · ArraysEasy
  138. Subset Sum ExistenceRecursion · ArraysEasy
  139. Greatest Common Divisor of an ArrayRecursion · Math · ArraysEasy
  140. Check Alternating Signs in ArrayRecursion · ArraysEasy
  141. First Occurrence via Binary SearchRecursion · Binary Search · ArraysEasy
  142. Count Subsets with Given SumRecursion · ArraysEasy
  143. Cookie GiveawayGreedy · Two Pointers · Arrays · SortingEasy
  144. Profit from Every RiseGreedy · ArraysEasy
  145. Lemonade StandGreedy · ArraysEasy
  146. Two Teams SplitGreedy · Sorting · ArraysEasy
  147. Rescue RaftsGreedy · Two Pointers · Arrays · SortingEasy
  148. Movie MarathonGreedy · Sorting · ArraysEasy
  149. One Screen, Few CancellationsGreedy · Sorting · ArraysEasy
  150. Shortest Job FirstGreedy · Sorting · ArraysEasy
  151. Tandem BicyclesGreedy · Sorting · ArraysEasy
  152. Pair and Sum the SmallerGreedy · Sorting · ArraysEasy
  153. Flower Bed SpacingGreedy · ArraysEasy
  154. Matching SeatsGreedy · Sorting · ArraysEasy
  155. Mice and HolesGreedy · Sorting · ArraysEasy
  156. Chocolate PacksGreedy · Sorting · ArraysEasy
  157. Buy Two ChocolatesGreedy · Sorting · ArraysEasy
  158. Largest Perimeter TriangleGreedy · Sorting · Arrays · MathEasy
  159. Sign FlipsGreedy · Sorting · ArraysEasy
  160. Joining RopesGreedy · Heap (Priority Queue) · ArraysEasy
  161. Fractional LootGreedy · Sorting · ArraysEasy
  162. All Papers on TimeGreedy · Sorting · ArraysEasy
  163. Sorting by PiecesGreedy · ArraysEasy
  164. Pairs Under the LimitTwo Pointers · ArraysEasy
  165. Calm PartnersGreedy · Two Pointers · Sorting · ArraysEasy
  166. Just Enough Fuel StopsGreedy · ArraysEasy
  167. Gathering the ChipsGreedy · Math · ArraysEasy
  168. Candy Shop OfferGreedy · Sorting · ArraysEasy
  169. Alternating LightsGreedy · ArraysEasy
  170. Two Sum, SortedTwo Pointers · ArraysEasy
  171. One Calendar CheckGreedy · Sorting · ArraysEasy
  172. Level the StepsGreedy · ArraysEasy
  173. Minimizing the Product SumGreedy · Sorting · ArraysEasy
  174. Trees with Elbow RoomGreedy · Sorting · ArraysEasy
  175. Take the Bigger HalfGreedy · Sorting · ArraysEasy
  176. Close PairsGreedy · Sorting · Two Pointers · ArraysEasy
  177. Zigzag OrderGreedy · Sorting · ArraysEasy
  178. Meet in the MiddleMath · Sorting · ArraysEasy
  179. Jobs Before Their DeadlinesGreedy · Sorting · ArraysEasy
  180. Taxi FleetGreedy · Sorting · Two Pointers · ArraysEasy
  181. Two Sum II — Input Array Is SortedTwo Pointers · ArraysEasy
  182. Squares of a Sorted ArrayTwo Pointers · ArraysEasy
  183. Sort Array By ParityTwo Pointers · ArraysEasy
  184. Move ZeroesTwo Pointers · ArraysEasy
  185. Remove Duplicates from Sorted ArrayTwo Pointers · ArraysEasy
  186. Remove ElementTwo Pointers · ArraysEasy
  187. Apply Operations to an ArrayTwo Pointers · ArraysEasy
  188. Duplicate ZerosTwo Pointers · ArraysEasy
  189. Merge Two Sorted ArraysTwo Pointers · ArraysEasy
  190. Intersection of Two Sorted Arrays (Unique Elements)Two Pointers · ArraysEasy
  191. Intersection of Two Sorted Arrays II (With Multiplicities)Two Pointers · ArraysEasy
  192. Assign CookiesTwo Pointers · Arrays · GreedyEasy
  193. Sort Array By Parity IITwo Pointers · ArraysEasy
  194. Count Pairs Whose Sum is Less than TargetTwo Pointers · ArraysEasy
  195. Count Pairs with Absolute Difference Equal to KTwo Pointers · ArraysEasy
  196. Minimum Common ValueTwo Pointers · ArraysEasy
  197. Maximum Pair Sum Under BudgetTwo Pointers · ArraysEasy
  198. Cycle Detection Using Floyd's Algorithm (Pointer Simulation)Two Pointers · ArraysEasy
  199. Find Second Middle Element via Fast-Slow PointerTwo Pointers · ArraysEasy
  200. Check If N and Its Double ExistTwo Pointers · ArraysEasy
  201. Sort Array of 0s and 1sTwo Pointers · ArraysEasy
  202. Count Hills and Valleys in an ArrayTwo Pointers · ArraysEasy
  203. Find Target Indices After Sorting ArrayTwo Pointers · Arrays · SortingEasy
  204. Count Pairs with Given Sum in Sorted ArrayTwo Pointers · ArraysEasy
  205. Two Furthest Houses with Different ColorsTwo Pointers · Arrays · GreedyEasy
  206. Count Elements Strictly Between ExtremesTwo Pointers · ArraysEasy
  207. Complete Two-Pointer Sorted Array MergeTwo Pointers · ArraysEasy
  208. Maximum Average Subarray of Size KSliding Window · ArraysEasy
  209. Minimum Average Subarray of Size KSliding Window · ArraysEasy
  210. Count Windows of Size K with Average at Least ThresholdSliding Window · ArraysEasy
  211. Diet Plan PerformanceSliding Window · ArraysEasy
  212. Maximum Points You Can Obtain from CardsSliding Window · ArraysEasy
  213. Minimum Swaps to Group All 1's TogetherSliding Window · ArraysEasy
  214. Defuse the Bomb — Forward WindowSliding Window · ArraysEasy
  215. Defuse the Bomb — Backward WindowSliding Window · ArraysEasy
  216. Maximum Circular Subarray Sum of Fixed Size KSliding Window · ArraysEasy
  217. Minimum Swaps to Group All 1's in a Circular Binary ArraySliding Window · ArraysEasy
  218. Consecutive Ones in a Circular Binary Array of Fixed Size KSliding Window · ArraysEasy
  219. Grumpy Bookstore OwnerSliding Window · ArraysEasy
  220. Maximum Span in Windows of Size ThreeSliding Window · ArraysEasy
  221. Maximum Sum of Window with No Adjacent DuplicatesSliding Window · ArraysEasy
  222. Maximum Elements Below Cap in Window of Size KSliding Window · ArraysEasy
  223. Best Fixed Holding Period ProfitSliding Window · ArraysEasy
  224. Count Windows of Size K Divisible by MSliding Window · ArraysEasy
  225. Longest Run of Satisfied Fixed WindowsSliding Window · ArraysEasy
  226. Check If All Windows Have Positive SumSliding Window · ArraysEasy
  227. First Negative Number in Every Window of Size KSliding Window · ArraysEasy
  228. Smallest Subarray with Sum at Least TargetSliding Window · ArraysEasy
  229. Longest Subarray with Sum at Most TargetSliding Window · ArraysEasy
  230. Count Subarrays with Sum Less Than TargetSliding Window · ArraysEasy
  231. Maximum Consecutive Ones with At Most One FlipSliding Window · ArraysEasy
  232. Longest Continuous Segment of OnesSliding Window · ArraysEasy
  233. Subarray Product Less Than KSliding Window · ArraysEasy
  234. Longest Contiguous Segment of Identical ElementsSliding Window · ArraysEasy
  235. Shortest Subsegment Containing Both 0 and 1Sliding Window · ArraysEasy
  236. Longest Subarray of 1's After Deleting One ElementSliding Window · ArraysEasy
  237. Count Subarrays with At Most K Odd NumbersSliding Window · ArraysEasy
  238. Shortest Subarray Containing M Occurrences of XSliding Window · ArraysEasy
  239. Longest Subarray with Max Difference at Most 1Sliding Window · ArraysEasy
  240. Maximum Sum of Two Non-Overlapping Windows of Size KSliding Window · ArraysEasy
  241. Frequency of Target Element in Every Window of Size KSliding Window · ArraysEasy
  242. Fruit Into BasketsSliding Window · Arrays · Hash TableEasy
  243. Max Consecutive Ones IIISliding Window · ArraysEasy
  244. Count Binary Subarrays with At Most K OnesSliding Window · ArraysEasy
  245. Minimum Difference Between Highest and Lowest of K ScoresSliding Window · Arrays · SortingEasy
  246. Merge SortRecursion · Arrays · Sorting · Divide and ConquerMedium
  247. Quick SortRecursion · Arrays · Sorting · Divide and ConquerMedium
  248. Subsets (Power Set)Recursion · Backtracking · ArraysMedium
  249. Permutations of an ArrayRecursion · Backtracking · ArraysMedium
  250. Subsets II (With Duplicates)Recursion · Backtracking · ArraysMedium
  251. Combination Sum (Unbounded Reuse)Recursion · Backtracking · ArraysMedium
  252. Combination Sum II (Single-Use with Duplicates)Recursion · Backtracking · ArraysMedium
  253. Permutations II (With Duplicates)Recursion · Backtracking · ArraysMedium
  254. Target Sum (+ / - Assignments)Recursion · Dynamic Programming · BacktrackingMedium
  255. Partition Equal Subset SumRecursion · Dynamic ProgrammingMedium
  256. 0/1 KnapsackRecursion · Dynamic ProgrammingMedium
  257. Coin Change (Minimum Coins)Recursion · Dynamic ProgrammingMedium
  258. House RobberRecursion · Dynamic Programming · ArraysMedium
  259. Non-Decreasing SubsequencesRecursion · Backtracking · ArraysMedium
  260. Predict the Winner (Minimax Recursion)Recursion · Game Theory · ArraysMedium
  261. Partition to K Equal Sum SubsetsRecursion · Backtracking · Dynamic ProgrammingMedium
  262. Fair Distribution of CookiesRecursion · Backtracking · ArraysMedium
  263. The Number of Beautiful SubsetsRecursion · Backtracking · ArraysMedium
  264. Matchsticks to SquareRecursion · Backtracking · ArraysMedium
  265. Circular Fuel TourGreedy · ArraysMedium
  266. Can You Cross the Swamp?Greedy · Arrays · Dynamic ProgrammingMedium
  267. Arrow RainGreedy · Sorting · ArraysMedium
  268. Fewest Jumps AcrossGreedy · Arrays · Dynamic ProgrammingMedium
  269. Queue ReformationGreedy · Binary Indexed Tree · Sorting · ArraysMedium
  270. Energy CardsGreedy · Two Pointers · Sorting · ArraysMedium
  271. Stitching the FilmGreedy · Dynamic Programming · ArraysMedium
  272. Biggest ConcatenationGreedy · Sorting · StringsMedium
  273. Runs of K CardsGreedy · Sorting · Arrays · Hash TableMedium
  274. Fewest RoomsGreedy · Sorting · Heap (Priority Queue) · ArraysMedium
  275. Rotate the DominoesGreedy · ArraysMedium
  276. Bus LoadGreedy · Arrays · SortingMedium
  277. Garden TapsGreedy · Dynamic Programming · ArraysMedium
  278. Removing the RaritiesGreedy · Hash Table · Sorting · ArraysMedium
  279. Gathering the OnesGreedy · Sliding Window · ArraysMedium
  280. Ladders and BricksGreedy · Heap (Priority Queue) · ArraysMedium
  281. Best CrewGreedy · Sorting · ArraysMedium
  282. One Fix SortGreedy · ArraysMedium
  283. Happiest DinersGreedy · Sorting · ArraysMedium
  284. Building the Target TripletGreedy · ArraysMedium
  285. Biggest Cake PieceSorting · ArraysMedium
  286. Prize SelectionGreedy · Hash Table · Sorting · ArraysMedium
  287. Pancake ChefGreedy · Two Pointers · Sorting · ArraysMedium
  288. Car ConvoysGreedy · Sorting · Arrays · Monotonic StackMedium
  289. Gift BasketsGreedy · Sorting · ArraysMedium
  290. Merge Time BlocksGreedy · Sorting · ArraysMedium
  291. Strict Zigzag OrderGreedy · Sorting · ArraysMedium
  292. Scenic Photo PairGreedy · Arrays · Dynamic ProgrammingMedium
  293. Counting Positive PrefixesGreedy · Sorting · ArraysMedium
  294. Marking the IndicesGreedy · Two Pointers · Sorting · ArraysMedium
  295. Leveling the PeaksGreedy · ArraysMedium
  296. Marble BagsGreedy · Sorting · ArraysMedium
  297. Task Reordering EnergyGreedy · Sorting · ArraysMedium
  298. Field BloomGreedy · Sorting · ArraysMedium
  299. Cake Cutting CostsGreedy · Sorting · ArraysMedium
  300. Largest Multiple of ThreeGreedy · Dynamic Programming · ArraysMedium
  301. Diminishing TreasureGreedy · Binary Search · Sorting · Arrays · MathMedium
  302. Fair Weighted LevellingGreedy · Binary Search · Sorting · ArraysMedium
  303. 3SumTwo Pointers · Arrays · SortingMedium
  304. 3Sum ClosestTwo Pointers · Arrays · SortingMedium
  305. 3Sum SmallerTwo Pointers · Arrays · SortingMedium
  306. Valid Triangle NumberTwo Pointers · Arrays · SortingMedium
  307. 4SumTwo Pointers · Arrays · SortingMedium
  308. Container With Most WaterTwo Pointers · Arrays · GreedyMedium
  309. Boats to Save PeopleTwo Pointers · Arrays · Greedy · SortingMedium
  310. Bag of TokensTwo Pointers · Arrays · Greedy · SortingMedium
  311. HeatersTwo Pointers · Arrays · Binary Search · SortingMedium
  312. Minimize Maximum Pair Sum in ArrayTwo Pointers · Arrays · Greedy · SortingMedium
  313. Sort Colors (Dutch National Flag Algorithm)Two Pointers · Arrays · SortingMedium
  314. Remove Duplicates from Sorted Array IITwo Pointers · ArraysMedium
  315. Rotate Array via Three ReversalsTwo Pointers · Arrays · MathMedium
  316. Longest Mountain in ArrayTwo Pointers · ArraysMedium
  317. Interval List IntersectionsTwo Pointers · ArraysMedium
  318. Find the Duplicate Number (Floyd's Cycle Detection)Two Pointers · Arrays · Binary SearchMedium
  319. Number of Subsequences with Min + Max $\le$ TargetTwo Pointers · Arrays · SortingMedium
  320. Next PermutationTwo Pointers · ArraysMedium
  321. Find K Closest ElementsTwo Pointers · Arrays · SortingMedium
  322. Shortest Unsorted Continuous SubarrayTwo Pointers · Arrays · SortingMedium
  323. Circular Array LoopTwo Pointers · ArraysMedium
  324. Binary Subarrays With SumSliding Window · Arrays · Prefix SumMedium
  325. Count Number of Nice SubarraysSliding Window · Arrays · Prefix SumMedium
  326. Subarrays with K Different IntegersSliding Window · Arrays · Hash TableMedium
  327. Continuous Subarrays with Difference at Most TwoSliding Window · Arrays · QueueMedium
  328. Maximum Erasure ValueSliding Window · Arrays · Hash TableMedium
  329. Maximum Sum of Distinct Subarrays with Length KSliding Window · Arrays · Hash TableMedium
  330. Minimum Operations to Reduce X to ZeroSliding Window · Arrays · Prefix SumMedium
  331. Frequency of the Most Frequent ElementSliding Window · Arrays · SortingMedium
  332. Maximum Beauty of an Array After OperationSliding Window · Arrays · SortingMedium
  333. Longest Subarray with Absolute Difference At Most LimitSliding Window · Arrays · QueueMedium
  334. Minimum Changes to Make Array ContinuousSliding Window · Arrays · SortingMedium
  335. Longest Subarray with At Most Two Occurrences of Each ElementSliding Window · Arrays · Hash TableMedium
  336. Maximum White Tiles Covered by a CarpetSliding Window · Arrays · SortingMedium
  337. Sliding Subarray BeautySliding Window · Arrays · Hash TableMedium
  338. Maximum Free Time After Rescheduling Consecutive MeetingsSliding Window · Arrays · GreedyMedium
  339. Minimum Window Covering All Unique ValuesSliding Window · Arrays · Hash TableMedium
  340. Count Subarrays Where Max Element Appears At Least K TimesSliding Window · ArraysMedium
  341. Smallest Range Covering Elements from All ListsSliding Window · Arrays · Hash TableMedium
  342. Count Complete Subarrays in an ArraySliding Window · Arrays · Hash TableMedium
  343. Length of Longest Subarray With At Most K FrequencySliding Window · Arrays · Hash TableMedium
  344. Burst Balloons (Interval Divide-and-Conquer)Recursion · Arrays · Dynamic Programming · Divide and ConquerHard
  345. Frog JumpRecursion · Arrays · Dynamic ProgrammingHard
  346. Stone Game III (Minimax with Multi-Move Choice)Recursion · Math · Dynamic Programming · Game TheoryHard
  347. Split Array With Same AverageRecursion · Arrays · Math · Dynamic ProgrammingHard
  348. Minimum Cost to Cut a StickRecursion · Arrays · Dynamic Programming · SortingHard
  349. Count of Smaller Numbers After SelfRecursion · Arrays · Divide and Conquer · Binary SearchHard
  350. K-th Element in Two Sorted ArraysRecursion · Arrays · Binary Search · Divide and ConquerHard
  351. Event MarathonGreedy · Heap (Priority Queue) · Arrays · SortingHard
  352. Course Deadline CrunchGreedy · Heap (Priority Queue) · Arrays · SortingHard
  353. Fuel RefitsGreedy · Heap (Priority Queue) · Arrays · Dynamic ProgrammingHard
  354. Team PerformanceGreedy · Heap (Priority Queue) · Arrays · SortingHard
  355. Venture CapitalGreedy · Heap (Priority Queue) · Arrays · SortingHard
  356. Money Before TradingGreedy · Sorting · ArraysHard
  357. Computer RuntimeGreedy · Binary Search · Arrays · SortingHard
  358. Value PatchingGreedy · ArraysHard
  359. K Consecutive FlipsGreedy · Queue · Sliding Window · ArraysHard
  360. Latest Possible TasksGreedy · Sorting · ArraysHard
  361. Smallest Range Across ListsGreedy · Heap (Priority Queue) · Sliding Window · ArraysHard
  362. Two Rows, One Giant NumberGreedy · Monotonic Stack · Stack · ArraysHard
  363. Sorting by Pieces IIGreedy · Monotonic Stack · Sorting · ArraysHard
  364. Couples at the PartyGreedy · Union Find · Graph · ArraysHard
  365. Rearranging FruitsGreedy · Hash Table · Sorting · ArraysHard
  366. Washers in a RowGreedy · ArraysHard
  367. Meeting Rooms, NumberedGreedy · Heap (Priority Queue) · Sorting · ArraysHard
  368. Fair BonusesGreedy · ArraysHard
  369. Trapping Rain WaterTwo Pointers · Arrays · Dynamic ProgrammingHard
  370. Maximum Score of a Good SubarrayTwo Pointers · Arrays · GreedyHard
  371. First Missing Positive (Cyclic Pointer Placement)Two Pointers · Arrays · Hash TableHard
  372. Smallest Range Covering Elements from K ListsTwo Pointers · Arrays · Heap · SortingHard
  373. Count Subarrays With Fixed BoundsTwo Pointers · Arrays · QueueHard
  374. Minimum Operations to Make Array ContinuousTwo Pointers · Arrays · Binary Search · SortingHard
  375. Candy Distribution via Two-Pointer Slope TrackingTwo Pointers · Arrays · GreedyHard
  376. Subarrays with Exactly K Different IntegersTwo Pointers · Arrays · Hash Table · Sliding WindowHard
  377. Count Good Subarrays with at Least K Duplicate PairsTwo Pointers · Arrays · Hash TableHard
  378. Shortest Subarray with Sum at Least KTwo Pointers · Arrays · Queue · Sliding WindowHard
  379. Maximum Sum of Three Non-Overlapping SubarraysTwo Pointers · Arrays · Dynamic ProgrammingHard
  380. Find Minimum in Rotated Sorted Array II (Duplicate Boundary Collapse)Two Pointers · Arrays · Binary SearchHard
  381. Sliding Window Maximum (Monotonic Index Deque)Two Pointers · Arrays · Queue · Sliding WindowHard
  382. Count Subarrays with Median KTwo Pointers · Arrays · Hash TableHard
  383. Sliding Window MaximumSliding Window · Arrays · Queue · Monotonic QueueHard
  384. Sliding Window MedianSliding Window · Arrays · HeapHard
  385. Maximum Number of Robots Within BudgetSliding Window · Arrays · Queue · Monotonic QueueHard
  386. Constrained Subsequence SumSliding Window · Arrays · Dynamic Programming · QueueHard
  387. Shortest Subarray with Bitwise OR at Least KSliding Window · Arrays · Bit ManipulationHard
  388. Maximum Fruits Harvested After at Most K StepsSliding Window · Arrays · Prefix SumHard
  389. Shortest Subarray with at Least K InversionsSliding Window · Arrays · Fenwick TreeHard
  390. Max Value of Equation with Sliding Coordinate WindowSliding Window · Arrays · Queue · Monotonic QueueHard
  391. Minimum Cost to Make Elements in Window of Size K EqualSliding Window · Arrays · HeapHard
  392. Shortest Subarray with Bitwise AND At Most KSliding Window · Arrays · Bit ManipulationHard
  393. Maximum Frequency in Every Window of Size KSliding Window · Arrays · Hash TableHard