CANDIDATE INTERVIEW STORY

Phonepe YOE 5

phonepe logo
phonepe
· Backend Engineer· 5y exp
October 10, 2026 · 8 reads

Summary

I interviewed for a Backend Engineer position at PhonePe, completed machine coding, two LeetCode problems, a system design round, and an HR round, and was ultimately rejected.

Full Experience

Recently applied for interview at PhonePe for the backend engineer. Sharing interview experience below.

  1. Machine coding: Journey service - Not that difficult question. There are multiple journeys, each journey has multiple stages. A user start from the first stage of the journey and move to the next stage when a new event comes and if stage criteria is met. Few easy follow ups during evaluation round and questions on concurrency. Passed the round.
  2. 2 Leetcode question: https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/description/ & https://leetcode.com/problems/evaluate-division/description/. Was able to complete the first question with implementation. Second one couldn't write the entire code within the time. Passed the round.
  3. Design round: Asked to design a feature flag sort of system for PhonePe where any change in flag reflects to million of PhonePe users instantly. similar to https://youtu.be/GsRR__fz854?si=Rnb-TDQ4kUtU7rHm and https://youtu.be/VBCYqp8l3Lc?si=VTr9zKrQij-RsAnA I think my design was not that well in this round and most likely the reason behind reject as per the TA.
  4. HM round: Standard stuff - previous projects, some behaviour questions around day to day working etc. Deep dive into a design of one of my previous companies project.

Final verdict: Reject.

Yoe 5

Interview Questions (4)

1.

Journey Service Machine Coding

Data Structures & Algorithms

Multiple journeys, each journey has multiple stages. A user starts from the first stage of the journey and moves to the next stage when a new event arrives and if the stage criteria is met. Follow‑up questions on concurrency were also asked.

2.

Kth Smallest Element in a Sorted Matrix

Data Structures & Algorithms·Medium

Find the k‑th smallest element in an n × n matrix where each row and each column is sorted in ascending order.

3.

Evaluate Division

Data Structures & Algorithms·Medium

Given a list of equations like a / b = 2.0 and queries, evaluate the division results for each query.

4.

Feature Flag System Design

System Design

Design a feature flag system for PhonePe where any change in a flag propagates instantly to millions of users. References were provided to videos describing similar systems.

📣 Found this helpful? Please share it with friends who are preparing for interviews!

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

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