PhonePe

Smallest Range Covering Elements from K Lists

Find Beautiful Indices in the Given Array II

Count the Number of Arrays with K Matching Adjacent Elements

Minimum Number of Days to Make m Bouquets

Most Stones Removed with Same Row or Column

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

Make Lexicographically Smallest Array by Swapping Elements

Split Array into Consecutive Subsequences

Amount of Time for Binary Tree to Be Infected

Number of Operations to Make Network Connected

Minimum Edge Reversals So Every Node Is Reachable

Maximum Number of Events That Can Be Attended II

Find All Possible Recipes from Given Supplies

Apply Operations to Maximize Frequency Score

PhonePe Interview Guide