PhonePe | SDE- 1 | Bangalore
- Result
- Rejected
- Location
- Bangalore, India
- Experience
- 0.4 years
- Posted
- 21 Oct 2021
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)
- 01
Contains Duplicate II
Data Structures & Algorithms · Medium
Open the problemGiven an array of integers
numsand an integerk, returntrueif there are two distinct indicesiandjin the array such thatnums[i] == nums[j]andabs(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=> truenums = [1,0,1,1], k = 1=> true - 02
K-diff Pairs in an Array
Data Structures & Algorithms · Medium
Open the problemGiven an integer array
numsand an integerk, return the number of pairs(i, j)wherei < jand|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)) - 03
Minimum Switches to Illuminate Binary String
Data Structures & Algorithms · Hard
Open the problemGiven 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 indicesi-1,i, andi+1. Find the minimum number of switches to turn on to illuminate all '0's in the string.