phonepe logo
PhonePe· SE (backend)

PhonePe | SE (backend) 1 - 3 years DSA round | Interview

Experience
2 years
Posted
19 May 2025
380 reads

Summary

I applied online for a Software Engineer (backend) role at PhonePe and faced two DSA questions in the interview, which I was unable to solve.

How it went

yoe: 2yrs applied online

previous round

was asked two DSA questions

  1. https://leetcode.com/problems/burst-balloons/ (hard)
  2. the celebrity problem (medium)

interviewer was nice and helped where ever they could. Wasn't able to solve any of them.

Questions asked (2)

  1. 01

    Burst Balloons

    Data Structures & Algorithms · Hard

    Given n balloons, indexed from 0 to n - 1. Each balloon has a number printed on it representing its point value. You are asked to burst all the balloons. If you burst balloon i, you will get nums[left] * nums[i] * nums[right] points. left and right are adjacent indices of i. After the burst, the left and right then become adjacent. Find the maximum points you can collect by bursting the balloons wisely.

    Open the problem
  2. 02

    The Celebrity Problem

    Data Structures & Algorithms · Medium

    In a party of N people, a celebrity is a person who is known by everyone but does not know anyone. You are given a square matrix M[][] of size N x N where M[i][j] = 1 if i knows j, and M[i][j] = 0 otherwise. Your task is to find the celebrity in the party. If a celebrity is present, find their index (0-indexed). If no celebrity is present, return -1. You may assume that the knows(A, B) function is available which returns true if A knows B, and false otherwise.

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!