PhonePe's DSA rounds draw on arrays, greedy/interval problems, stacks, and graph/union-find patterns — interviewers weigh clean working code and complexity discussion as heavily as the final answer, especially under the tight one-hour, multi-problem format that shows up often. The three problems below are real, recently reported (2025–2026) PhonePe questions with full solutions.
Given an array of non-negative integers where each value is the farthest jump length from that index, determine whether the last index of the array is reachable starting from index 0.
Input: nums = [2, 3, 1, 1, 4]
Output: true
Input: nums = [3, 2, 1, 0, 4]
Output: false
Every path gets stuck at index 3, whose value 0 cannot jump past the block.
Given balloons represented as start-end intervals along a line, find the fewest vertical arrow shots needed so that every balloon is hit by at least one arrow, where one arrow bursts every balloon its path crosses.
Input: points = [[10,16],[2,8],[1,6],[7,12]]
Output: 2
One arrow at x=6 bursts [1,6] and [2,8]; a second arrow at x=11 bursts [7,12] and [10,16].
Design a stack that supports push, pop, peek, and retrieving the current minimum element, with every operation running in constant time.
Input: push(-2), push(0), push(-3), getMin(), pop(), top(), getMin()
Output: -3, then (after pop) 0, then -2
More DSA questions PhonePe has asked recently
These topics were reported in verified 2025–2026 PhonePe loops. Full problem statements, solutions and explanations for these are part of the Placement-Ready PYQ Kit.
2 more verified DSA questions with full solutions in the full Placement-Ready PYQ Kit
Includes every round they were asked in, from the Live Coding Round through dedicated DSA rounds.