phonepe logo
PhonePe· SDE1 backend

Phonepe Interview for - SDE1 backend 0-3 yrs exp Pune

Location
Pune
Experience
1 year
Posted
23 Apr 2025
323 reads

Summary

I applied for an SDE1 backend role at Phonepe through Instahyre, went through a coding assessment, two DSA rounds, and a Hiring Manager round, but was ultimately rejected due to perceived lack of skills and cultural fit.

How it went

Recruiter reached out on 5th April through my application on Instahyre.

My details: Experience - 1 yr Current comp - 3 LPA

1st round - Coding assessment on CodeSignal for 70 mins It had 4 questions, 1 was easy, 2 were medium-hard, 1 was hard

I cleared the assessment after solving all questions.

Recruiter reached out a day after my assessment for 2nd round

2nd round - DSA and problem solving on Gmeet for one hour

There were two interviewers who asked leetcode medium questions, I dont exactly remember but they were related to arrays and trees.

Recruiter reached out on the same day for 2nd round and scheduled interview for 3 days later.

3rd round - DSA and problem solving on Gmeet for one hour Asked two questions-

  1. Given a binary tree, find the list of elements which are at 'k' distance from the given target node.
  2. Asked to implement stack and also to retrieve minimum element of the stack at any point of time.

Solved both the question in one hour.

Recruiter reached out for Hiring Manager round next day and scheduled after 4 days

4th round - Hiring Manager round Asked basic questions which are mentioned on my resume, and asked about the architecture and current project I'm working on in the current company. Later went on to ask some behavioral and situational questions. Asked current comp and expected comp?? Idk if managers can ask, but whatever.

I reached out to recruiter next day and she said Hiring manager rejected and feedback was "My knowledge in skills was not as expected and did not seem culturally fit to work in the environment"

Questions asked (2)

  1. 01

    Nodes at K Distance in Binary Tree

    Data Structures & Algorithms

    Given a binary tree, find the list of elements which are at 'k' distance from the given target node.

  2. 02

    Implement Stack with Min Function

    Data Structures & Algorithms

    Asked to implement stack and also to retrieve minimum element of the stack at any point of time.

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!