79 curated coding interview questions directly asked in Cisco technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 100.0% | all |
| 198 | House Robber | Medium | Dynamic Programming | State Transition | 53.2% | 100.0% | all |
| 2603 | Collect Coins in a Tree | Hard | Trees; Dynamic Programming | DFS / BFS; State Transition | 40.1% | 100.0% | all |
| 48 | Rotate Image | Medium | Arrays | Sorting / Prefix / Scan | 80.1% | 87.5% | all |
| 54 | Spiral Matrix | Medium | Arrays | Sorting / Prefix / Scan | 56.8% | 87.5% | all |
| 212 | Word Search II | Hard | Strings; Binary Search | Hashing / Sliding Window; Binary Search | 38.5% | 87.5% | all |
| 1380 | Lucky Numbers in a Matrix | Easy | Arrays | Sorting / Prefix / Scan | 80.0% | 87.5% | all |
| 53 | Maximum Subarray | Medium | Arrays | Sorting / Prefix / Scan | 53.3% | 75.0% | all |
| 2047 | Number of Valid Words in a Sentence | Easy | Strings | Hashing / Sliding Window | 31.2% | 75.0% | all |
| 2081 | Sum of k-Mirror Numbers | Hard | Arrays | Sorting / Prefix / Scan | 63.6% | 75.0% | all |
| 2067 | Number of Equal Count Substrings | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 45.5% | 75.0% | all |
| 3047 | Find the Largest Area of Square Inside Two Rectangles | Medium | Core DSA | Implementation / Reasoning | 66.9% | 75.0% | all |
| 412 | Fizz Buzz | Easy | Core DSA | Implementation / Reasoning | 75.5% | 75.0% | all |
| 2448 | Minimum Cost to Make Array Equal | Hard | Arrays | Sorting / Prefix / Scan | 46.8% | 75.0% | all |
| 1784 | Check if Binary String Has at Most One Segment of Ones | Easy | Strings | Hashing / Sliding Window | 49.1% | 75.0% | all |
| 2986 | Find Third Transaction | Medium | Core DSA | Implementation / Reasoning | 54.0% | 75.0% | all |
| 3508 | Implement Router | Medium | Core DSA | Implementation / Reasoning | 39.1% | 75.0% | all |
| 3607 | Power Grid Maintenance | Medium | Core DSA | Implementation / Reasoning | 56.2% | 75.0% | all |
| 2 | Add Two Numbers | Medium | Core DSA | Implementation / Reasoning | 48.5% | 62.5% | all |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 62.5% | all |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 62.5% | all |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 62.5% | all |
| 2016 | Maximum Difference Between Increasing Elements | Easy | Arrays | Sorting / Prefix / Scan | 66.6% | 62.5% | all |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 62.5% | all |
| 72 | Edit Distance | Medium | Dynamic Programming | State Transition | 60.6% | 62.5% | all |
| 1443 | Minimum Time to Collect All Apples in a Tree | Medium | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 63.7% | 62.5% | all |
| 498 | Diagonal Traverse | Medium | Core DSA | Implementation / Reasoning | 67.2% | 62.5% | all |
| 3648 | Minimum Sensors to Cover Grid | Medium | Arrays | Sorting / Prefix / Scan | 68.8% | 62.5% | all |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 50.0% | all |
| 15 | 3Sum | Medium | Arrays | Sorting / Prefix / Scan | 39.1% | 50.0% | all |
| 88 | Merge Sorted Array | Easy | Arrays | Sorting / Prefix / Scan | 54.9% | 50.0% | all |
| 121 | Best Time to Buy and Sell Stock | Easy | Core DSA | Implementation / Reasoning | 56.8% | 50.0% | all |
| 141 | Linked List Cycle | Easy | Linked List | Two Pointers | 54.3% | 50.0% | all |
| 149 | Max Points on a Line | Hard | Core DSA | Implementation / Reasoning | 30.7% | 50.0% | all |
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 50.0% | all |
| 202 | Happy Number | Easy | Core DSA | Implementation / Reasoning | 59.7% | 50.0% | all |
| 283 | Move Zeroes | Easy | Core DSA | Two Pointers | 63.8% | 50.0% | all |
| 380 | Insert Delete GetRandom O(1) | Medium | Core DSA | Implementation / Reasoning | 55.4% | 50.0% | all |
| 394 | Decode String | Medium | Strings; Dynamic Programming; Stack / Queue | Hashing / Sliding Window; State Transition; Monotonic Stack / Simulation | 62.6% | 50.0% | all |
| 49 | Group Anagrams | Medium | Strings | Hashing / Sliding Window | 72.6% | 50.0% | all |
| 55 | Jump Game | Medium | Greedy | Greedy | 40.9% | 50.0% | all |
| 151 | Reverse Words in a String | Medium | Strings | Hashing / Sliding Window | 56.4% | 50.0% | all |
| 128 | Longest Consecutive Sequence | Medium | Core DSA | Implementation / Reasoning | 47.1% | 50.0% | all |
| 125 | Valid Palindrome | Easy | Strings | Hashing / Sliding Window | 53.3% | 50.0% | all |
| 26 | Remove Duplicates from Sorted Array | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 62.8% | 50.0% | all |
| 17 | Letter Combinations of a Phone Number | Medium | Strings; Backtracking | Hashing / Sliding Window; Backtracking | 66.1% | 50.0% | all |
| 253 | Meeting Rooms II | Medium | Greedy | Greedy | 52.7% | 50.0% | all |
| 25 | Reverse Nodes in k-Group | Hard | Trees; Linked List | DFS / BFS; Two Pointers | 66.1% | 50.0% | all |
| 486 | Predict the Winner | Medium | Core DSA | Implementation / Reasoning | 56.2% | 50.0% | all |
| 79 | Word Search | Medium | Strings; Binary Search | Hashing / Sliding Window; Binary Search | 47.4% | 50.0% | all |
| 23 | Merge k Sorted Lists | Hard | Arrays; Linked List; Heap | Sorting / Prefix / Scan; Two Pointers; Priority Queue | 59.6% | 37.5% | all |
| 206 | Reverse Linked List | Easy | Linked List | Two Pointers | 80.6% | 37.5% | all |
| 647 | Palindromic Substrings | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 72.8% | 37.5% | all |
| 909 | Snakes and Ladders | Medium | Core DSA | Implementation / Reasoning | 48.1% | 37.5% | all |
| 1606 | Find Servers That Handled Most Number of Requests | Hard | Core DSA | Implementation / Reasoning | 45.4% | 37.5% | all |
| 2719 | Count of Integers | Hard | Core DSA | Implementation / Reasoning | 38.6% | 37.5% | all |
| 136 | Single Number | Easy | Core DSA | Implementation / Reasoning | 77.7% | 37.5% | all |
| 567 | Permutation in String | Medium | Strings; Backtracking | Hashing / Sliding Window; Sliding Window; Backtracking | 48.9% | 37.5% | all |
| 230 | Kth Smallest Element in a BST | Medium | Trees; Heap | DFS / BFS; Priority Queue | 76.8% | 37.5% | all |
| 560 | Subarray Sum Equals K | Medium | Arrays | Sorting / Prefix / Scan | 47.3% | 37.5% | all |
| 46 | Permutations | Medium | Backtracking | Backtracking | 81.9% | 37.5% | all |
| 605 | Can Place Flowers | Easy | Core DSA | Implementation / Reasoning | 29.1% | 37.5% | all |
| 197 | Rising Temperature | Easy | Core DSA | Implementation / Reasoning | 51.3% | 37.5% | all |
| 239 | Sliding Window Maximum | Hard | Arrays | Sorting / Prefix / Scan; Sliding Window | 48.8% | 37.5% | all |
| 653 | Two Sum IV - Input is a BST | Easy | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS; Two Pointers | 63.3% | 37.5% | all |
| 81 | Search in Rotated Sorted Array II | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 40.1% | 37.5% | all |
| 33 | Search in Rotated Sorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 44.9% | 37.5% | all |
| 75 | Sort Colors | Medium | Arrays | Sorting / Prefix / Scan | 69.6% | 37.5% | all |
| 50 | Pow(x, n) | Medium | Core DSA | Implementation / Reasoning | 38.7% | 37.5% | all |
| 1290 | Convert Binary Number in a Linked List to Integer | Easy | Linked List | Two Pointers | 82.4% | 37.5% | all |
| 287 | Find the Duplicate Number | Medium | Arrays | Sorting / Prefix / Scan | 64.3% | 37.5% | all |
| 273 | Integer to English Words | Hard | Strings | Hashing / Sliding Window | 35.0% | 37.5% | all |
| 642 | Design Search Autocomplete System | Hard | Binary Search; Design | Binary Search; Data Structure Design | 50.0% | 37.5% | all |
| 236 | Lowest Common Ancestor of a Binary Tree | Medium | Trees | DFS / BFS | 69.3% | 37.5% | all |
| 76 | Minimum Window Substring | Hard | Arrays; Strings; Trees | Sorting / Prefix / Scan; Hashing / Sliding Window; DFS / BFS; Sliding Window | 47.5% | 37.5% | all |
| 1143 | Longest Common Subsequence | Medium | Core DSA | Implementation / Reasoning | 59.2% | 37.5% | all |
| 84 | Largest Rectangle in Histogram | Hard | Core DSA | Implementation / Reasoning | 49.9% | 37.5% | all |
| 1047 | Remove All Adjacent Duplicates In String | Easy | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 73.2% | 37.5% | all |
| 809 | Expressive Words | Medium | Strings | Hashing / Sliding Window | 46.8% | 37.5% | all |