PhonePe Coding Interview Questions: 23 Tagged Problems
23 coding problems tagged PhonePe — 2 easy · 14 medium · 7 hard — with solutions in 13 languages. Plus a 2-week study plan by topic.
- Problems: 23
- By difficulty: 2 easy · 14 medium · 7 hard
- Languages: JavaScript, TypeScript, Python, Java, C++, C, C#, Go, Kotlin, Swift, Rust, PHP and Ruby
- Cost: Free on every plan; sign in to run and submit
23 problems the CodeKairo catalogue tags as commonly asked in PhonePe's coding rounds — 2 easy, 14 medium and 7 hard — each judged by hidden tests in 13 languages. The most common topics among them are Arrays (16), Dynamic Programming (7) and Sorting (6). The tag is the catalogue's own annotation of where a problem tends to come up — not a list published by PhonePe, which CodeKairo is not affiliated with.
PhonePe study plan by topic
All 23 problems tagged PhonePe over 2 weeks, about 14 h 40 min of solving, grouped by technique in the order they build on each other — Hash Table, Sliding Window, Prefix Sum and Binary Search and 11 more.
Week 1: Hash Table, Sliding Window, Prefix Sum +4
12 problems on Hash Table, Sliding Window, Prefix Sum, Binary Search, Stack, Monotonic Stack and Monotonic Queue, easiest first within each topic.
- Two Sum Easy
- Count the Number of Good Subarrays Medium
- Smallest Range Covering Elements from K Lists Hard
- Number of Flowers in Full Bloom Hard
- Minimum Number of Days to Make m Bouquets Medium
- Maximum Tastiness of Candy Basket Medium
- Maximum Profit in Job Scheduling Hard
- Valid Parentheses Easy
- Asteroid Collision Medium
- Trapping Rain Water Hard
- Remove K Digits Medium
- Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit Medium
Week 2: Greedy, Heap, Bitmask +5
11 problems on Greedy, Heap, Bitmask, Number Theory, Graph, Breadth-First Search, Union Find and Dynamic Programming, easiest first within each topic.
- Jump Game II Medium
- Kth Smallest Element in a Sorted Matrix Medium
- Matchsticks to Square Medium
- Check if Point Is Reachable Hard
- Sum of Distances in Tree Hard
- Rotting Oranges Medium
- Bus Routes Hard
- Smallest String With Swaps Medium
- Most Stones Removed with Same Row or Column Medium
- Longest Palindromic Substring Medium
- House Robber Medium
All problems tagged PhonePe
Easy (2)
- Valid Parentheses String, Stack
- Two Sum Array, Hash Table
Medium (14)
- Matchsticks to Square Array, Backtracking, Bitmask
- Most Stones Removed with Same Row or Column Graph, Union Find, Depth-First Search
- Maximum Tastiness of Candy Basket Array, Binary Search, Greedy
- Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit Array, Sliding Window, Monotonic Queue
- Minimum Number of Days to Make m Bouquets Array, Binary Search
- Count the Number of Good Subarrays Array, Hash Table, Sliding Window
- Smallest String With Swaps Union Find, Hash Table, String
- Kth Smallest Element in a Sorted Matrix Array, Binary Search, Sorting
- Rotting Oranges Array, Matrix, Breadth-First Search
- House Robber Array, Dynamic Programming
- Jump Game II Array, Greedy, Dynamic Programming
- Asteroid Collision Array, Stack, Simulation
- Remove K Digits String, Stack, Greedy
- Longest Palindromic Substring String, Dynamic Programming
Hard (7)
- Sum of Distances in Tree Tree, Depth-First Search, Graph
- Maximum Profit in Job Scheduling Array, Binary Search, Dynamic Programming
- Number of Flowers in Full Bloom Array, Binary Search, Sorting
- Check if Point Is Reachable Math, Number Theory
- Smallest Range Covering Elements from K Lists Array, Hash Table, Greedy
- Bus Routes Array, Hash Table, Breadth-First Search
- Trapping Rain Water Array, Two Pointers, Dynamic Programming
Topics PhonePe asks most
- Arrays 16 problems
- Dynamic Programming 7 problems
- Sorting 6 problems
- Hash Table 5 problems
- Binary Search 5 problems
- Strings 4 problems
- Stack 4 problems
- Greedy 4 problems
- Sliding Window 3 problems
- Matrix 2 problems
- Heap 2 problems
- Graph 2 problems