PhonePe
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
posted on 10 Oct 2020
I applied via Recruitment Consultant and was interviewed in Sep 2020. There were 4 interview rounds.
Sort an array of strings while maintaining the original order.
Create a map of each string to its original index in the array.
Sort the array of strings.
Use the map to reorder the sorted array based on the original order.
Find the Kth element from the end of a linked list.
Traverse the linked list to find its length.
Subtract K from the length to get the index of the Kth element from the end.
Traverse the linked list again to find the Kth element from the end.
Top trending discussions
posted on 15 Jul 2021
I applied via LinkedIn and was interviewed in Jun 2021. There was 1 interview round.
Finding sub sudoko in a multi-dimensional integer array.
Iterate through each row and column to find sub-sudoku
Check if each sub-grid contains all numbers from 1 to 9
If yes, then it is a sub-sudoku
If no, then move to the next sub-grid
posted on 13 Dec 2021
I applied via Recruitment Consultant and was interviewed in Jun 2021. There were 5 interview rounds.
posted on 23 Nov 2022
I applied via Referral and was interviewed in Oct 2022. There were 3 interview rounds.
I appeared for an interview before Sep 2020.
Round duration - 60 Minutes
Round difficulty - Medium
Determine if a given string 'S' is a palindrome, considering only alphanumeric characters and ignoring spaces and symbols.
The string 'S' should be evaluated in a case...
The task is to check whether a given string is a palindrome or not, considering only alphabets and numbers and ignoring symbols and whitespaces.
Convert the string to lowercase and remove all symbols and whitespaces.
Reverse the modified string and compare it with the original string.
If they are equal, then the string is a palindrome.
If not, then the string is not a palindrome.
Given a number N
, calculate its square root and output the integer part only.
18
4
The square root of 18 is approximate...
The task is to find the integral part of the square root of a given number.
Use the built-in square root function to find the square root of the number.
Convert the result to an integer by rounding down or using the floor function.
Print the integer part of the square root as the output.
Given a positive integer N
, your task is to determine the minimum number of steps required to reduce N
to 1.
1) Subtract 1 from it: n = n -...
The task is to find the minimum number of steps required to reduce a positive integer to 1 using three given operations.
Use dynamic programming to solve the problem efficiently.
Create an array to store the minimum steps required for each number from 1 to N.
Iterate from 2 to N and calculate the minimum steps for each number based on the three operations.
Return the minimum steps for N.
Round duration - 60 Minutes
Round difficulty - Medium
They started Fundamentals of OOP- Inheritance, Polymorphism
Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.
array = [34, -50, 42, 14, -5, 86]
The maximum sum of any contiguous subarray in an array is found using Kadane's algorithm in O(N) time.
Initialize two variables, maxSum and currentSum, both set to the first element of the array.
Iterate through the array from the second element.
For each element, update currentSum by adding the element to it.
If currentSum becomes negative, reset it to 0.
If currentSum is greater than maxSum, update maxSum.
After iterating ...
Round duration - 30 Minutes
Round difficulty - Medium
Some people had two HR interviews but I only had one and interview went up till 11:30 pm and you get only 5-10 minutes to prepare for HR on Zoom
Tip 1 : Solve atleast 200 problems
Tip 2 : Focus on all data structures
Tip 3 : Build some good projects
Tip 1 : Keep it precise and concise.
Tip 2 : Build your resume yourself according your skills
I applied via Naukri.com and was interviewed in Feb 2020. There was 1 interview round.
posted on 11 Oct 2020
I applied via Naukri.com and was interviewed in Sep 2020. There were 5 interview rounds.
I appeared for an interview in Dec 2020.
Round duration - 60 minutes
Round difficulty - Medium
test timing: 7-8 pm
2 programming questions
webcam proctored
You are provided with an array ARR
of integers of size 'N' and an integer 'K'. The goal is to move from the starting index to the end of the array with the minimum possib...
Find minimum cost to reach end of array by jumping with constraints
Use dynamic programming to keep track of minimum cost at each index
Iterate through the array and update the minimum cost based on reachable indices within K steps
Calculate cost to jump from current index to reachable indices and update minimum cost accordingly
Tip 1 : Ability to apply data structures in questions(practice graph and Tree questions)
Tip 2 : Thorough knowledge of the projects done
Tip 3 : Good knowledge about computer science concepts
Tip 1 : Mention projects that you have done yourself and are thorough with
Tip 2 : mention soft skills
I applied via Campus Placement and was interviewed in May 2021. There were 5 interview rounds.
I applied via Naukri.com and was interviewed before May 2022. There were 3 interview rounds.
New market launch strategy
SQL intermediate level
Key Accounts Executive
698
salaries
| ₹3.7 L/yr - ₹7.5 L/yr |
Territory Sales Manager
520
salaries
| ₹4.5 L/yr - ₹10.5 L/yr |
Business Development Executive
494
salaries
| ₹1.1 L/yr - ₹5.1 L/yr |
Software Engineer
355
salaries
| ₹13 L/yr - ₹55 L/yr |
Business Development Associate
319
salaries
| ₹2.3 L/yr - ₹6 L/yr |
Paytm
Fiserv
KFintech
Angel One