34 curated coding interview questions directly asked in Autodesk technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 100.0% | 3m |
| 68 | Text Justification | Hard | Core DSA | Implementation / Reasoning | 51.2% | 100.0% | 3m |
| 3069 | Distribute Elements Into Two Arrays I | Easy | Arrays | Sorting / Prefix / Scan | 74.0% | 100.0% | all |
| 3072 | Distribute Elements Into Two Arrays II | Hard | Arrays | Sorting / Prefix / Scan | 30.7% | 100.0% | all |
| 3034 | Number of Subarrays That Match a Pattern I | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 68.6% | 100.0% | all |
| 3036 | Number of Subarrays That Match a Pattern II | Hard | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 33.7% | 100.0% | all |
| 3045 | Count Prefix and Suffix Pairs II | Hard | Core DSA | Implementation / Reasoning | 28.4% | 100.0% | all |
| 3042 | Count Prefix and Suffix Pairs I | Easy | Core DSA | Implementation / Reasoning | 77.8% | 100.0% | all |
| 3019 | Number of Changing Keys | Easy | Core DSA | Implementation / Reasoning | 80.7% | 100.0% | all |
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 87.5% | 6m |
| 33 | Search in Rotated Sorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 44.9% | 75.0% | all |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 75.0% | all |
| 239 | Sliding Window Maximum | Hard | Arrays | Sorting / Prefix / Scan; Sliding Window | 48.8% | 62.5% | all |
| 4 | Median of Two Sorted Arrays | Hard | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 46.6% | 62.5% | all |
| 15 | 3Sum | Medium | Arrays | Sorting / Prefix / Scan | 39.1% | 62.5% | all |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 62.5% | all |
| 49 | Group Anagrams | Medium | Strings | Hashing / Sliding Window | 72.6% | 50.0% | all |
| 3161 | Block Placement Queries | Hard | Core DSA | Implementation / Reasoning | 18.7% | 50.0% | all |
| 238 | Product of Array Except Self | Medium | Arrays | Sorting / Prefix / Scan | 68.9% | 50.0% | all |
| 25 | Reverse Nodes in k-Group | Hard | Trees; Linked List | DFS / BFS; Two Pointers | 66.1% | 50.0% | all |
| 36 | Valid Sudoku | Medium | Strings; Backtracking | Hashing / Sliding Window; Backtracking | 64.5% | 50.0% | all |
| 169 | Majority Element | Easy | Core DSA | Implementation / Reasoning | 66.3% | 50.0% | all |
| 875 | Koko Eating Bananas | Medium | Binary Search | Binary Search | 50.0% | 50.0% | all |
| 53 | Maximum Subarray | Medium | Arrays | Sorting / Prefix / Scan | 53.3% | 50.0% | all |
| 73 | Set Matrix Zeroes | Medium | Arrays | Sorting / Prefix / Scan | 62.9% | 50.0% | all |
| 390 | Elimination Game | Medium | Core DSA | Implementation / Reasoning | 46.4% | 50.0% | all |
| 75 | Sort Colors | Medium | Arrays | Sorting / Prefix / Scan | 69.6% | 50.0% | all |
| 141 | Linked List Cycle | Easy | Linked List | Two Pointers | 54.3% | 50.0% | all |
| 54 | Spiral Matrix | Medium | Arrays | Sorting / Prefix / Scan | 56.8% | 50.0% | all |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 50.0% | all |
| 215 | Kth Largest Element in an Array | Medium | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 68.9% | 50.0% | all |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 50.0% | all |
| 139 | Word Break | Medium | Strings; Dynamic Programming | Hashing / Sliding Window; State Transition | 49.5% | 50.0% | all |
| 142 | Linked List Cycle II | Medium | Linked List | Two Pointers | 57.9% | 50.0% | all |