Autodesk coding interview
questions, leaked.
31 problems reported across recent Autodesk interviews. Top patterns: array, string, hash table. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Autodesk's coding assessment is array-heavy. Out of 31 problems in their reported question bank, 22 are array-focused, and nearly 60% land at medium difficulty. You're facing rolling hash, string matching, and sliding window problems that need to work the first time. If you hit a wall mid-assessment on a pattern you haven't drilled, StealthCoder runs invisibly behind the proctor's screen and surfaces a working solution in seconds. That's your safety net. Right now, though, you need to own the array fundamentals.
Top problems at Autodesk
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Number of Subarrays That Match a Pattern I | MEDIUM | 100.0 | 67% | Array · Rolling Hash · String Matching |
| 02 | Number of Changing Keys | EASY | 97.9 | 80% | String |
| 03 | Number of Subarrays That Match a Pattern II | HARD | 95.5 | 32% | Array · Rolling Hash · String Matching |
| 04 | Distribute Elements Into Two Arrays I | EASY | 95.5 | 73% | Array · Simulation |
| 05 | Distribute Elements Into Two Arrays II | HARD | 95.5 | 29% | Array · Binary Indexed Tree · Segment Tree |
| 06 | Count Prefix and Suffix Pairs I | EASY | 95.5 | 78% | Array · String · Trie |
| 07 | Count Prefix and Suffix Pairs II | HARD | 95.5 | 27% | Array · String · Trie |
| 08 | Group Anagrams | MEDIUM | 73.1 | 71% | Array · Hash Table · String |
| 09 | Sliding Window Maximum | HARD | 73.1 | 48% | Array · Queue · Sliding Window |
| 10 | Maximum Subarray | MEDIUM | 66.1 | 52% | Array · Divide and Conquer · Dynamic Programming |
| 11 | Combination Sum | MEDIUM | 66.1 | 75% | Array · Backtracking |
| 12 | Valid Parentheses | EASY | 66.1 | 42% | String · Stack |
| 13 | Search in Rotated Sorted Array | MEDIUM | 66.1 | 43% | Array · Binary Search |
| 14 | Majority Element | EASY | 56.3 | 66% | Array · Hash Table · Divide and Conquer |
| 15 | Koko Eating Bananas | MEDIUM | 56.3 | 49% | Array · Binary Search |
| 16 | Set Matrix Zeroes | MEDIUM | 56.3 | 61% | Array · Hash Table · Matrix |
| 17 | Median of Two Sorted Arrays | HARD | 56.3 | 44% | Array · Binary Search · Divide and Conquer |
| 18 | Elimination Game | MEDIUM | 56.3 | 45% | Math · Recursion |
| 19 | Sort Colors | MEDIUM | 56.3 | 68% | Array · Two Pointers · Sorting |
| 20 | Longest Increasing Subsequence | MEDIUM | 56.3 | 58% | Array · Binary Search · Dynamic Programming |
| 21 | Linked List Cycle | EASY | 56.3 | 53% | Hash Table · Linked List · Two Pointers |
| 22 | Reverse Nodes in k-Group | HARD | 56.3 | 63% | Linked List · Recursion |
| 23 | Restore IP Addresses | MEDIUM | 56.3 | 53% | String · Backtracking |
| 24 | Product of Array Except Self | MEDIUM | 56.3 | 68% | Array · Prefix Sum |
| 25 | Valid Sudoku | MEDIUM | 56.3 | 62% | Array · Hash Table · Matrix |
| 26 | Block Placement Queries | HARD | 56.3 | 17% | Array · Binary Search · Binary Indexed Tree |
| 27 | Letter Combinations of a Phone Number | MEDIUM | 56.3 | 64% | Hash Table · String · Backtracking |
| 28 | Longest Palindromic Substring | MEDIUM | 56.3 | 36% | Two Pointers · String · Dynamic Programming |
| 29 | 3Sum | MEDIUM | 56.3 | 37% | Array · Two Pointers · Sorting |
| 30 | Minimum Size Subarray Sum | MEDIUM | 56.3 | 49% | Array · Binary Search · Sliding Window |
| 31 | LRU Cache | MEDIUM | 56.3 | 45% | Hash Table · Linked List · Design |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Autodesk OA. The proctor cannot see it. Screen share cannot detect it. Made by an Amazon engineer who watched the leaked-problem repo become an industry secret. He decided you should have it too.
Get StealthCoder- array22 · 71%
- string8 · 26%
- hash table7 · 23%
- binary search6 · 19%
- rolling hash4 · 13%
- string matching4 · 13%
- hash function4 · 13%
- sorting4 · 13%
- two pointers4 · 13%
- divide and conquer3 · 10%
Arrays dominate Autodesk's interview loop by a factor of three over any other topic. String problems (8) and hash-table work (7) cluster around the medium-to-hard transition, often combined with rolling hash or prefix-matching patterns. Binary search appears frequently (6 problems), usually paired with array manipulation. The problem set splits cleanly: master array simulation, subarray logic, and rolling hash hashing in the next few days. String matching and hash functions are secondary but appear in the hardest problems. Most of the medium difficulty is where you'll spend your time. Hard problems (7 total) blend multiple tools; if you blank on a Trie or segment-tree variant during the live assessment, StealthCoder is your hedge.
Companies with similar patterns
If you prepped for Autodesk, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Autodesk.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Made by an Amazon engineer who watched the leaked-problem repo become an industry secret. He decided you should have it too. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Autodesk interview FAQ
How many array problems should I solve before the Autodesk assessment?+
All of them. Arrays make up 71% of the reported bank. Start with the EASY tier (Distribute Elements, Majority Element) to nail simulation and hash-table lookups, then move to medium subarray and rolling-hash problems. You have 22 problems to reference; work through at least 15 distinct array patterns.
Should I study rolling hash before the assessment?+
Yes. Rolling hash appears in 4 problems directly and underlies the hardest pattern-matching questions (Number of Subarrays I and II, Count Prefix and Suffix Pairs I and II). If you can't implement a rolling hash in under 5 minutes, drill it now. It's a multiplier for string-matching speed.
Are binary search and sliding window critical for Autodesk?+
Binary search appears 6 times, mostly paired with array problems (Search in Rotated Sorted Array, Koko Eating Bananas). Sliding window isn't explicitly tagged, but Sliding Window Maximum and subarray problems use the pattern. Both are medium-priority; they'll come up, but arrays and rolling hash are your core.
What's the breakdown by difficulty, and how should I time-box prep?+
6 EASY, 18 MEDIUM, 7 HARD out of 31 total. Spend 50% of your time on the medium tier (arrays, string matching, binary search combos). Lock down EASY problems in a day. Leave HARD for pattern recognition; don't memorize solutions. The assessment will test speed and correctness on medium problems first.
Do I need to learn Trie, segment trees, and binary indexed trees for this assessment?+
Only if you're aiming for the hardest problems. Trie and segment trees appear in 2-3 hard variants each (Count Prefix and Suffix Pairs II, Distribute Elements II). If time is short, focus on rolling hash, binary search, and array simulation. Hard-tier data structures are a hedge, not a core skill.