PhonePe Software Engineer Interview Questions, Process, and Tips

Leetcode medium to hard level

Q1. Dfs bfs in a graph
Add your answer

4 question (1.5 hrs test) 400 points (100 points for question each)

Q1. Calculate the no.of consecutive zeroes in a binary array
Ans. 
Count consecutive zeroes in a binary array
• Iterate through the binary array and keep track of the maximum consecutive zeroes encountered

• Reset the count of consecutive zeroes when a non-zero element is encountered

• Return the maximum consecutive zeroes found
Answered by AI
Add your answer
Q2. Return k pairs of subsets having sum=num
Ans. 
Return k pairs of subsets with sum=num
• Use a nested loop to iterate through all possible pairs of subsets

• Check if the sum of the subsets equals the target num

• Store the valid pairs in an array and return k pairs
Answered by AI
Add your answer

Q1. 3 sum problem and number of operations required to make 2 strings same
Ans. 
3 sum problem involves finding 3 numbers in an array that add up to a target sum. Number of operations to make 2 strings same involves finding the minimum number of operations (insert, delete, replace) needed to transform one string into another.
• For 3 sum problem, use a hashmap to store complements of each number and check if the complement exists in the hashmap while iterating through the array.

• For number of operation...read more
Answered by AI
Add your answer

Q1. Nearby app machine coding
Add your answer

Q1. Project and practices followed and hld for inshort
Ans. 
I have experience working on projects using high-level design (HLD) practices.
• Utilized UML diagrams to create HLD for projects

• Followed industry best practices for software design

• Collaborated with team members to ensure HLD aligns with project goals
Answered by AI
Add your answer

Coding test was. good enough with leetfcode medium

Coding test was good enogugh with leetcode medum