PhonePe Interview Guide

Showing 3 questions

Ranking

A question's ranking corresponds to how commonly it's asked by PhonePe. The higher the ranking, the more likely you'll encounter it in a PhonePe interview.

Question

Frequency

Difficulty

Regular Expression Matching

Determine if an input string matches a given regular expression that supports '.' and '*' characters. The '.' matches any single character, and '*' matches zero or more occurrences of the preceding element.

StringsDynamic ProgrammingRecursion

Very likely

If you have a PhonePe interview, it's very likely that you will get this question

Hard

#1. Regular Expression Matching

Hard

StringsDynamic ProgrammingRecursion

This question is very likely to be asked in your PhonePe interview

Remove K Digits

Given a string of digits, remove *k* digits to obtain the smallest possible number. You need to determine which digits to remove to minimize the resulting number.

StringsStacksGreedy Algorithms

Very likely

If you have a PhonePe interview, it's very likely that you will get this question

Medium

#2. Remove K Digits

Medium

Given a string of digits, remove *k* digits to obtain the smallest possible number. You need to determine which digits to remove to minimize the resulting number.

StringsStacksGreedy Algorithms

This question is very likely to be asked in your PhonePe interview

Smallest Range Covering Elements from K Lists

You have K sorted lists of numbers. Find the smallest range [min, max] that includes at least one number from each of the K lists.

ArraysTwo PointersSliding Windows

Very likely

If you have a PhonePe interview, it's very likely that you will get this question

Hard

#3. Smallest Range Covering Elements from K Lists

Hard

You have K sorted lists of numbers. Find the smallest range [min, max] that includes at least one number from each of the K lists.

ArraysTwo PointersSliding Windows