phonepe logo
PhonePe· SDE-1

PhonePe | SDE- 1 | Bangalore

Result
Rejected
Location
Bangalore, India
Experience
0.4 years
Posted
21 Oct 2021
311 reads

Summary

I applied for the SDE-1 role at PhonePe in Bangalore and successfully navigated through three interview rounds, receiving an offer which I ultimately rejected due to other competing opportunities.

How it went

My interview process at PhonePe was very smooth, with all rounds concluding within a week. There were a total of three rounds:

  • Online Coding Assessment: This was the first step.
  • DSA-based technical round: In this round, I was asked three programming questions, which were considered to be of medium-hard difficulty.
  • Hiring Manager round: This round focused primarily on discussions about my current company's projects and my understanding of DBMS concepts. A good understanding of my previous company's projects was crucial here.

Although I received an offer, I decided to reject it as I had other competing offers.

Questions asked (3)

  1. 01

    Contains Duplicate II

    Data Structures & Algorithms · Medium

    Given an array of integers nums and an integer k, return true if there are two distinct indices i and j in the array such that nums[i] == nums[j] and abs(i - j) <= k.
    Constraint: 0 <= nums.length <= 10^5, 10^9 <= nums[i] <= 10^9, 0 <= k <= 10^5
    Example:
    nums = [1,2,3,1], k = 3 => true
    nums = [1,0,1,1], k = 1 => true

    Open the problem
  2. 02

    K-diff Pairs in an Array

    Data Structures & Algorithms · Medium

    Given an integer array nums and an integer k, return the number of pairs (i, j) where i < j and |nums[i] - nums[j]| == k.
    Example:
    nums = [1,2,2,1], k = 1 => 2 ([1,2] at (0,1) and (3,2))
    nums = [1,3,1,5], k = 2 => 1 ([1,3] at (0,1))

    Open the problem
  3. 03

    Minimum Switches to Illuminate Binary String

    Data Structures & Algorithms · Hard

    Given a binary string (e.g., '0110100') where '1' means light is present and '0' means no light. Each switch, when turned on at index i, illuminates indices i-1, i, and i+1. Find the minimum number of switches to turn on to illuminate all '0's in the string.

    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!