Phonepe interview questions
Online test → Technical → Technical → Managerial·80% entry level
DSA
Showing 27 of 51 reported in this area
Decode a given encoded string
Explain tries and their applications
Merge K sorted arrays into a single sorted array
Find all roots of a tree that give minimum height
Generate all valid IP addresses from a given string
Solve Data Structures and Algorithms problems (3 questions)
Answer multiple submatrix sum queries on a 2D matrix efficiently.
Find the sum of minimum elements of all subarrays of a given array.
Generate all valid combinations of parentheses for a given number of pairs.
Generate all combinations of balanced parentheses for a given number of pairs.
Find the minimum speed required to arrive on time given distances and time constraints
Solve advanced Data Structures and Algorithms problems with detailed approach explanation
Given an array, find the frequency of the most frequent element after at most k increments
Given numCourses and a list of prerequisite pairs, determine if it is possible to finish all courses.
Given a binary tree, find the k-th ancestor of a given node. If the ancestor does not exist, return -1.
Given a set of points on a 2D plane, find the maximum slope between any two points and connect those points.
Given a binary tree and a target node, find the time required to burn the entire tree starting from the target node.
Given an array, find indices i < j < k such that A[i] ≤ A[j] ≤ A[k] and the product A[i] * A[j] * A[k] is maximized.
Given an array of integers, determine whether there exists any triplet that can form a triangle (i.e., for some a, b, c: a + b > c).
Given height relations like "A > B" and "B < C" among people, determine whether the relations are sufficient to sort all persons by height
Given an array of integers and a number X, count the number of ordered pairs (i, j) such that concatenating arr[i] and arr[j] results in X.
Given two sequences representing north and south bank cities with positions, find the maximum number of non-crossing bridges that can be built.
Design a data structure to support adding an element, removing an element, finding the minimum frequency element, and finding the maximum frequency element.
Given an array, perform either +k or -k exactly once on each element such that the difference between the maximum and minimum elements after the operations is minimized.
Given costs of m breads and n sauces and a budget B, choose exactly one bread and any number of sauces (each at most once) such that the total cost is as close as possible to B.
There are seats numbered from 1 to N with some occupied and some empty. For each of M queries, allocate a seat to a new person such that the distance to the closest occupied seat is maximized.
Given ratings of N children, distribute candies such that each child gets at least one candy and children with a higher rating than their neighbors get more candies. Find the minimum candies required.
CS fundamentals
Showing 19 of 41 reported in this area
Explain the difference between stack memory and heap memory.
Compare merge sort and quick sort
Explain the Singleton design pattern
Explain operating system fundamentals
Differentiate between hashing and encryption
What is hybrid sorting and where is it used?
Explain HTTP response status codes and HTTP methods
UNIX-based command line and operating system questions
Write SQL queries to retrieve required data from tables
Write an SQL query to find the 10th highest score among students
What is indexing in databases and how does it improve performance?
What are virtual functions and virtual classes in C++ and where are they used?
Compare SQL and NoSQL databases and explain when you would choose one over the other.
How do you manage branching and handle merge conflicts in Git during collaborative development?
What is a deadlock? What are the necessary conditions for deadlock and give a general scenario.
How do you avoid race conditions when multiple processes or threads are sending data to a shared system?
If the backend API sends {x, y} but the frontend requires {x, y, z}, how would you handle this situation?
Write SQL queries using aggregate functions, GROUP BY, ORDER BY, and window functions like ROWNUM with practical examples
Explain what happens in the backend when a fraudster sends money back to build trust after asking for an initial small transaction
System design
Showing 8 of 9 reported in this area
Design a database schema for a restaurant and its menu
What measures should PhonePe use to detect and prevent such payment frauds?
Design a system for controlling a single lift in a building with 1000 floors.
Design a Tiny URL service and estimate the time required to build a production-ready implementation.
A company grows for one year and then faces continuous decline—what could be the reasons and how would you address them?
Design and implement a low-level design solution for a given problem, followed by a discussion on trade-offs and design decisions.
Design a parking lot system with all required classes and draw the class diagram. Also explain an algorithm to guide a car to its assigned parking spot.
Design and implement a Snake and Ladder game with modular, extensible code that can support adding new obstacles, multiple snakes/ladders, and any number of players. The solution should be demoable.
Puzzles
Showing 3 of 6 reported in this area
Given 16 rats and 4 cakes, determine a strategy to find the faster rat.
You have 12 rats, one eats faster than the others, and 4 cakes. How do you identify the faster rat?
Why might a ride-hailing incentive policy (extra benefits after X rides per day) be overexploited in a specific location?
Behavioural
3 questions reported in this area
Discuss the importance of technology in the finance industry
asked oncePractice this →
What real-world problems have you solved other than programming-related ones?
asked oncePractice this →
Describe a recent disagreement you had with someone and explain how you handled it.
asked oncePractice this →
Showing 60 of 92 questions. Ranked by how often the same question came back across reports.
Practise a Phonepe-style interview
A spoken interview built from these questions, scored when you finish; the report is yours.
Start practisingCommon questions
What questions does Phonepe ask?
Candidate interview reports most often cover DSA (46%) and CS fundamentals (37%).
How many rounds does Phonepe interview have?
Candidate interview reports show an average of 3.3 rounds per experience, with a typical sequence of Online test → Technical → Technical → Managerial. Individual interview paths can vary.
Is the Phonepe interview hard?
Among questions with a reported difficulty, the mix is easy 21%, medium 64%, hard 15%.