106 curated coding interview questions directly asked in Paypal technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 347 | Top K Frequent Elements | Medium | Heap | Priority Queue | 66.4% | 100.0% | 3m |
| 300 | Longest Increasing Subsequence | Medium | Dynamic Programming | State Transition | 59.4% | 100.0% | 6m |
| 1200 | Minimum Absolute Difference | Easy | Arrays | Sorting / Prefix / Scan | 75.1% | 100.0% | 6m |
| 295 | Find Median from Data Stream | Hard | Heap | Priority Queue | 54.5% | 100.0% | 6m |
| 6 | Zigzag Conversion | Medium | Core DSA | Implementation / Reasoning | 54.2% | 100.0% | all |
| 33 | Search in Rotated Sorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 44.9% | 87.5% | 6m |
| 2559 | Count Vowel Strings in Ranges | Medium | Strings | Hashing / Sliding Window | 67.8% | 87.5% | all |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 75.0% | 6m |
| 3820 | Pythagorean Distance Nodes in a Tree | Medium | Trees | DFS / BFS | 58.0% | 75.0% | 6m |
| 735 | Asteroid Collision | Medium | Core DSA | Implementation / Reasoning | 47.9% | 75.0% | 6m |
| 560 | Subarray Sum Equals K | Medium | Arrays | Sorting / Prefix / Scan | 47.3% | 75.0% | 6m |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 75.0% | 6m |
| 1969 | Minimum Non-Zero Product of the Array Elements | Medium | Arrays | Sorting / Prefix / Scan | 37.6% | 75.0% | all |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 75.0% | all |
| 79 | Word Search | Medium | Strings; Binary Search | Hashing / Sliding Window; Binary Search | 47.4% | 75.0% | all |
| 1999 | Smallest Greater Multiple Made of Two Digits | Medium | Core DSA | Implementation / Reasoning | 48.2% | 75.0% | all |
| 2056 | Number of Valid Move Combinations On Chessboard | Hard | Strings; Backtracking | Hashing / Sliding Window; Backtracking | 48.7% | 75.0% | all |
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 75.0% | all |
| 238 | Product of Array Except Self | Medium | Arrays | Sorting / Prefix / Scan | 68.9% | 75.0% | all |
| 2183 | Count Array Pairs Divisible by K | Hard | Arrays | Sorting / Prefix / Scan | 30.7% | 75.0% | all |
| 2380 | Time Needed to Rearrange a Binary String | Medium | Strings | Hashing / Sliding Window | 53.0% | 75.0% | all |
| 2554 | Maximum Number of Integers to Choose From a Range I | Medium | Arrays | Sorting / Prefix / Scan | 68.0% | 75.0% | all |
| 2586 | Count the Number of Vowel Strings in Range | Easy | Strings | Hashing / Sliding Window | 74.3% | 75.0% | all |
| 2524 | Maximum Frequency Score of a Subarray | Hard | Arrays | Sorting / Prefix / Scan | 36.5% | 75.0% | all |
| 2557 | Maximum Number of Integers to Choose From a Range II | Medium | Arrays | Sorting / Prefix / Scan | 35.0% | 75.0% | all |
| 1229 | Meeting Scheduler | Medium | Greedy | Greedy | 55.2% | 75.0% | all |
| 1473 | Paint House III | Hard | Core DSA | Implementation / Reasoning | 61.2% | 75.0% | all |
| 1589 | Maximum Sum Obtained of Any Permutation | Medium | Arrays; Backtracking | Sorting / Prefix / Scan; Backtracking | 40.8% | 75.0% | all |
| 322 | Coin Change | Medium | Dynamic Programming | State Transition | 48.4% | 75.0% | all |
| 221 | Maximal Square | Medium | Core DSA | Implementation / Reasoning | 50.3% | 75.0% | all |
| 1160 | Find Words That Can Be Formed by Characters | Easy | Strings | Hashing / Sliding Window | 71.6% | 75.0% | all |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 62.5% | all |
| 49 | Group Anagrams | Medium | Strings | Hashing / Sliding Window | 72.6% | 62.5% | all |
| 121 | Best Time to Buy and Sell Stock | Easy | Core DSA | Implementation / Reasoning | 56.8% | 62.5% | all |
| 1010 | Pairs of Songs With Total Durations Divisible by 60 | Medium | Core DSA | Implementation / Reasoning | 53.5% | 62.5% | all |
| 1283 | Find the Smallest Divisor Given a Threshold | Medium | Core DSA | Implementation / Reasoning | 65.9% | 62.5% | all |
| 198 | House Robber | Medium | Dynamic Programming | State Transition | 53.2% | 62.5% | all |
| 53 | Maximum Subarray | Medium | Arrays | Sorting / Prefix / Scan | 53.3% | 62.5% | all |
| 1353 | Maximum Number of Events That Can Be Attended | Medium | Arrays | Sorting / Prefix / Scan | 39.0% | 62.5% | all |
| 1046 | Last Stone Weight | Easy | Core DSA | Implementation / Reasoning | 66.5% | 62.5% | all |
| 11 | Container With Most Water | Medium | Core DSA | Two Pointers | 60.0% | 50.0% | all |
| 15 | 3Sum | Medium | Arrays | Sorting / Prefix / Scan | 39.1% | 50.0% | all |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 50.0% | all |
| 42 | Trapping Rain Water | Hard | Core DSA | Two Pointers | 67.4% | 50.0% | all |
| 75 | Sort Colors | Medium | Arrays | Sorting / Prefix / Scan | 69.6% | 50.0% | all |
| 2062 | Count Vowel Substrings of a String | Easy | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 73.2% | 50.0% | all |
| 851 | Loud and Rich | Medium | Core DSA | Implementation / Reasoning | 63.5% | 50.0% | all |
| 48 | Rotate Image | Medium | Arrays | Sorting / Prefix / Scan | 80.1% | 50.0% | all |
| 945 | Minimum Increment to Make Array Unique | Medium | Arrays | Sorting / Prefix / Scan | 60.7% | 50.0% | all |
| 528 | Random Pick with Weight | Medium | Core DSA | Implementation / Reasoning | 49.1% | 50.0% | all |
| 162 | Find Peak Element | Medium | Binary Search | Binary Search | 47.0% | 50.0% | all |
| 697 | Degree of an Array | Easy | Arrays | Sorting / Prefix / Scan | 58.4% | 50.0% | all |
| 54 | Spiral Matrix | Medium | Arrays | Sorting / Prefix / Scan | 56.8% | 50.0% | all |
| 875 | Koko Eating Bananas | Medium | Binary Search | Binary Search | 50.0% | 50.0% | all |
| 647 | Palindromic Substrings | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 72.8% | 50.0% | all |
| 128 | Longest Consecutive Sequence | Medium | Core DSA | Implementation / Reasoning | 47.1% | 50.0% | all |
| 460 | LFU Cache | Hard | Design | Data Structure Design | 49.2% | 50.0% | all |
| 36 | Valid Sudoku | Medium | Strings; Backtracking | Hashing / Sliding Window; Backtracking | 64.5% | 50.0% | all |
| 259 | 3Sum Smaller | Medium | Arrays | Sorting / Prefix / Scan | 51.4% | 50.0% | all |
| 780 | Reaching Points | Hard | Core DSA | Implementation / Reasoning | 34.4% | 50.0% | all |
| 78 | Subsets | Medium | Backtracking | Backtracking | 82.3% | 50.0% | all |
| 1202 | Smallest String With Swaps | Medium | Strings | Hashing / Sliding Window | 60.6% | 50.0% | all |
| 1209 | Remove All Adjacent Duplicates in String II | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 61.3% | 50.0% | all |
| 692 | Top K Frequent Words | Medium | Strings; Heap | Hashing / Sliding Window; Priority Queue | 60.2% | 50.0% | all |
| 1251 | Average Selling Price | Easy | Core DSA | Implementation / Reasoning | 37.3% | 50.0% | all |
| 4 | Median of Two Sorted Arrays | Hard | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 46.6% | 37.5% | all |
| 34 | Find First and Last Position of Element in Sorted Array | Medium | Arrays | Sorting / Prefix / Scan | 48.9% | 37.5% | all |
| 88 | Merge Sorted Array | Easy | Arrays | Sorting / Prefix / Scan | 54.9% | 37.5% | all |
| 152 | Maximum Product Subarray | Medium | Arrays | Sorting / Prefix / Scan | 36.4% | 37.5% | all |
| 242 | Valid Anagram | Easy | Strings | Hashing / Sliding Window | 68.1% | 37.5% | all |
| 2366 | Minimum Replacements to Sort the Array | Hard | Arrays | Sorting / Prefix / Scan | 53.1% | 37.5% | all |
| 68 | Text Justification | Hard | Core DSA | Implementation / Reasoning | 51.2% | 37.5% | all |
| 355 | Design Twitter | Medium | Design | Data Structure Design | 44.7% | 37.5% | all |
| 215 | Kth Largest Element in an Array | Medium | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 68.9% | 37.5% | all |
| 1671 | Minimum Number of Removals to Make Mountain Array | Hard | Arrays | Sorting / Prefix / Scan | 54.8% | 37.5% | all |
| 1963 | Minimum Number of Swaps to Make the String Balanced | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 78.0% | 37.5% | all |
| 2491 | Divide Players Into Teams of Equal Skill | Medium | Core DSA | Implementation / Reasoning | 68.9% | 37.5% | all |
| 41 | First Missing Positive | Hard | Arrays | Sorting / Prefix / Scan | 42.9% | 37.5% | all |
| 1669 | Merge In Between Linked Lists | Medium | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 83.0% | 37.5% | all |
| 2697 | Lexicographically Smallest Palindrome | Easy | Strings; Graphs | Hashing / Sliding Window; BFS / DFS / Topological Sort | 81.4% | 37.5% | all |
| 2625 | Flatten Deeply Nested Array | Medium | Arrays | Sorting / Prefix / Scan | 65.9% | 37.5% | all |
| 55 | Jump Game | Medium | Greedy | Greedy | 40.9% | 37.5% | all |
| 202 | Happy Number | Easy | Core DSA | Implementation / Reasoning | 59.7% | 37.5% | all |
| 207 | Course Schedule | Medium | Graphs | BFS / DFS / Topological Sort | 51.4% | 37.5% | all |
| 240 | Search a 2D Matrix II | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 57.3% | 37.5% | all |
| 1235 | Maximum Profit in Job Scheduling | Hard | Arrays | Sorting / Prefix / Scan | 54.7% | 37.5% | all |
| 124 | Binary Tree Maximum Path Sum | Hard | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 42.3% | 37.5% | all |
| 283 | Move Zeroes | Easy | Core DSA | Two Pointers | 63.8% | 37.5% | all |
| 994 | Rotting Oranges | Medium | Core DSA | Implementation / Reasoning | 58.7% | 37.5% | all |
| 24 | Swap Nodes in Pairs | Medium | Trees | DFS / BFS | 69.5% | 37.5% | all |
| 1268 | Search Suggestions System | Medium | Binary Search | Binary Search | 65.2% | 37.5% | all |
| 1839 | Longest Substring Of All Vowels in Order | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 51.8% | 37.5% | all |
| 297 | Serialize and Deserialize Binary Tree | Hard | Trees; Design | DFS / BFS; Data Structure Design | 60.8% | 37.5% | all |
| 70 | Climbing Stairs | Easy | Dynamic Programming | State Transition | 54.1% | 37.5% | all |
| 1060 | Missing Element in Sorted Array | Medium | Arrays | Sorting / Prefix / Scan | 59.7% | 37.5% | all |
| 412 | Fizz Buzz | Easy | Core DSA | Implementation / Reasoning | 75.5% | 37.5% | all |
| 73 | Set Matrix Zeroes | Medium | Arrays | Sorting / Prefix / Scan | 62.9% | 37.5% | all |
| 1926 | Nearest Exit from Entrance in Maze | Medium | Core DSA | Implementation / Reasoning | 48.6% | 37.5% | all |
| 1854 | Maximum Population Year | Easy | Arrays | Sorting / Prefix / Scan | 64.1% | 37.5% | all |
| 1048 | Longest String Chain | Medium | Strings | Hashing / Sliding Window | 63.0% | 37.5% | all |
| 2858 | Minimum Edge Reversals So Every Node Is Reachable | Hard | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 59.5% | 37.5% | all |
| 57 | Insert Interval | Medium | Arrays | Sorting / Prefix / Scan | 45.2% | 37.5% | all |
| 123 | Best Time to Buy and Sell Stock III | Hard | Core DSA | Implementation / Reasoning | 53.7% | 37.5% | all |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 37.5% | all |
| 387 | First Unique Character in a String | Easy | Strings | Hashing / Sliding Window | 65.5% | 37.5% | all |
| 39 | Combination Sum | Medium | Arrays; Backtracking | Sorting / Prefix / Scan; Backtracking | 76.5% | 37.5% | all |