Two Pointers Questions at Myntra: What to Expect

Two Pointers is a critical pattern to master for Myntra interviews. With 4 out of 24 total problems tagged with this technique, it represents a significant portion of their technical assessment. Myntra, handling massive catalog data, search relevance, and real-time features like filters and recommendations, frequently applies two-pointer logic for efficient array and string manipulation. Expect to optimize solutions that would otherwise require nested loops, reducing time complexity from O(n²) to O(n). This isn't just an algorithmic test—it's a direct measure of your ability to write performant code for scale.

What to Expect — Types of Problems

Myntra’s two-pointer questions typically fall into three categories:

1. Sorted Array Pair Searches: Finding pairs that meet a condition (e.g., two styles whose price sum matches a budget).
2. In-place Array Manipulation: Removing duplicates, partitioning, or rearranging elements with minimal space.
3. String Validation Problems: Checking palindromes, subsequences, or anagrams, often relevant for search or UI logic.

These problems assess both your grasp of fundamentals and your ability to apply a simple pattern to optimize a real-world data operation.

How to Prepare — Study Tips with One Code Example

Focus on the pattern, not memorization. Start by identifying when two pointers apply: sorted data, or a need to compare or converge from two ends. Practice writing the logic without language-specific shortcuts first.

A key pattern is the opposite-direction pointers for a sorted array pair sum. Here’s the implementation:

def find_pair_with_sum(arr, target):
    left, right = 0, len(arr) - 1
    while left < right:
        current_sum = arr[left] + arr[right]
        if current_sum == target:
            return [left, right]
        elif current_sum < target:
            left += 1
        else:
            right -= 1
    return [-1, -1]

Recommended Practice Order

1. Basic Convergence: Pair sum, palindrome check.
2. In-place Operations: Remove duplicates, move zeros.
3. Multiple Pointers: Three-sum, merging sorted arrays.
4. String Applications: Valid palindrome with constraints, substring matching.

Build fluency by timing yourself and discussing trade-offs. Always verbalize why two pointers improves the naive approach.

Practice Two Pointers at Myntra