Two Pointers Interview Questions [2026-2027]

Given four arrays of integers and an integer limit. We need to pick 1 number from each of the four arrays such that the sum of the selected numbers is...

Interviewer discussed on the project and design of the project. What components I owned and the business impact. Post that interviewer asked simple question : https://leetcode.com/problems/backspace-s

Interview Overview - **Interview Mode:** Blitz(Fast paced) - **Company:** DocuSign - **Position:** Software Engineer - **Total Rounds:** 2 (Both Coding + DSA) - **Platform:** Zoom (Meeting) + Hac

You are given an integer array nums containing only 0, 1, and 2. Sort the array in-place so that: - All 0s appear first - Followed by all 1s - Followed by all 2s You must: - Solve it in O(n) time comp

I was approached by a recruiter around 3 months back for a opportunity for a quantitative developer - python role at Millennium. The interview experience initially was good but later turned to be a gh

InMobi visited our campus and conducted their interviews in December. The recruitment procedure consisted of an online screening round followed by 2 technical rounds and 1...

LeetCode #11: Container With Most Water. Difficulty: Medium. Topics: Array, Two Pointers, Greedy. Asked at Capital One in the last 6 months.

LeetCode #15: 3Sum. Difficulty: Medium. Topics: Array, Two Pointers, Sorting. Asked at Tesla in the last 6 months.

LeetCode #161: One Edit Distance. Difficulty: Medium. Topics: Two Pointers, String. Asked at Yandex in the last 6 months.

LeetCode #443: String Compression. Difficulty: Medium. Topics: Two Pointers, String. Asked at Yandex in the last 6 months.

LeetCode #125: Valid Palindrome. Difficulty: Easy. Topics: Two Pointers, String. Asked at Yandex in the last 6 months.

LeetCode #11: Container With Most Water. Difficulty: Medium. Topics: Array, Two Pointers, Greedy. Asked at Yandex in the last 6 months.

LeetCode #986: Interval List Intersections. Difficulty: Medium. Topics: Array, Two Pointers, Sweep Line. Asked at Yandex in the last 6 months.

LeetCode #283: Move Zeroes. Difficulty: Easy. Topics: Array, Two Pointers. Asked at Yandex in the last 6 months.

LeetCode #392: Is Subsequence. Difficulty: Easy. Topics: Two Pointers, String, Dynamic Programming. Asked at Yandex in the last 6 months.

LeetCode #75: Sort Colors. Difficulty: Medium. Topics: Array, Two Pointers, Sorting. Asked at Agoda in the last 6 months.

LeetCode #42: Trapping Rain Water. Difficulty: Hard. Topics: Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack. Asked at Docusign in the last 6 months.

LeetCode #283: Move Zeroes. Difficulty: Easy. Topics: Array, Two Pointers. Asked at EPAM Systems in the last 6 months.

LeetCode #88: Merge Sorted Array. Difficulty: Easy. Topics: Array, Two Pointers, Sorting. Asked at EPAM Systems in the last 6 months.

LeetCode #189: Rotate Array. Difficulty: Medium. Topics: Array, Math, Two Pointers. Asked at EPAM Systems in the last 6 months.

LeetCode #42: Trapping Rain Water. Difficulty: Hard. Topics: Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack. Asked at Squarepoint Capital in the last 6 months.

LeetCode #696: Count Binary Substrings. Difficulty: Easy. Topics: Two Pointers, String. Asked at Wells Fargo in the last 6 months.

LeetCode #443: String Compression. Difficulty: Medium. Topics: Two Pointers, String. Asked at CrowdStrike in the last 6 months.

LeetCode #696: Count Binary Substrings. Difficulty: Easy. Topics: Two Pointers, String. Asked at Dell in the last 6 months.

LeetCode #189: Rotate Array. Difficulty: Medium. Topics: Array, Math, Two Pointers. Asked at Box in the last 6 months.