Intuit coding interview
questions, leaked.
73 problems reported across recent Intuit interviews. Top patterns: array, dynamic programming, string. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Intuit's assessment hits hard on arrays and dynamic programming. You're looking at 73 problems across their reported interviews, with arrays dominating at 46 appearances. The difficulty split is 16% easy, 64% medium, 20% hard. Most candidates grind the medium tier and hit a wall on greedy-DP hybrids or matrix traversals they didn't expect. If you blank on a hard array problem mid-assessment, StealthCoder solves it invisibly in seconds. Start with the patterns that show up most: array manipulation, DP state design, and string operations. You have less time than you think.
Top problems at Intuit
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Minimum Number of Taps to Open to Water a Garden | HARD | 100.0 | 51% | Array · Dynamic Programming · Greedy |
| 02 | Valid Parentheses | EASY | 95.2 | 42% | String · Stack |
| 03 | Course Schedule II | MEDIUM | 93.3 | 53% | Depth-First Search · Breadth-First Search · Graph |
| 04 | Most Profitable Path in a Tree | MEDIUM | 93.3 | 68% | Array · Tree · Depth-First Search |
| 05 | Maximum Product of Three Numbers | EASY | 91.3 | 45% | Array · Math · Sorting |
| 06 | LRU Cache | MEDIUM | 89.1 | 45% | Hash Table · Linked List · Design |
| 07 | Maximum Difference Score in a Grid | MEDIUM | 86.8 | 47% | Array · Dynamic Programming · Matrix |
| 08 | Maximum Total Beauty of the Gardens | HARD | 86.8 | 30% | Array · Two Pointers · Binary Search |
| 09 | Max Area of Island | MEDIUM | 86.8 | 73% | Array · Depth-First Search · Breadth-First Search |
| 10 | Destroy Sequential Targets | MEDIUM | 86.8 | 41% | Array · Hash Table · Counting |
| 11 | Number of Distinct Substrings in a String | MEDIUM | 86.8 | 65% | String · Trie · Rolling Hash |
| 12 | Basic Calculator IV | HARD | 86.8 | 49% | Hash Table · Math · String |
| 13 | Make String Anti-palindrome | HARD | 86.8 | 42% | String · Greedy · Sorting |
| 14 | Length of the Longest Subsequence That Sums to Target | MEDIUM | 86.8 | 37% | Array · Dynamic Programming |
| 15 | Number of Substrings With Fixed Ratio | MEDIUM | 86.8 | 56% | Hash Table · Math · String |
| 16 | Sudoku Solver | HARD | 84.1 | 64% | Array · Hash Table · Backtracking |
| 17 | Rotting Oranges | MEDIUM | 81.2 | 57% | Array · Breadth-First Search · Matrix |
| 18 | Product of Array Except Self | MEDIUM | 81.2 | 68% | Array · Prefix Sum |
| 19 | Coin Change | MEDIUM | 74.0 | 46% | Array · Dynamic Programming · Breadth-First Search |
| 20 | Plus One | EASY | 74.0 | 48% | Array · Math |
| 21 | Two Sum | EASY | 74.0 | 56% | Array · Hash Table |
| 22 | Logger Rate Limiter | EASY | 69.5 | 77% | Hash Table · Design · Data Stream |
| 23 | Spiral Matrix | MEDIUM | 69.5 | 54% | Array · Matrix · Simulation |
| 24 | Unique Email Addresses | EASY | 69.5 | 68% | Array · Hash Table · String |
| 25 | Word Break | MEDIUM | 69.5 | 48% | Array · Hash Table · String |
| 26 | Russian Doll Envelopes | HARD | 63.9 | 37% | Array · Binary Search · Dynamic Programming |
| 27 | 3Sum | MEDIUM | 63.9 | 37% | Array · Two Pointers · Sorting |
| 28 | Min Stack | MEDIUM | 63.9 | 56% | Stack · Design |
| 29 | Heaters | MEDIUM | 63.9 | 40% | Array · Two Pointers · Binary Search |
| 30 | Longest Increasing Subsequence | MEDIUM | 63.9 | 58% | Array · Binary Search · Dynamic Programming |
| 31 | Top K Frequent Elements | MEDIUM | 63.9 | 65% | Array · Hash Table · Divide and Conquer |
| 32 | House Robber | MEDIUM | 63.9 | 52% | Array · Dynamic Programming |
| 33 | 132 Pattern | MEDIUM | 56.8 | 34% | Array · Binary Search · Stack |
| 34 | Middle of the Linked List | EASY | 56.8 | 81% | Linked List · Two Pointers |
| 35 | Group Anagrams | MEDIUM | 56.8 | 71% | Array · Hash Table · String |
| 36 | Trapping Rain Water | HARD | 56.8 | 65% | Array · Two Pointers · Dynamic Programming |
| 37 | Minimum Cost For Tickets | MEDIUM | 56.8 | 67% | Array · Dynamic Programming |
| 38 | Best Time to Buy and Sell Stock | EASY | 56.8 | 55% | Array · Dynamic Programming |
| 39 | Daily Temperatures | MEDIUM | 56.8 | 67% | Array · Stack · Monotonic Stack |
| 40 | Minimum Limit of Balls in a Bag | MEDIUM | 46.9 | 67% | Array · Binary Search |
| 41 | Employee Free Time | HARD | 46.9 | 73% | Array · Line Sweep · Sorting |
| 42 | Climbing Stairs | EASY | 46.9 | 54% | Math · Dynamic Programming · Memoization |
| 43 | Number of Operations to Make Network Connected | MEDIUM | 46.9 | 65% | Depth-First Search · Breadth-First Search · Union Find |
| 44 | Get the Maximum Score | HARD | 46.9 | 40% | Array · Two Pointers · Dynamic Programming |
| 45 | Longest Substring Without Repeating Characters | MEDIUM | 46.9 | 37% | Hash Table · String · Sliding Window |
| 46 | Longest Valid Parentheses | HARD | 46.9 | 36% | String · Dynamic Programming · Stack |
| 47 | Number of Longest Increasing Subsequence | MEDIUM | 46.9 | 50% | Array · Dynamic Programming · Binary Indexed Tree |
| 48 | Design Circular Queue | MEDIUM | 46.9 | 53% | Array · Linked List · Design |
| 49 | Maximal Rectangle | HARD | 46.9 | 54% | Array · Dynamic Programming · Stack |
| 50 | Zigzag Conversion | MEDIUM | 46.9 | 52% | String |
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 Intuit OA. The proctor cannot see it. Screen share cannot detect it. Made for the engineer who has done the work but might still blank with a webcam pointed at him.
Get StealthCoder- array46 · 63%
- dynamic programming20 · 27%
- string16 · 22%
- hash table16 · 22%
- breadth first search12 · 16%
- sorting12 · 16%
- stack11 · 15%
- depth first search9 · 12%
- matrix9 · 12%
- two pointers9 · 12%
Arrays aren't just the most frequent topic; they're woven into almost every other pattern. Dynamic programming appears 20 times, often paired with arrays or grids. Strings show up 16 times, mostly through hash tables and stack-based validation. The top problems tell you what Intuit actually cares about: LRU Cache (design under constraints), Max Area of Island (matrix DFS/BFS), and Minimum Number of Taps (DP with greedy insight). Medium problems dominate, which means you can't coast on easy solutions. The hard tier includes multi-constraint problems like Maximum Total Beauty of the Gardens that require two-pointer and binary-search chaining. If you haven't drilled the interaction between sorting, prefix sums, and greedy choices, StealthCoder becomes your safety net for whatever pattern doesn't click live.
Companies with similar patterns
If you prepped for Intuit, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Intuit.
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 for the engineer who has done the work but might still blank with a webcam pointed at him. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Intuit interview FAQ
How much time should I spend drilling arrays before my Intuit assessment?+
Arrays appear in 46 of 73 problems, so they're non-negotiable. Drill array fundamentals first: prefix sums, two-pointer logic, matrix traversal. Then practice array-based DP problems like Maximum Difference Score in a Grid. Spend 60% of your prep on arrays, the rest distributed across DP, hash tables, and string work.
Is dynamic programming really that important for Intuit?+
Yes. DP appears 20 times and often combines with greedy or array manipulation. Problems like Minimum Number of Taps show DP isn't isolated; it pairs with greedy thinking. You need both textbook DP and the judgment to recognize when greedy beats brute force. That hybrid skill is where most candidates fail.
What should I focus on first if I have one week?+
Arrays and strings in the first 3 days. Then stack-based problems like Valid Parentheses and hash-table design like LRU Cache. Save hard problems for day 5 and 6. Day 7 is review and mental sharpening, not new patterns. The medium tier is where you'll spend most of the assessment, so nail those first.
Are easy problems worth practicing for Intuit?+
Easy problems make up only 12 of 73 total. Don't ignore them, but don't camp there either. Treat them as speed warm-ups. You need them to build confidence, but Intuit's difficulty is medium and hard. Spend maybe 10% of prep time on easy, the rest on medium and hard.
What's the hardest topic combination I'll see?+
Problems that blend array, DP, and greedy logic like Minimum Number of Taps or two-pointer with binary search like Maximum Total Beauty. These require you to recognize the pattern quickly and code it without errors under pressure. If you hit one and freeze, you need a backup plan. That's what matters when the assessment is live.