PHONEPE · CODING QUESTIONS

PhonePe coding interview questions

The data structures and algorithms questions candidates report from PhonePe interviews, linked to AlgoRung problems with an editor, hidden tests, an animated walkthrough and solutions in four languages. Most asked topics: Arrays & Hashing, Trees & BST, Graphs, Dynamic Programming.

From public candidate reports and PhonePe's careers pages, checked November 2026. Processes vary by team. AlgoRung is not affiliated with PhonePe.

All 4 reported PhonePe coding questions

Difficulty
Topic
4 questions
  1. Distribute Coins in Binary Tree Medium Trees & BST also Amazon
  2. Word Search Medium Recursion & Backtracking also Microsoft
  3. LRU Cache Medium Design Data Structures also Amazon, Microsoft, Apple +4
  4. Subarray Sum Equals K Medium Arrays & Hashing also Meta
Also reported, not on AlgoRung yet (1)

Word Search II

How the coding round is scored · The online assessment

Questions people ask

What coding questions does PhonePe ask?

Candidates most often report Distribute Coins in Binary Tree, Word Search, LRU Cache, Subarray Sum Equals K. The full list of 4 reported questions is on this page, each linked to a practice problem with solutions.

Which topics should I study for the PhonePe coding interview?

trees, prefix sums, sliding window, graphs, dynamic programming, backtracking. A 45 to 60 minute live interview where you solve one or two data-structures-and-algorithms problems while explaining your thinking. Interviewers score problem solving, code quality, testing and communication.

How hard are PhonePe coding questions?

Of the reported questions on AlgoRung, 0 are easy, 4 medium and 0 hard. Expect mostly medium problems, with follow-ups that change a constraint.

Coding questions at other companies

Coding questions across all companies · Behavioral questions