Disney coding interview
questions, leaked.
19 problems reported across recent Disney interviews. Top patterns: string, array, hash table. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Disney's coding interview hits you with 19 problems across two difficulty tiers, and almost all of them are medium. You're looking at string manipulation and array work as the backbone of what they ask, with hash-tables and dynamic programming filling the gaps. This is a heavy pattern-recognition round. The good news: no hard problems on the docket. The reality: you need speed and accuracy on medium-difficulty solutions. If you blank on a hash-table or DP problem during the live assessment, StealthCoder runs invisibly and surfaces a working solution in seconds, so you're never stuck.
Top problems at Disney
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | LRU Cache | MEDIUM | 100.0 | 45% | Hash Table · Linked List · Design |
| 02 | Ransom Note | EASY | 100.0 | 65% | Hash Table · String · Counting |
| 03 | Merge Intervals | MEDIUM | 100.0 | 49% | Array · Sorting |
| 04 | Remove All Adjacent Duplicates in String II | MEDIUM | 91.6 | 60% | String · Stack |
| 05 | Max Area of Island | MEDIUM | 91.6 | 73% | Array · Depth-First Search · Breadth-First Search |
| 06 | Generate Parentheses | MEDIUM | 91.6 | 77% | String · Dynamic Programming · Backtracking |
| 07 | Number of Islands | MEDIUM | 79.8 | 62% | Array · Depth-First Search · Breadth-First Search |
| 08 | Valid Anagram | EASY | 79.8 | 67% | Hash Table · String · Sorting |
| 09 | Search in Rotated Sorted Array | MEDIUM | 79.8 | 43% | Array · Binary Search |
| 10 | Valid Parentheses | EASY | 79.8 | 42% | String · Stack |
| 11 | Valid Word Abbreviation | EASY | 79.8 | 37% | Two Pointers · String |
| 12 | Egg Drop With 2 Eggs and N Floors | MEDIUM | 79.8 | 74% | Math · Dynamic Programming |
| 13 | Climbing Stairs | EASY | 79.8 | 54% | Math · Dynamic Programming · Memoization |
| 14 | Reverse Linked List II | MEDIUM | 79.8 | 50% | Linked List |
| 15 | Subarray Sum Equals K | MEDIUM | 79.8 | 45% | Array · Hash Table · Prefix Sum |
| 16 | Longest Palindromic Substring | MEDIUM | 79.8 | 36% | Two Pointers · String · Dynamic Programming |
| 17 | Group Anagrams | MEDIUM | 79.8 | 71% | Array · Hash Table · String |
| 18 | Longest Common Prefix | EASY | 79.8 | 45% | String · Trie |
| 19 | Product of Array Except Self | MEDIUM | 79.8 | 68% | Array · Prefix Sum |
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 Disney OA. The proctor cannot see it. Screen share cannot detect it. Made by a working Amazon engineer who got tired of watching qualified friends bomb OAs they'd solve cold in an IDE.
Get StealthCoder- string9 · 47%
- array7 · 37%
- hash table5 · 26%
- dynamic programming4 · 21%
- sorting3 · 16%
- stack2 · 11%
- linked list2 · 11%
- depth first search2 · 11%
- breadth first search2 · 11%
- union find2 · 11%
String and array problems dominate Disney's interview. Together they account for 16 of your 19 problems, so your prep time should front-load those two topics hard. Hash-tables come next at 5 problems. Dynamic programming shows up in 4, but don't sleep on it: Climbing Stairs, Generate Parentheses, and the egg-drop problem are classics that trip people up under time pressure. Problems like LRU Cache and Subarray Sum Equals K demand both speed and precision. Most of Disney's list skews medium, which means you can't half-know a pattern. You either solve it clean or you don't. Stack, linked-list, and graph problems (DFS, BFS, union-find) are lower frequency but still fair game. During your live OA, if you hit a wall on one of the trickier medium problems, StealthCoder is your hedge.
Companies with similar patterns
If you prepped for Disney, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Disney.
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 a working Amazon engineer who got tired of watching qualified friends bomb OAs they'd solve cold in an IDE. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Disney interview FAQ
How many string problems should I solve before the Disney OA?+
At least 9. String problems dominate their ask list. Focus on Valid Parentheses, Ransom Note, Valid Anagram, and Remove All Adjacent Duplicates in String II first. These four cover hash-tables, stacks, and character counting, which all repeat across their dataset.
Is dynamic programming critical for Disney?+
Yes, but not overwhelming. Four of 19 problems use DP: Climbing Stairs, Generate Parentheses, Egg Drop, and substring variants. Climbing Stairs is easy and a must-know. Generate Parentheses is medium and frequently asked. Drill those two first, then move to harder DP only if you have time.
What should I prioritize first, arrays or hash-tables?+
Arrays. Seven problems explicitly tag array, and many others involve array manipulation (Merge Intervals, Max Area of Island, Search in Rotated Sorted Array). Hash-table concepts nest inside array work. Solve array problems first, then layer in hash-table optimizations.
Are there any hard problems in Disney's list?+
No. All 19 problems are easy or medium. That's good news for time management. It means they're testing pattern recognition and clean execution, not extreme algorithmic depth. One solid week of focused drill gets you ready.
Should I study linked-list and graph algorithms heavily?+
No. Linked-list shows up twice (LRU Cache, Reverse Linked List II). DFS, BFS, and union-find each appear twice. They're not the focus. Spend 20 percent of your prep on these. String, array, and hash-table consume the other 80 percent.