Dashboard Problems Companies Topics SQL System Design AI

No account needed. Your solved list, notes and streak are saved in this browser. Export them from Settings.

Companies

Dashboard Problems Companies System Design

Search

Jump to any problem, company or topic

PhonePe interview questions (all time) · FAANGrind

PhonePe

FintechIndian All time

PhonePe is an Indian digital payments and financial services platform built on UPI, offering payments, insurance, lending and investments.

Est. 2015

Problems: 103
Window: All time
Topics: 6

103 problems

TopicsLinks

1

1.Minimum Cost to Reach Destination in Time

Hard3 co.

Hard

also at 2 more

2

2.Longest Cycle in a Graph

Hard3 co.

Hard

also at 2 more

3

3.Make Lexicographically Smallest Array by Swapping Elements

Medium3 co.

Medium

also at 2 more

4

4.Letter Combinations of a Phone Number

Medium34 co.

Medium

Recursion & Backtracking

also at 33 more

5

5.Merge Intervals

Medium51 co.

Medium

Greedy Algorithms

also at 50 more

6

6.Continuous Subarray Sum

Medium3 co.

Medium

also at 2 more

7

7.Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit

Medium9 co.

Medium

also at 8 more

8

8.Jump Game - I

Medium29 co.

Medium

Greedy Algorithms

also at 28 more

9

9.Count the Number of Arrays with K Matching Adjacent Elements

Hard1 co.

Hard

also at 0 more

10

10.Distribute Candies Among Children II

Medium1 co.

Medium

also at 0 more

11

11.Bricks Falling When Hit

Hard2 co.

Hard

also at 1 more

12

12.Find Duplicate Subtrees

Medium3 co.

Medium

also at 2 more

13

13.Smallest Range Covering Elements from K Lists

Hard3 co.

Hard

also at 2 more

14

14.Group Words by Anagrams

Medium35 co.

Medium

also at 34 more

15

Hard7 co.

Hard

also at 6 more

16

Medium2 co.

Medium

also at 1 more

17

17.Koko eating bananas

Medium33 co.

Medium

also at 32 more

18

18.Maximum Performance of a Team

Hard4 co.

Hard

also at 3 more

19

19.Maximum Profit in Job Scheduling

Hard12 co.

Hard

Dynamic Programming

also at 11 more

20

20.Minimum Cost Tree From Leaf Values

Medium1 co.

Medium

also at 0 more

21

21.Maximal Square

Medium12 co.

Medium

Dynamic Programming

also at 11 more

22

22.Number of islands II

Hard5 co.

Hard

also at 4 more

23

23.Simple Bank System

Medium5 co.

Medium

also at 4 more

24

24.Loud and Rich

Medium3 co.

Medium

also at 2 more

25

25.Burst Balloons

Hard11 co.

Hard

Dynamic Programming

also at 10 more

26

Medium14 co.

Medium

Greedy Algorithms

also at 13 more

27

Medium24 co.

Medium

also at 23 more

28

28.Sum of Distances in Tree

Hard2 co.

Hard

also at 1 more

29

29.Count Palindromic Subsequences

Hard13 co.

Hard

Dynamic Programming

also at 12 more

30

30.Uncrossed Lines

Medium1 co.

Medium

Dynamic Programming

also at 0 more

31

31.First Missing Positive

Hard19 co.

Hard

also at 18 more

32

32.Frequencies of Shortest Supersequences

Hard1 co.

Hard

also at 0 more

33

33.Number of islands

Medium48 co.

Medium

also at 47 more

34

34.Shortest Path to Get All Keys

Hard3 co.

Hard

also at 2 more

35

35.Most stones removed with same row or column

Medium4 co.

Medium

also at 3 more

36

36.Remove K Digits

Medium22 co.

Medium

also at 21 more

37

37.Maximum Total Damage With Spell Casting

Medium2 co.

Medium

Dynamic Programming

also at 1 more

38

38.Predict the Winner

Medium7 co.

Medium

Dynamic Programming

also at 6 more

39

39.Count Subarrays With Fixed Bounds

Hard5 co.

Hard

also at 4 more

40

40.Minimum Number of Days to Make m Bouquets

Medium5 co.

Medium

also at 4 more

41

41.Matchsticks to Square

Medium4 co.

Medium

Recursion & Backtracking

also at 3 more

42

42.Cherry Pickup

Hard5 co.

Hard

Dynamic Programming

also at 4 more

43

43.Longest Consecutive Sequence in an Array

Medium37 co.

Medium

also at 36 more

44

44.Distance of nearest cell having one

Medium9 co.

Medium

also at 8 more

45

45.Reachable Nodes In Subdivided Graph

Hard1 co.

Hard

also at 0 more

46

46.Split Array into Consecutive Subsequences

Medium1 co.

Medium

also at 0 more

47

47.Apply Operations to Maximize Frequency Score

Hard1 co.

Hard

also at 0 more

48

48.Asteroid Collision

Medium31 co.

Medium

Arrays Stack & Queues

also at 30 more

49

49.Sliding Window Maximum

Medium36 co.

Medium

also at 35 more

50

50.Furthest Reachable Mountain

Medium6 co.

Medium

Greedy Algorithms

also at 5 more

Showing 1–50 of 103

Difficulty split

Easy1(1%)
Medium67(65%)
Hard35(34%)

Top topics

Graphs28
Dynamic Programming17
Arrays9
Binary Search8
Stack & Queues8
Greedy Algorithms8