PhonePe Software Developer Interview Questions, Process, and Tips

It consisted of 3 medium-hard dsa questions

Q1. Graph bfs question
Add your answer
Q2. Linked list question
Add your answer

OA was about dp and graph

Was about dp graphs and sliding window

There were one medium and one easy coding question of DSA one of the array and another of string.

Q1. It was a good interview, where I was asked one easy DSA question, and asked many things related to API, requests types in API, errors code in the API, and bash scripts. It was 1.5 hours long interview.
Add your answer

Q1. It was the Hiring Manager round, where I was asked about the HLD of Phonepe.
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Q1. 
Best Time To Buy and Sell Stock Problem Statement
You are given an array 'PRICES' of 'N' integers, where 'PRICES[i]' represents the price of a certain stock on the i-th day. An integer 'K' is also provide...read more
Add your answer
Q2. 
Maximum Sum Rectangle Problem Statement
Given a matrix ARR with dimensions N x M, your task is to identify the rectangle within the matrix that has the maximum sum of its elements.
Input:
The first line...read more
Add your answer
Q3. 
Snake and Ladder Problem Statement
Given a 'Snake and Ladder' board with N rows and N columns, where positions are numbered from 1 to (N*N) starting from the bottom left, alternating direction each row, f...read more
Add your answer

Round duration - 70 Minutes
Round difficulty - Medium

Q1. 
Longest Increasing Subsequence Problem Statement
Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...read more
Add your answer
Q2. 
Longest Increasing Path in a 2D Matrix Problem Statement
Given a matrix of non-negative integers of size 'N x M', where 'N' and 'M' denote the number of rows and columns respectively, find the length of t...read more
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

Q1. 
Search In Rotated Sorted Array Problem Statement
Given a rotated sorted array ARR of size 'N' and an integer 'K', determine the index at which 'K' is present in the array.
Note:
1. If 'K' is not present...read more
Add your answer

Round duration - 120 Minutes
Round difficulty - Medium

Timing was 3PM to 5 PM
There were 4 coding questions based on Dynamic Programming , Graphs, Mathematical analysis , Trie data structure.

Q1. 
Weighted Job Scheduling Problem Statement
You have 'N' jobs, each with a start time, end time, and profit. Your task is to identify the maximum profit that can be earned by scheduling these jobs such that...read more
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

The interviewer was very soft spoken and helpful. There were in total 3 questions of easy-medium difficulty based on DP, Graphs and Sorting . It was around 11 AM timing.

Q1. 
Knight Probability in Chessboard
Calculate the probability that a knight remains on an N x N chessboard after making K moves. Initially, the knight is placed at a given position on the board. It can move ...read more
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

The round had 1 DS and Algo problem and 1 system Design question based on building any management portal.

Q1. 
Snake and Ladder Problem Statement
Given a 'Snake and Ladder' board with N rows and N columns, where positions are numbered from 1 to (N*N) starting from the bottom left, alternating direction each row, f...read more
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

It was more of Hiring Manager round where he asked about my skills , my projects and how could i be valuable to firm. It was quit easy going round