PhonePe Phone Screen Interview: What It Covers, How It's Scored, and How to Pass

You have grinded 200 LeetCode problems. You can explain Dijkstra in your sleep. You have a Google Doc with "SYSTEMS DESIGN NOTES" that you actually opened. You are ready for the PhonePe interview.

Then the phone screen filters you out and you never make it to the part you prepared for.

At PhonePe, the phone screen is an eliminatory round with a harder bar than it looks. Getting through it is not about luck or warming up. It is about knowing exactly what format you will face and preparing for that specific thing, not the onsite you assumed you would get to.

What "Phone Screen" Actually Means at PhonePe

PhonePe runs two distinct first-contact formats depending on how you are applying.

Campus and fresher track: You will face an online assessment (OA) hosted on DoSelect or HackerEarth. It is the first and only filter before onsite calls. Pass it and you get a technical interview invite. Fail it and the process ends there. No feedback, no second chance, no explanation.

Experienced hire track (1-5 years): You may skip the OA and go straight to a 60-90 minute telephonic or video call with a senior engineer. The content is the same as the OA, but it is live and interactive. Your thought process is visible in real time, which is either exciting or terrifying depending on how much you like narrating your confusion.

Both paths test the same core competency: can you solve medium-to-hard DSA problems, analyze their complexity, and write clean code under pressure? If the answer is "yes, but only when I have two hours and Stack Overflow open," you have some work to do.

The Online Assessment: Format and What You Are Actually Facing

The OA typically runs 80-120 minutes with three to four coding questions. The platform is DoSelect in most reported experiences from 2023-2025, though some cohorts have seen HackerEarth. Questions are scored independently, so a partial on one question does not collapse your whole score. Small mercy.

Difficulty follows a ramp:

Question	Typical Difficulty	Pattern
Q1	Easy-Medium	Arrays, Strings, Hashing
Q2	Medium	Trees, Graphs, Binary Search
Q3	Medium-Hard	DP, Graph BFS/DFS, Matrix
Q4 (if present)	Hard	Advanced DP, complex Graph

Q4 exists to sort out the people who thought Q3 was the final boss.

A handful of OAs also include UNIX-based questions or basic SQL alongside coding, but the coding component is the primary gate.

You need more than just Q1. Candidates who solve only the easy question typically do not advance. The bar is roughly two solid solves out of three, or three out of four. Partial credit for a well-structured but incomplete solution is possible on some platforms, so do not leave a question entirely blank. An empty file contributes exactly zero points.

What Gets Asked: The Patterns That Show Up

PhonePe's question pool skews hard toward graphs, trees, and DP. Here is what shows up across reported experiences:

Binary Trees and DP on Trees

House Robber III (LeetCode 337) style problems appear regularly. Finding the Kth ancestor of a node, computing expected values in tree structures, combining tree traversal with memoization. If you have been avoiding tree DP because it feels like "advanced stuff," PhonePe is where that avoidance becomes expensive. Fix it first.

Graph BFS and Traversal

The classic "all nodes at distance K from a target node" problem has appeared multiple times. So have shortest-path variants on weighted and unweighted grids, problems requiring modeling a real scenario as a graph, and connected component questions. The theme is usually: see a grid, think BFS.

Binary Search

Binary search on the answer problems show up consistently. Questions involving matrices where you need to search or find a path with constraints (minimum steps, maximum obstacles) are common. One reported problem: reach from [0][0] to [N-1][N-1] using at most K steps with obstacles. If you only know binary search as "find a sorted element," that is not enough.

Dynamic Programming

Classic 1D and 2D DP problems at medium-hard difficulty. Coin change variants, interval DP, knapsack-style problems. PhonePe does not ask obscure DP. They test whether you can structure a recurrence correctly and code it without bugs, which sounds easy until you are doing it under a timer.

Stacks and Queues

Next Greater Element type problems and monotonic stack applications tend to appear as Q1 or Q2. Think of these as the warm-up before the heavier stuff. Nail them fast.

What rarely appears: Bit manipulation edge cases, segment trees, or heavy competitive programming constructs. PhonePe is a product company. They want engineers who can model problems and code correctly, not people who competed at IOI.

How the OA Is Actually Scored

Here is the part most candidates miss.

Unlike some OAs that are purely algorithmic, PhonePe's scoring weights test case coverage heavily. Code that passes all edge cases scores higher than code that passes most cases with a cleaner algorithm. This matters for how you spend your last five minutes.

Write defensive code. Handle empty inputs, single elements, negative values, and overflow scenarios. Before submitting, run your solution mentally against at least three edge cases you did not use during development. The interviewer's test suite is thinking about all the things you assumed could not happen.

