DSAWiser

DSA question set · 150 questions

Two Pointers DSA Practice Questions

Explore 150 DSA questions in Two Pointers. Practice with DSAWiser’s code editor and visualizer.

Two PointersArraysStringsGreedyMatrixSortingMathBinary SearchDynamic ProgrammingHash TableHeapQueueSliding WindowGeometry

What’s in this set

The Two Pointers collection contains 150 problems: 50 basic, 50 easy, 30 medium, 20 hard. Choose a question at your current level, or follow the collection’s order below.

Topics in this collection include Two Pointers, Arrays, Strings, Greedy, Matrix. 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

150 total

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

  1. Sum of First and Last ElementTwo Pointers · ArraysBasic
  2. Compare First and Last ElementTwo Pointers · ArraysBasic
  3. Distance Between Two IndicesTwo PointersBasic
  4. Swap Elements at Two PointersTwo Pointers · ArraysBasic
  5. Check If Pointers Have Met or CrossedTwo PointersBasic
  6. Generate Opposite Index PairsTwo PointersBasic
  7. Count Matching Opposite PairsTwo Pointers · ArraysBasic
  8. First Mismatched Opposite PairTwo Pointers · ArraysBasic
  9. Pairwise Sums from Outside-InTwo Pointers · ArraysBasic
  10. Pairwise Products from Outside-InTwo Pointers · ArraysBasic
  11. Check Array Symmetry (Exact Match)Two Pointers · ArraysBasic
  12. Check Palindrome String (Exact Match)Two Pointers · StringsBasic
  13. Number of Steps Until Pointers MeetTwo PointersBasic
  14. Count Elements Between Two PointersTwo Pointers · ArraysBasic
  15. Compare Values at Left and Right PointersTwo Pointers · ArraysBasic
  16. Reverse an ArrayTwo Pointers · ArraysBasic
  17. Reverse a StringTwo Pointers · StringsBasic
  18. Reverse Subarray Between Two Pointer IndicesTwo Pointers · ArraysBasic
  19. Reverse Only the First K ElementsTwo Pointers · ArraysBasic
  20. Check If Array is Already Reversed Copy of AnotherTwo Pointers · ArraysBasic
  21. Move Left Pointer Until Non-ZeroTwo Pointers · ArraysBasic
  22. Move Right Pointer Until Non-ZeroTwo Pointers · ArraysBasic
  23. First and Last Occurrence of TargetTwo Pointers · ArraysBasic
  24. Trim Matching End ValuesTwo Pointers · ArraysBasic
  25. Sum of Extreme Elements After Moving Inward K StepsTwo Pointers · ArraysBasic
  26. Compare Adjacent ElementsTwo Pointers · ArraysBasic
  27. Count Consecutive Identical ElementsTwo Pointers · ArraysBasic
  28. Filter Non-Zero Elements (Write Pointer Simulation)Two Pointers · ArraysBasic
  29. Difference Between Pointers with Fixed Offset KTwo Pointers · ArraysBasic
  30. Check If Any Adjacent Pair Sums to TargetTwo Pointers · ArraysBasic
  31. Simulate Slow (1x) and Fast (2x) PointersTwo PointersBasic
  32. Find Middle Element via Fast-Slow PointerTwo Pointers · ArraysBasic
  33. Fast Pointer Step CountTwo PointersBasic
  34. Circular Slow and Fast Pointers After K StepsTwo PointersBasic
  35. Check Parity of Fast Pointer StopTwo PointersBasic
  36. Compare Heads of Two ArraysTwo Pointers · ArraysBasic
  37. Simulate One Merge StepTwo Pointers · ArraysBasic
  38. Count Identical Elements at Matching Pointers (Lockstep)Two Pointers · ArraysBasic
  39. Sum of Elements at Two Independent PointersTwo Pointers · ArraysBasic
  40. Count Positions Where Pointer A Exceeds Pointer BTwo Pointers · ArraysBasic
  41. Check Pair Sum Against Target (Single Step Check)Two Pointers · ArraysBasic
  42. Decide Next Pointer Move for Two SumTwo Pointers · ArraysBasic
  43. First Move Inward on Sorted ExtremesTwo Pointers · ArraysBasic
  44. Difference Between Array Extremes (Max - Min in Sorted Array)Two Pointers · ArraysBasic
  45. Count Steps Until Pair Sum Condition FailsTwo Pointers · ArraysBasic
  46. Single Step Inward Swap (Odd-Even Pointer Partition Step)Two Pointers · ArraysBasic
  47. Count Inversions Between Opposing EndsTwo Pointers · ArraysBasic
  48. Check Symmetry with at Most One MismatchTwo Pointers · ArraysBasic
  49. Remove Target Value Using Write PointerTwo Pointers · ArraysBasic
  50. Merge Step: Choose Smaller from Array HeadsTwo Pointers · ArraysBasic
  51. Two Sum II — Input Array Is SortedTwo Pointers · ArraysEasy
  52. Reverse Vowels of a StringTwo Pointers · StringsEasy
  53. Valid Palindrome (Alphanumeric Only)Two Pointers · StringsEasy
  54. Squares of a Sorted ArrayTwo Pointers · ArraysEasy
  55. Sort Array By ParityTwo Pointers · ArraysEasy
  56. Move ZeroesTwo Pointers · ArraysEasy
  57. Remove Duplicates from Sorted ArrayTwo Pointers · ArraysEasy
  58. Remove ElementTwo Pointers · ArraysEasy
  59. Apply Operations to an ArrayTwo Pointers · ArraysEasy
  60. Duplicate ZerosTwo Pointers · ArraysEasy
  61. Merge Two Sorted ArraysTwo Pointers · ArraysEasy
  62. Intersection of Two Sorted Arrays (Unique Elements)Two Pointers · ArraysEasy
  63. Intersection of Two Sorted Arrays II (With Multiplicities)Two Pointers · ArraysEasy
  64. Is SubsequenceTwo Pointers · StringsEasy
  65. Assign CookiesTwo Pointers · Arrays · GreedyEasy
  66. Valid Palindrome II (At Most One Character Deletion)Two Pointers · StringsEasy
  67. Backspace String CompareTwo Pointers · StringsEasy
  68. Reverse Words in a String IIITwo Pointers · StringsEasy
  69. Sort Array By Parity IITwo Pointers · ArraysEasy
  70. Flipping an ImageTwo Pointers · Arrays · MatrixEasy
  71. Count Pairs Whose Sum is Less than TargetTwo Pointers · ArraysEasy
  72. Count Pairs with Absolute Difference Equal to KTwo Pointers · ArraysEasy
  73. Minimum Common ValueTwo Pointers · ArraysEasy
  74. Maximum Pair Sum Under BudgetTwo Pointers · ArraysEasy
  75. Reverse Only LettersTwo Pointers · StringsEasy
  76. Cycle Detection Using Floyd's Algorithm (Pointer Simulation)Two Pointers · ArraysEasy
  77. Find Second Middle Element via Fast-Slow PointerTwo Pointers · ArraysEasy
  78. Detect Any Palindrome Substring of Length 2 or 3Two Pointers · StringsEasy
  79. Find First Palindromic String in the ArrayTwo Pointers · Strings · ArraysEasy
  80. Lexicographically Smallest PalindromeTwo Pointers · StringsEasy
  81. Merge Strings AlternatelyTwo Pointers · StringsEasy
  82. Count Negative Numbers in a Sorted Matrix (Staircase Two Pointers)Two Pointers · MatrixEasy
  83. Check If N and Its Double ExistTwo Pointers · ArraysEasy
  84. Remove All Adjacent Duplicates in StringTwo Pointers · StringsEasy
  85. Find Substring Index (Two-Pointer Scanning)Two Pointers · StringsEasy
  86. Sort Array of 0s and 1sTwo Pointers · ArraysEasy
  87. Long Pressed NameTwo Pointers · StringsEasy
  88. Reverse Prefix of WordTwo Pointers · StringsEasy
  89. Count Hills and Valleys in an ArrayTwo Pointers · ArraysEasy
  90. Shortest Distance to a CharacterTwo Pointers · StringsEasy
  91. Sentence Similarity (Prefix and Suffix Word Match)Two Pointers · StringsEasy
  92. DI String MatchTwo Pointers · Strings · GreedyEasy
  93. Find Target Indices After Sorting ArrayTwo Pointers · Arrays · SortingEasy
  94. Faulty Keyboard (In-Place Reverse on Signal)Two Pointers · StringsEasy
  95. Count Pairs with Given Sum in Sorted ArrayTwo Pointers · ArraysEasy
  96. Reverse String II (Reverse Every 2K Characters)Two Pointers · StringsEasy
  97. Two Furthest Houses with Different ColorsTwo Pointers · Arrays · GreedyEasy
  98. Check If Base-B Representation Is a PalindromeTwo Pointers · MathEasy
  99. Count Elements Strictly Between ExtremesTwo Pointers · ArraysEasy
  100. Complete Two-Pointer Sorted Array MergeTwo Pointers · ArraysEasy
  101. 3SumTwo Pointers · Arrays · SortingMedium
  102. 3Sum ClosestTwo Pointers · Arrays · SortingMedium
  103. 3Sum SmallerTwo Pointers · Arrays · SortingMedium
  104. Valid Triangle NumberTwo Pointers · Arrays · SortingMedium
  105. 4SumTwo Pointers · Arrays · SortingMedium
  106. Container With Most WaterTwo Pointers · Arrays · GreedyMedium
  107. Boats to Save PeopleTwo Pointers · Arrays · Greedy · SortingMedium
  108. Bag of TokensTwo Pointers · Arrays · Greedy · SortingMedium
  109. HeatersTwo Pointers · Arrays · Binary Search · SortingMedium
  110. Minimize Maximum Pair Sum in ArrayTwo Pointers · Arrays · Greedy · SortingMedium
  111. Sort Colors (Dutch National Flag Algorithm)Two Pointers · Arrays · SortingMedium
  112. String CompressionTwo Pointers · StringsMedium
  113. Remove Duplicates from Sorted Array IITwo Pointers · ArraysMedium
  114. Move Pieces to Obtain a StringTwo Pointers · StringsMedium
  115. Rotate Array via Three ReversalsTwo Pointers · Arrays · MathMedium
  116. Longest Palindromic Substring (Expand Around Center)Two Pointers · StringsMedium
  117. Count Palindromic SubstringsTwo Pointers · StringsMedium
  118. Push DominoesTwo Pointers · StringsMedium
  119. Longest Mountain in ArrayTwo Pointers · ArraysMedium
  120. Partition LabelsTwo Pointers · Strings · GreedyMedium
  121. Interval List IntersectionsTwo Pointers · ArraysMedium
  122. Find the Duplicate Number (Floyd's Cycle Detection)Two Pointers · Arrays · Binary SearchMedium
  123. Reverse Words in a String (Compacted)Two Pointers · StringsMedium
  124. Number of Subsequences with Min + Max $\le$ TargetTwo Pointers · Arrays · SortingMedium
  125. Next PermutationTwo Pointers · ArraysMedium
  126. Sum of Square NumbersTwo Pointers · MathMedium
  127. Find K Closest ElementsTwo Pointers · Arrays · SortingMedium
  128. Shortest Unsorted Continuous SubarrayTwo Pointers · Arrays · SortingMedium
  129. Compare Version NumbersTwo Pointers · StringsMedium
  130. Circular Array LoopTwo Pointers · ArraysMedium
  131. Trapping Rain WaterTwo Pointers · Arrays · Dynamic ProgrammingHard
  132. Minimum Window SubsequenceTwo Pointers · Strings · Dynamic ProgrammingHard
  133. Shortest PalindromeTwo Pointers · StringsHard
  134. Longest Chunked Palindrome DecompositionTwo Pointers · Strings · GreedyHard
  135. Maximum Score of a Good SubarrayTwo Pointers · Arrays · GreedyHard
  136. First Missing Positive (Cyclic Pointer Placement)Two Pointers · Arrays · Hash TableHard
  137. Smallest Range Covering Elements from K ListsTwo Pointers · Arrays · Heap · SortingHard
  138. Count Subarrays With Fixed BoundsTwo Pointers · Arrays · QueueHard
  139. Minimum Operations to Make Array ContinuousTwo Pointers · Arrays · Binary Search · SortingHard
  140. Candy Distribution via Two-Pointer Slope TrackingTwo Pointers · Arrays · GreedyHard
  141. Subarrays with Exactly K Different IntegersTwo Pointers · Arrays · Hash Table · Sliding WindowHard
  142. Substring with Concatenation of All WordsTwo Pointers · Strings · Hash Table · Sliding WindowHard
  143. Count Good Subarrays with at Least K Duplicate PairsTwo Pointers · Arrays · Hash TableHard
  144. Shortest Subarray with Sum at Least KTwo Pointers · Arrays · Queue · Sliding WindowHard
  145. Maximum Sum of Three Non-Overlapping SubarraysTwo Pointers · Arrays · Dynamic ProgrammingHard
  146. Valid Palindrome III (K-Palindrome)Two Pointers · Strings · Dynamic ProgrammingHard
  147. Maximum Number of Visible PointsTwo Pointers · Geometry · Math · SortingHard
  148. Find Minimum in Rotated Sorted Array II (Duplicate Boundary Collapse)Two Pointers · Arrays · Binary SearchHard
  149. Sliding Window Maximum (Monotonic Index Deque)Two Pointers · Arrays · Queue · Sliding WindowHard
  150. Count Subarrays with Median KTwo Pointers · Arrays · Hash TableHard