PhonePe
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Clear (1)
I applied via Recruitment Consulltant and was interviewed in Sep 2024. There was 1 interview round.
I applied via Instahyre and was interviewed in Oct 2024. There were 3 interview rounds.
I applied via Job Fair
I applied via Naukri.com and was interviewed in Oct 2022. There were 2 interview rounds.
I applied via Campus Placement and was interviewed before Aug 2023. There were 2 interview rounds.
I applied via AngelList and was interviewed before Oct 2021. There were 2 interview rounds.
I appeared for an interview in Mar 2021.
Round duration - 90 minutes
Round difficulty - Medium
Started with projects discussion and internships and moved forward with coding problems.
It started at around 6:00 PM and lasted for 90 minutes approximately
The interviewer was very cool, he even gave me some tips on improving myself further at the end of the interview.
Given a string S
of length N
and an integer K
, find the length of the longest substring that contains at most K
distinct characters.
The first...
Find the length of the longest substring with at most K distinct characters in a given string.
Use a sliding window approach to keep track of the characters and their counts within the window.
Maintain a hashmap to store the characters and their frequencies.
Update the window size and characters count as you iterate through the string.
Return the maximum window size encountered for each test case.
Given an array of integers with numbers in random order, write a program to find and return the number which appears the most frequently in the array.
If multip...
Find the number with the maximum frequency in an array of integers.
Iterate through the array and keep track of the frequency of each number using a hashmap.
Find the number with the maximum frequency and return it.
If multiple elements have the same maximum frequency, return the one that appears first.
Ninja wants to travel from his house to his best friend's house. The locations of the houses are on a 2D coordinate plane, where Ninja's house is located at the origin (0...
Determine if Ninja can reach his friend's house with even x-coordinate without using modulus operator.
Check if the x-coordinate is even or odd by using bitwise AND operation with 1.
Return 1 if x-coordinate is even, else return 0.
Handle multiple test cases by iterating through each input.
Round duration - 60 minutes
Round difficulty - Easy
I was asked a coding question then, a system design question and some basic operating systems and oops questions
Given an array ARR
of size 'N', where each integer is in the range from 0 to N - 1, identify all elements that appear more than once.
Return the duplicate elements in any orde...
Find duplicates in an array of integers within a specified range.
Iterate through the array and keep track of the count of each element using a hashmap.
Return elements with count greater than 1 as duplicates.
Time complexity can be optimized to O(N) using a set to store seen elements.
Designing a Google Search Engine involves creating a web crawler, indexing system, and ranking algorithm.
Develop a web crawler to discover and retrieve web pages.
Implement an indexing system to store and organize the content of web pages.
Design a ranking algorithm to determine the relevance of search results.
Include features like autocomplete, spell check, and personalized search results.
Optimize for speed and scalabil...
Tip 1 : Practice data structures problems
Tip 2 : Read about System Designs
Tip 3 : Study the popular algorithms
Tip 1 : Mention your projects
Tip 2 : Mention your internships
based on 1 interview
Interview experience
2-6 Yrs
Not Disclosed
Key Accounts Executive
694
salaries
| ₹3.7 L/yr - ₹7.5 L/yr |
Territory Sales Manager
520
salaries
| ₹4.7 L/yr - ₹10.5 L/yr |
Business Development Executive
493
salaries
| ₹1 L/yr - ₹5.1 L/yr |
Business Development Associate
370
salaries
| ₹2.4 L/yr - ₹6 L/yr |
Software Engineer
265
salaries
| ₹13 L/yr - ₹55 L/yr |
Paytm
Google Pay
Amazon Pay
Mobikwik