PhonePe
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Clear (1)
I was interviewed in Jan 2021.
Round duration - 40 Minutes
Round difficulty - Easy
Round duration - 60 Minutes
Round difficulty - Easy
You are given a string STR
which contains alphabets, numbers, and special characters. Your task is to reverse the string.
STR = "abcde"
"e...
Reverse a given string containing alphabets, numbers, and special characters.
Iterate through the string from the end to the beginning and append each character to a new string.
Use built-in functions like reverse() or slicing to reverse the string.
Handle special characters and numbers while reversing the string.
Ensure to consider the constraints on the input string length and number of test cases.
Given an array of positive integers, determine the Greatest Common Divisor (GCD) of a pair of elements such that it is the maximum among all possible pairs in the array. The...
Find the maximum GCD of a pair of elements in an array of positive integers.
Iterate through all pairs of elements in the array
Calculate the GCD of each pair using Euclidean algorithm
Keep track of the maximum GCD found
Return the maximum GCD value
Round duration - 20 Minutes
Round difficulty - Easy
Tip 1 : Practice Atleast 250 Questions
Tip 2 : Do atleast 2 projects
Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.
I was interviewed in Sep 2020.
Round duration - 90 minutes
Round difficulty - Medium
3 coding Questions:
1st : Easy question based on simple loop iteration
2nd :Medium level Dp question
3rd : Medium level tree question(where we were not just required to complete the tree function but to build whole bst from
scratch)
It was conducted from 1:30 - 3:00 pm.
The coding platform was very good (as auto indentation and auto completion of brackets were there)
having camera on.
You are given the stock prices for N
days. Each day i
signifies the price of a stock on that day. Your goal is to calculate the maximum profit that can be achieved by buyin...
Calculate maximum profit by buying and selling stocks on different days.
Iterate through the stock prices and buy on the day when the price is lower than the next day's price, and sell on the day when the price is higher than the next day's price.
Keep track of the total profit earned by summing up the differences between buying and selling prices.
Return the total profit as the maximum profit that can be earned.
You are given a binary tree with 'N' unique nodes, and a specific start node from where the fire will begin. The task is to determine the time in minute...
The task is to determine the time in minutes required to burn the entire binary tree starting from a given node.
Traverse the tree from the given start node to calculate the time taken to burn the entire tree.
Use a queue to keep track of nodes and their burning time.
Increment the burning time for each level of nodes until the entire tree is burned.
Round duration - 75-80 minutes
Round difficulty - Hard
This was a completely technical coding round where I was asked to solve the problems of data structures.
The codepad where i was asked to code was fine,
The interviewer was very friendly and was helpful and understanding.
I also asked him about his work and experience in the company and some other questions.
Given an N*M matrix filled with integer numbers, your task is to find the maximum path sum starting from any cell in the first row and ending at any cell in the last row. Y...
Round duration - 45 minutes
Round difficulty - Easy
It was held on Gmeet platform
The interviewer was very experienced person and was very nice too.
He made me comfortable by first introducing himself in a very detailed way and then asking me mine introduction
Since I feel that his internet connection was not very good so he turned off his camera but I decided not to turn off mine as in online interviews your face reviles your confidence
the interviewer mostly asked me questions about my interests in technical field and the project that I have done
Tip 1 : Practice atleast(easy and medium questions from leetcode under(Top Interview Questions)) and all the questions from Gfg under(must to do coding questions for interviews))
Tip 2 : Don't learn each and every question you solved but try to solve question in a way that you can solve its variation during interviews
Tip 3 : Do one project(one is enough) which you can explain with full technical details (why you used this technology, and all logics you applied in implementation)
Tip 4: Atleast read the round 1 (Coding round) Archives from (Geeks for geeks or Glassdoor). To get your mind prepared for the types of questions that company usually asks.(Coding round is the toughest Step in the whole Process to clear)
Tip 1: Have at least one project which you have made yourself and you should know all the technical questions related to that project (I feel project domain hardly matters like web development or android or ML/AI)
Tip 2: You should Put only those skills in resume :
1. Which the company requires (eg if you know company doesn't require Networking domain knowledge so
don't include it unnecessary if you are not much confident in it)
2. For on campus internships resume shortlisting is very easy so don't add anything unnecessary which might
cause you pain during interview.
The duration of PhonePe Software Developer interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 9 interviews
3 Interview rounds
based on 11 reviews
Rating in categories
Key Accounts Executive
645
salaries
| ₹0 L/yr - ₹0 L/yr |
Territory Sales Manager
518
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Development Executive
491
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Development Associate
370
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
259
salaries
| ₹0 L/yr - ₹0 L/yr |
Paytm
Google Pay
Amazon Pay
Mobikwik