PhonePe Interview Questions — 93 DSA Problems 89 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.
Most frequently asked PhonePe LeetCode questions for software engineering interviews.
Frog Jump (HARD) — Array, Dynamic Programming Burst Balloons (HARD) — Array, Dynamic Programming Decoded String at Index (MEDIUM) — String, Stack Maximum Tastiness of Candy Basket (MEDIUM) — Array, Binary Search, Greedy, Sorting Simple Bank System (MEDIUM) — Array, Hash Table, Design, Simulation Smallest Range Covering Elements from K Lists (HARD) — Array, Hash Table, Greedy, Sliding Window, Sorting, Heap (Priority Queue) Viewers Turned Streamers (HARD) — Database Frequencies of Shortest Supersequences (HARD) — Array, String, Bit Manipulation, Graph, Topological Sort, Enumeration Smallest String With Swaps (MEDIUM) — Array, Hash Table, String, Depth-First Search, Breadth-First Search, Union Find, Sorting Maximum Amount of Money Robot Can Earn (MEDIUM) — Array, Dynamic Programming, Matrix Check if Point Is Reachable (HARD) — Math, Number Theory Count the Number of Arrays with K Matching Adjacent Elements (HARD) — Math, Combinatorics Find Beautiful Indices in the Given Array II (HARD) — Two Pointers, String, Binary Search, Rolling Hash, String Matching, Hash Function Remove K Digits (MEDIUM) — String, Stack, Greedy, Monotonic Stack Most Stones Removed with Same Row or Column (MEDIUM) — Hash Table, Depth-First Search, Union Find, Graph Bus Routes (HARD) — Array, Hash Table, Breadth-First Search Trapping Rain Water (HARD) — Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack Longest Palindromic Substring (MEDIUM) — Two Pointers, String, Dynamic Programming House Robber II (MEDIUM) — Array, Dynamic Programming Queue Reconstruction by Height (MEDIUM) — Array, Binary Indexed Tree, Segment Tree, Sorting Split Array Largest Sum (HARD) — Array, Binary Search, Dynamic Programming, Greedy, Prefix Sum Candy (HARD) — Array, Greedy Frequency of the Most Frequent Element (MEDIUM) — Array, Binary Search, Greedy, Sliding Window, Sorting, Prefix Sum House Robber (MEDIUM) — Array, Dynamic Programming Best Time to Buy and Sell Stock (EASY) — Array, Dynamic Programming Kth Smallest Element in a Sorted Matrix (MEDIUM) — Array, Binary Search, Sorting, Heap (Priority Queue), Matrix Maximum Profit in Job Scheduling (HARD) — Array, Binary Search, Dynamic Programming, Sorting Amount of Time for Binary Tree to Be Infected (MEDIUM) — Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Tree Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit (MEDIUM) — Array, Queue, Sliding Window, Heap (Priority Queue), Ordered Set, Monotonic Queue Reachable Nodes In Subdivided Graph (HARD) — Graph, Heap (Priority Queue), Shortest Path Koko Eating Bananas (MEDIUM) — Array, Binary Search Sum of Distances in Tree (HARD) — Dynamic Programming, Tree, Depth-First Search, Graph Make Lexicographically Smallest Array by Swapping Elements (MEDIUM) — Array, Union Find, Sorting IPO (HARD) — Array, Greedy, Sorting, Heap (Priority Queue) Jump Game II (MEDIUM) — Array, Dynamic Programming, Greedy House Robber III (MEDIUM) — Dynamic Programming, Tree, Depth-First Search, Binary Tree Distribute Coins in Binary Tree (MEDIUM) — Tree, Depth-First Search, Binary Tree Sort Colors (MEDIUM) — Array, Two Pointers, Sorting Merge Intervals (MEDIUM) — Array, Sorting Maximal Square (MEDIUM) — Array, Dynamic Programming, Matrix Split Array into Consecutive Subsequences (MEDIUM) — Array, Hash Table, Greedy, Heap (Priority Queue) Best Time to Buy and Sell Stock III (HARD) — Array, Dynamic Programming Word Ladder (HARD) — Hash Table, String, Breadth-First Search Minimum Cost to Cut a Stick (HARD) — Array, Dynamic Programming, Sorting Rotting Oranges (MEDIUM) — Array, Breadth-First Search, Matrix Matchsticks to Square (MEDIUM) — Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask Sliding Window Maximum (HARD) — Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue Accounts Merge (MEDIUM) — Array, Hash Table, String, Depth-First Search, Breadth-First Search, Union Find, Sorting Swim in Rising Water (HARD) — Array, Binary Search, Depth-First Search, Breadth-First Search, Union Find, Heap (Priority Queue), Matrix Best Time to Buy and Sell Stock IV (HARD) — Array, Dynamic Programming P
PhonePe 93 questions tracked 89 with solutions
📊 All Time 93 📅 Last 6 Months 13 🔥 Last 3 Months 0 ⚡ Last 30 Days 0
Sorted highest → lowest frequency ✓ Our Solution = we have a detailed walkthrough
Showing 93 of 93 questions
4 Array Binary Search Greedy Sorting
5 Array Hash Table Design Simulation
6 Array Hash Table Greedy Sliding Window +2
7 Hard Viewers Turned Streamers
Database
8 Array String Bit Manipulation Graph +2
9 Array Hash Table String Depth-First Search +3
10 Array Dynamic Programming Matrix
12 Hard Count the Number of Arrays with K Matching Adjacent Elements ✓ Our Solution Math Combinatorics
13 Two Pointers String Binary Search Rolling Hash +2
14 String Stack Greedy Monotonic Stack
15 Hash Table Depth-First Search Union Find Graph
16 Array Hash Table Breadth-First Search
17 Array Two Pointers Dynamic Programming Stack +1
18 Two Pointers String Dynamic Programming
20 Array Binary Indexed Tree Segment Tree Sorting
21 Array Binary Search Dynamic Programming Greedy +1
23 Array Binary Search Greedy Sliding Window +2
26 Array Binary Search Sorting Heap (Priority Queue) +1
27 Array Binary Search Dynamic Programming Sorting
28 Hash Table Tree Depth-First Search Breadth-First Search +1
29 Medium Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit ✓ Our Solution Array Queue Sliding Window Heap (Priority Queue) +2
30 Graph Heap (Priority Queue) Shortest Path
32 Dynamic Programming Tree Depth-First Search Graph
33 Medium Make Lexicographically Smallest Array by Swapping Elements ✓ Our Solution Array Union Find Sorting
34 Array Greedy Sorting Heap (Priority Queue)
35 Array Dynamic Programming Greedy
36 Dynamic Programming Tree Depth-First Search Binary Tree
37 Tree Depth-First Search Binary Tree
40 Array Dynamic Programming Matrix
41 Array Hash Table Greedy Heap (Priority Queue)
43 Hash Table String Breadth-First Search
44 Array Dynamic Programming Sorting
45 Array Breadth-First Search Matrix
46 Array Dynamic Programming Backtracking Bit Manipulation +1
47 Array Queue Sliding Window Heap (Priority Queue) +1
48 Array Hash Table String Depth-First Search +3
49 Array Binary Search Depth-First Search Breadth-First Search +3
51 Array String Depth-First Search Breadth-First Search +3
52 Tree Breadth-First Search Binary Tree
53 Array Hash Table String Sorting
54 Array Hash Table Union Find
55 Hash Table Linked List Design Doubly-Linked List
56 Hash Table Tree Depth-First Search Binary Tree
59 Array Two Pointers Binary Search Sorting
60 Array Breadth-First Search Matrix
61 Array Dynamic Programming Stack Monotonic Stack
63 String Dynamic Programming Backtracking
65 Dynamic Programming Tree Depth-First Search Binary Tree
66 Array Greedy Sorting Heap (Priority Queue)
67 Array Dynamic Programming Greedy
68 Hard Partition Array Into Two Arrays to Minimize Sum Difference ✓ Our Solution Array Two Pointers Binary Search Dynamic Programming +3
69 Array Stack Monotonic Stack
70 String Dynamic Programming
71 Array Dynamic Programming Backtracking Bit Manipulation +1
72 Hard Alien Dictionary
Array String Depth-First Search Breadth-First Search +2
73 Array Stack Monotonic Stack
74 Depth-First Search Breadth-First Search Graph Topological Sort
75 Hash Table String Sliding Window
76 Tree Breadth-First Search Design Binary Tree
78 Array Depth-First Search Breadth-First Search Union Find +1
79 Array Binary Search Sorting
80 Hard Number of Islands II
Array Hash Table Union Find
82 Array Hash Table Two Pointers Binary Search +3
83 Array Hash Table String Graph +1
85 Array Hash Table Simulation
86 Array Dynamic Programming Stack Greedy +1
87 Array Dynamic Programming Greedy
88 Array Binary Search Sliding Window Sorting +1
89 Array Hash Table Prefix Sum
90 Depth-First Search Breadth-First Search Graph Topological Sort
91 Medium Find the Celebrity
Two Pointers Graph Interactive
93 Array Hash Table Binary Search Sorting +2
