Two Pointers Interview Questions
184 real interview questions test Two Pointers. Practice any of them in the code editor and get AI feedback on your solution.
- Junior28% (51)
- Mid/Senior59% (108)
- Staff14% (25)
Companies that ask Two Pointers the most
Questionspage 2 of 2
- Maximum Number of Non-overlapping Palindrome Substrings5 companiesStaff
- Separate Black and White Balls5 companiesMid/Senior
- Find Beautiful Indices in the Given Array I5 companiesMid/Senior
- Zero Array Transformation II5 companiesMid/Senior
- Zero Array Transformation III5 companiesMid/Senior
- Find the Lexicographically Largest String From the Box I5 companiesMid/Senior
- Circular Array Loop4 companiesMid/Senior
- Number of Subarrays with Bounded Maximum4 companiesMid/Senior
- Shortest Distance to a Character4 companiesJunior
- 3Sum With Multiplicity4 companiesMid/Senior
- Pancake Sorting4 companiesMid/Senior
- Duplicate Zeros4 companiesJunior
- Partition Array According to Given Pivot4 companiesMid/Senior
- Find All K-Distant Indices in an Array4 companiesJunior
- Apply Operations to an Array4 companiesJunior
- Total Cost to Hire K Workers4 companiesMid/Senior
- Lexicographically Smallest Palindrome4 companiesJunior
- Magical String3 companiesMid/Senior
- Swap Adjacent in LR String3 companiesMid/Senior
- Friends Of Appropriate Ages3 companiesMid/Senior
- Advantage Shuffle3 companiesMid/Senior
- DI String Match3 companiesJunior
- Range Sum of Sorted Subarray Sums3 companiesMid/Senior
- Ways to Split Array Into Three Subarrays3 companiesMid/Senior
- Minimum Length of String After Deleting Similar Ends3 companiesMid/Senior
- Closest Subsequence Sum3 companiesStaff
- Maximum Number of Removable Characters3 companiesMid/Senior
- Longest Subsequence Repeated k Times3 companiesStaff
- Number of Smooth Descent Periods of a Stock3 companiesMid/Senior
- The Latest Time to Catch a Bus3 companiesMid/Senior
- Maximum Matching of Players With Trainers3 companiesMid/Senior
- Append Characters to String to Make Subsequence3 companiesMid/Senior
- Minimum Common Value3 companiesJunior
- Count the Number of Incremovable Subarrays II3 companiesStaff
- Find Beautiful Indices in the Given Array II3 companiesStaff
- Expressive Words2 companiesMid/Senior
- Bag of Tokens2 companiesMid/Senior
- Camelcase Matching2 companiesMid/Senior
- Checking Existence of Edge Length Limited Paths2 companiesStaff
- Minimum Adjacent Swaps to Reach the Kth Smallest Number2 companiesMid/Senior
- Maximum Distance Between a Pair of Values2 companiesMid/Senior
- Number of Arithmetic Triplets2 companiesJunior
- Strictly Palindromic Number2 companiesMid/Senior
- Find the Array Concatenation Value2 companiesJunior
- Count the Number of Incremovable Subarrays I2 companiesJunior
- Minimum Average of Smallest and Largest Elements2 companiesJunior
- Longest Palindrome After Substring Concatenation I2 companiesMid/Senior
- Flip Square Submatrix Vertically2 companiesJunior
- Maximum Total from Optimal Activation Order2 companiesMid/Senior
- Maximum Capacity Within Budget2 companiesMid/Senior
- Count The Repetitions1 companyStaff
- Longest Uncommon Subsequence II1 companyMid/Senior
- Longest Word in Dictionary through Deleting1 companyMid/Senior
- K-th Smallest Prime Fraction1 companyMid/Senior
- Longest Chunked Palindrome Decomposition1 companyStaff
- Remove Palindromic Subsequences1 companyJunior
- The k Strongest Values in an Array1 companyMid/Senior
- Split Two Strings to Make Palindrome1 companyMid/Senior
- Largest Merge Of Two Strings1 companyMid/Senior
- Form Array by Concatenating Subarrays of Another Array1 companyMid/Senior
- Count Pairs Of Nodes1 companyStaff
- Maximum Score of a Good Subarray1 companyStaff
- Check If String Is a Prefix of Array1 companyJunior
- Watering Plants II1 companyMid/Senior
- Recover the Original Array1 companyStaff
- Maximum Total Beauty of the Gardens1 companyStaff
- Number of Distinct Averages1 companyJunior
- Subsequence With the Minimum Score1 companyStaff
- Make String a Subsequence Using Cyclic Increments1 companyMid/Senior
- Minimum Array Length After Pair Removals1 companyMid/Senior
- Find Indices With Index and Value Difference I1 companyJunior
- Find Indices With Index and Value Difference II1 companyMid/Senior
- Find the Integer Added to Array II1 companyMid/Senior
- Minimum Number of Flips to Make Binary Grid Palindromic II1 companyMid/Senior
- Find Maximum Removals From Source String1 companyMid/Senior
- Shortest Matching Substring1 companyStaff
- Longest Palindrome After Substring Concatenation II1 companyStaff
- Path Existence Queries in a Graph II1 companyStaff
- Maximum Product of First and Last Elements of a Subsequence1 companyMid/Senior
- Subsequence Sum After Capping Elements1 companyMid/Senior
- Minimum Operations to Make Binary Palindrome1 companyMid/Senior
- Reverse String Prefix1 companyJunior
- Sum of GCD of Formed Pairs1 companyMid/Senior
- Minimum Operations to Transform Array into Alternating Prime1 companyMid/Senior