Applied Intuition coding interview
questions, leaked.
12 problems reported across recent Applied Intuition interviews. Top patterns: array, matrix, sorting. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Applied Intuition's assessment is array-heavy and skews medium-to-hard. Twelve problems, mostly around array and matrix manipulation, with sorting and design patterns woven in. You'll see interval merging, grid traversal, and 2D range queries. One easy problem won't save you. The real challenge is speed on medium problems that look simple until you hit edge cases. If you freeze mid-OA on a matrix traversal or prefix-sum design problem, StealthCoder runs invisibly and surfaces a working solution in seconds.
Top problems at Applied Intuition
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Merge Intervals | MEDIUM | 100.0 | 49% | Array · Sorting |
| 02 | Minesweeper | MEDIUM | 96.9 | 68% | Array · Depth-First Search · Breadth-First Search |
| 03 | Find Duplicate File in System | MEDIUM | 93.3 | 68% | Array · Hash Table · String |
| 04 | Shortest Distance from All Buildings | HARD | 89.0 | 44% | Array · Breadth-First Search · Matrix |
| 05 | Best Meeting Point | HARD | 89.0 | 61% | Array · Math · Sorting |
| 06 | Word Abbreviation | HARD | 89.0 | 62% | Array · String · Greedy |
| 07 | Find First and Last Position of Element in Sorted Array | MEDIUM | 77.0 | 47% | Array · Binary Search |
| 08 | Range Sum Query 2D - Immutable | MEDIUM | 67.5 | 57% | Array · Design · Matrix |
| 09 | Design Circular Queue | MEDIUM | 67.5 | 53% | Array · Linked List · Design |
| 10 | Cyclically Rotating a Grid | MEDIUM | 67.5 | 50% | Array · Matrix · Simulation |
| 11 | Maximum Number of Visible Points | HARD | 67.5 | 38% | Array · Math · Geometry |
| 12 | Design HashMap | EASY | 67.5 | 66% | Array · Hash Table · Linked List |
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 Applied Intuition OA. The proctor cannot see it. Screen share cannot detect it. Built by an Amazon engineer who used it to pass JPMorgan's OA and system design loop.
Get StealthCoder- array12 · 100%
- matrix5 · 42%
- sorting4 · 33%
- design3 · 25%
- breadth first search2 · 17%
- hash table2 · 17%
- string2 · 17%
- math2 · 17%
- linked list2 · 17%
- binary search1 · 8%
Arrays show up in all 12 problems, which means you can't afford weak fundamentals here. Matrices are the second major pattern with five problems, most in the medium range. Sorting appears in four problems and often combines with array manipulation, so understand both merge-sort complexity and when to use quicksort. Design patterns (hash map, circular queue, 2D range query) account for three problems and require you to think about data structure tradeoffs, not just algorithms. Breadth-first search and binary search are low-frequency but appear in hard problems, so don't skip them. The hard tier (four problems) tests your ability to combine multiple concepts: BFS with matrix, math with sorting, greedy with string abbreviation. StealthCoder is your hedge if you encounter a hard design problem you haven't drilled enough.
Companies with similar patterns
If you prepped for Applied Intuition, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Applied Intuition.
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. Built by an Amazon engineer who used it to pass JPMorgan's OA and system design loop. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Applied Intuition interview FAQ
How many array problems should I solve before the OA?+
Applied Intuition hits arrays in every problem, so you need mastery, not just familiarity. Drill at least 15 to 20 array problems, focusing on two-pointer, sliding window, and prefix-sum patterns. Since five of their problems involve matrices, make sure half your practice includes 2D array manipulation.
Should I study matrix problems first?+
Yes. Five of twelve problems involve matrices, and three appear in the medium range. Minesweeper and grid rotation are common Applied Intuition patterns. Start with matrix traversal (BFS and DFS), then move to range-query problems. This gives you confidence early.
How much time should I spend on design problems?+
Design accounts for three problems here. Don't skip them. Spend a week on hash maps, queues, and 2D prefix-sum structures. Understand trade-offs between insertion, deletion, and lookup time. Applied Intuition tests whether you can build efficient data structures, not just use them.
Is one easy problem enough to warm up on?+
No. Design HashMap is the only easy problem, and the other eleven jump to medium and hard. Use it to calibrate your environment and get a quick win, but don't spend more than five minutes. Go hard immediately after.
What if I blank on a matrix or BFS problem during the OA?+
That's where preparation meets reality. You've drilled sorting and arrays, but a hard problem like Shortest Distance from All Buildings might require BFS layering you haven't seen before. If you hit a wall, you'll have a few minutes to think or move on. That's what StealthCoder covers: invisible real-time solutions when you've hit your ceiling.