Time and space complexity matter even in the OA. Several candidates report being filtered because their solution passed correctness checks but was O(n²) when O(n log n) or O(n) was achievable. If you can see a more efficient approach, implement it. If you genuinely cannot, write a comment noting the bottleneck. It signals that you know it is there.

Partial credit exists for partial coverage. If you cannot fully solve Q3, submit your brute force with correct handling of small cases. A zero from a blank submission is always worse than partial points from something that runs.

For Experienced Hires: The Telephonic Round

The telephonic screen for 1-5 year engineers runs 60-90 minutes. The interviewer asks two DSA questions, starts you on Q1, watches you solve it, then moves to Q2 if time permits. It sounds straightforward. It is not.

In the telephonic round, silence is a red flag. Not a yellow flag. Red. You are expected to think out loud. The interviewer is watching your reasoning, not waiting for your answer. If you go quiet for thirty seconds, they are already noting "candidate went silent on approach." Start with a brute force. Say why it is slow. Walk through your optimization. Narrate the wrong turn so they can see you caught it.

They ask for complexity analysis after every solution. Not at the end of the interview. After each step. "What is the time complexity of this approach?" is a predictable follow-up. Have the analysis ready before you start coding, not while you are trying to debug line 14.

Hints are probes, not gifts. If the interviewer redirects you or asks "can we do better?", that is useful information. Taking the hint well and adjusting is scored positively. Arguing that your current solution is actually fine, or going quiet, is not. The interviewer has done this interview dozens of times. They know what "can we do better" means.

The topics overlap exactly with the OA. Graphs, trees, DP, binary search. The telephonic format just makes the interaction visible. Prepare the same content. Practice verbalizing it.

How to Actually Prepare

If you have a week or less, hit the first two areas. More time? Work through all of them.

DP on trees is PhonePe's most frequent hard question type, and it is the biggest gap for most candidates. Start there. LeetCode practice tends to skip it entirely. Solve LeetCode 124 (Binary Tree Maximum Path Sum), 337 (House Robber III), 543 (Diameter of Binary Tree), and 236 (Lowest Common Ancestor). These four cover the structural patterns you will actually see.

Graph BFS at medium-hard difficulty. Go beyond simple flood fill. Practice 863 (All Nodes Distance K in Binary Tree), 994 (Rotting Oranges), 1091 (Shortest Path in Binary Matrix), and 1162 (As Far from Land as Possible). Matrix BFS with constraints is exactly what PhonePe asks.

DP foundations. Do not skip 1D DP because you already "know" it. Coin change (322), longest increasing subsequence (300), jump game II (45), and partition equal subset sum (416) cover the core shapes. For 2D, LCS (1143) and unique paths (62).

Binary search on the answer. Koko eating bananas (875) and capacity to ship packages (1011) are the entry points. Once you internalize the "minimize the maximum" or "find the threshold" shape, these become recognizable fast.

Practice complexity narration. After every problem you solve, say out loud: "This runs in O(n log n) because..." even if no one is listening. Especially if no one is listening. In the telephonic round, that habit is the difference between smooth delivery and a stumbling explanation while the interviewer's pen is hovering.

The best tool for practicing this kind of narrated problem-solving is SpaceComplexity, which puts you in a live voice interview with an AI that asks real PhonePe-style problems and evaluates your reasoning, not just your final answer.

The Three Mistakes That Kill OA Scores

These are the ones that hurt because they are all preventable.

Submitting without testing edge cases. Candidates lose points on test coverage they could have caught themselves. Empty array. All-same elements. Single-node tree. Negative values. These take two minutes to check. Run them before you hit submit.

Implementing the right algorithm with a subtle bug. The BFS solution is correct but the visited set check is in the wrong place. The DP recurrence is right but the base case is off by one. This costs more points than choosing a slightly suboptimal algorithm. Review your implementation once before submitting, especially the boundary conditions. One pass. Two minutes. It is worth it.

Leaving Q3 blank because Q2 took too long. Time management on the OA is a skill, and most candidates do not practice it. If Q2 is eating your time past 30-35 minutes, write a partial solution, submit it, and move to Q3. A partial solve on Q3 often beats leaving it empty. A blank question is a guaranteed zero. A partial solution might not be.

For more on how PhonePe structures the full loop after the screen, see the complete PhonePe software engineer interview guide. If your fundamentals need tightening before the OA, the dynamic programming framework and common coding interview mistakes are the two most relevant reads. For the telephonic format specifically, technical interview communication covers the narration habits that actually move candidates through.