Candidatei-me por meio de uma faculdade ou universidade. O processo levou 1 dia. Fui entrevistado pela PhonePe em jul. de 2025
Entrevista
could not able to clear 1st round but cleared oa which is very difficult there were 4 questions and all are medium-hard difficulty based on dp the oa experience is good ,it would have been better if my interviewer was little serious about the interview
Perguntas de entrevista [1]
Pergunta 1
no of numbers formed only using 0's,1's where exactly one 00 is present
Candidatei-me por meio de uma faculdade ou universidade. O processo levou 1 dia. Fui entrevistado pela PhonePe (Allahabad) em set. de 2025
Entrevista
The interview process at PhonePe was well-structured and professional. The communication was smooth and the interview panel tested both technical depth and problem-solving skills. Although I could not convert the opportunity, it was a great learning experience and helped me understand areas I need to improve for future SDE roles.
Perguntas de entrevista [1]
Pergunta 1
A binary search on ans question .
A graph question-(Dikshtra)
Fiz uma entrevista na empresa PhonePe (Bengaluru).
Entrevista
On campus- medium hard questions focus on graph and dp.especially dsu concepts..prepare well from striver sheet.first interview was based on array and string questions easy-medium,second interview was on graph and dp
Candidatei-me por meio de uma faculdade ou universidade. O processo levou 5 dias. Fui entrevistado pela PhonePe (Pune) em ago. de 2025
Entrevista
Around 170 candidates were selected. it focused on advanced DSA. there were 15 questions in 90 mins. focused on dynamic programming concepts like backtracking, NP, NP Hard, Knapsack, NQeueens, Recursion, Graphs.
Perguntas de entrevista [1]
Pergunta 1
You are given a bidirectional weighted graph where the weights represent latency between nodes.
The goal is to travel from node 1 (src) to node n (dest) such that:
Each node has an associated toll (cost) for visiting it.
The total toll is defined as the sum of the toll values of all nodes visited along the path (including both source and destination).
You are also given a value maxL, which represents the maximum allowed total latency for a path.
Your task is to find a path with the minimum total toll such that the sum of latencies along the path is less than or equal to maxL.
If there are multiple paths with the same minimum toll, any valid one can be chosen. If no such path exists, output -1.
