PhonePe OA + Interview Experience (2025 Campus Hiring)

Result
Offer
Posted
16 Aug 2025
431 reads

Summary

Recently went through PhonePe's hiring process (OA + 3 rounds) and got shortlisted. The OA had 4 questions, with the last one being a unique problem about forming numbers from a string. Technical rounds focused on problem-solving with two coding challenges in each round.

How it went

I recently went through the PhonePe hiring process (OA + 3 rounds) and wanted to share my experience. The OA had 4 questions, 2 from DP, 1 from Trees, and 1 unique problem. The last question required counting numbers greater than B formed from a string. I solved 2 fully and partially solved the others, which led to my shortlisting. In the first technical round, I tackled two LeetCode problems: Burning Tree and Shortest Path to Get All Keys, writing complete code and dry runs. The second round was more ad-hoc, and I made it to the third round. The third round had two problems: Codeforces 2028C and a custom problem involving maximizing a sum with constraints. I suggested bitmask DP for small n and wrote the solution. The feedback was positive, and I got shortlisted in the end.

Questions asked (5)

  1. 01

    Count Numbers Greater Than B From String

    Data Structures & Algorithms

    Given a number in the form of a string (length up to 47) and an integer B, pick digits from the string (in order) to form numbers. The task was to count how many numbers greater than B can be formed.

  2. 02

    Burning Tree

    Data Structures & Algorithms

    The problem required implementing a solution to burn a tree, likely involving tree traversal and dynamic programming techniques.

    Open the problem
  3. 03

    Shortest Path to Get All Keys

    Data Structures & Algorithms

    The problem involved finding the shortest path to collect all keys in a grid, which is a classic BFS or Dijkstra's algorithm problem.

    Open the problem
  4. 04

    Custom Problem: Maximize Sum with Constraints

    Data Structures & Algorithms

    Given a vector of pairs (a, b), you can pick any pair to start with. The next pair must satisfy a_next <= b_prev. The goal was to maximize the sum of all chosen b.

  5. 05

    Codeforces 2028C

    Data Structures & Algorithms

    A problem from Codeforces 2028C, which involved some algorithmic challenge, though the exact details are not provided.

    Open the problem

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at PhonePe recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!