DSA Doctor
Verified Company Vault
Intuit DSA Interview Questions
70 curated coding interview questions directly asked in Intuit technical rounds, sorted by frequency with recency and difficulty diagnostics.
70
Total Questions
11 (16%)
Easy Problems
43 (61%)
Medium Problems
16 (23%)
Hard Problems
🔥 Most Tested Topics:
Core DSA (18)Arrays (15)Strings (12)Dynamic Programming (7)Stack / Queue (6)
📂 Sourced Datasets:
Last 3 monthsLast 6 monthsAll questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 322 | Coin Change | Medium | Dynamic Programming | State Transition | 48.4% | 100.0% | 3m |
| 772 | Basic Calculator III | Hard | Stack / Queue | Monotonic Stack / Simulation | 53.3% | 100.0% | 3m |
| 664 | Strange Printer | Hard | Core DSA | Implementation / Reasoning | 60.9% | 100.0% | 6m |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 87.5% | 3m |
| 3719 | Longest Balanced Subarray I | Medium | Arrays | Sorting / Prefix / Scan | 65.6% | 87.5% | 6m |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 87.5% | all |
| 2467 | Most Profitable Path in a Tree | Medium | Trees | DFS / BFS | 67.3% | 87.5% | all |
| 628 | Maximum Product of Three Numbers | Easy | Arrays | Sorting / Prefix / Scan | 45.9% | 87.5% | all |
| 1411 | Number of Ways to Paint N × 3 Grid | Hard | Core DSA | Implementation / Reasoning | 80.5% | 75.0% | 6m |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 75.0% | 6m |
| 3148 | Maximum Difference Score in a Grid | Medium | Arrays | Sorting / Prefix / Scan | 48.1% | 75.0% | 6m |
| 2812 | Find the Safest Path in a Grid | Medium | Core DSA | Implementation / Reasoning | 48.8% | 75.0% | 6m |
| 647 | Palindromic Substrings | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 72.8% | 75.0% | 6m |
| 2915 | Length of the Longest Subsequence That Sums to Target | Medium | Arrays | Sorting / Prefix / Scan | 39.8% | 75.0% | all |
| 994 | Rotting Oranges | Medium | Core DSA | Implementation / Reasoning | 58.7% | 75.0% | all |
| 2234 | Maximum Total Beauty of the Gardens | Hard | Arrays | Sorting / Prefix / Scan | 30.2% | 75.0% | all |
| 3088 | Make String Anti-palindrome | Hard | Strings | Hashing / Sliding Window | 47.0% | 75.0% | all |
| 2453 | Destroy Sequential Targets | Medium | Core DSA | Implementation / Reasoning | 42.0% | 75.0% | all |
| 2489 | Number of Substrings With Fixed Ratio | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 57.1% | 75.0% | all |
| 695 | Max Area of Island | Medium | Graphs | BFS / DFS / Topological Sort | 74.0% | 75.0% | all |
| 770 | Basic Calculator IV | Hard | Stack / Queue | Monotonic Stack / Simulation | 49.8% | 75.0% | all |
| 1698 | Number of Distinct Substrings in a String | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 64.8% | 75.0% | all |
| 66 | Plus One | Easy | Core DSA | Implementation / Reasoning | 50.0% | 75.0% | all |
| 3619 | Count Islands With Total Value Divisible by K | Medium | Graphs | BFS / DFS / Topological Sort | 56.2% | 75.0% | all |
| 37 | Sudoku Solver | Hard | Backtracking | Backtracking | 65.5% | 62.5% | all |
| 139 | Word Break | Medium | Strings; Dynamic Programming | Hashing / Sliding Window; State Transition | 49.5% | 62.5% | all |
| 210 | Course Schedule II | Medium | Graphs | BFS / DFS / Topological Sort | 55.5% | 62.5% | all |
| 359 | Logger Rate Limiter | Easy | Design | Data Structure Design | 76.8% | 62.5% | all |
| 739 | Daily Temperatures | Medium | Stack / Queue | Monotonic Stack / Simulation | 68.7% | 62.5% | all |
| 22 | Generate Parentheses | Medium | Strings | Hashing / Sliding Window | 78.7% | 50.0% | all |
| 49 | Group Anagrams | Medium | Strings | Hashing / Sliding Window | 72.6% | 50.0% | all |
| 198 | House Robber | Medium | Dynamic Programming | State Transition | 53.2% | 50.0% | all |
| 300 | Longest Increasing Subsequence | Medium | Dynamic Programming | State Transition | 59.4% | 50.0% | all |
| 347 | Top K Frequent Elements | Medium | Heap | Priority Queue | 66.4% | 50.0% | all |
| 929 | Unique Email Addresses | Easy | Core DSA | Implementation / Reasoning | 67.9% | 50.0% | all |
| 354 | Russian Doll Envelopes | Hard | Core DSA | Implementation / Reasoning | 37.9% | 50.0% | all |
| 32 | Longest Valid Parentheses | Hard | Strings | Hashing / Sliding Window | 38.8% | 50.0% | all |
| 125 | Valid Palindrome | Easy | Strings | Hashing / Sliding Window | 53.3% | 50.0% | all |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 50.0% | all |
| 1931 | Painting a Grid With Three Different Colors | Hard | Core DSA | Implementation / Reasoning | 77.1% | 50.0% | all |
| 493 | Reverse Pairs | Hard | Core DSA | Implementation / Reasoning | 34.2% | 50.0% | all |
| 983 | Minimum Cost For Tickets | Medium | Arrays | Sorting / Prefix / Scan | 67.4% | 37.5% | all |
| 54 | Spiral Matrix | Medium | Arrays | Sorting / Prefix / Scan | 56.8% | 37.5% | all |
| 121 | Best Time to Buy and Sell Stock | Easy | Core DSA | Implementation / Reasoning | 56.8% | 37.5% | all |
| 155 | Min Stack | Medium | Stack / Queue | Monotonic Stack / Simulation | 58.2% | 37.5% | all |
| 238 | Product of Array Except Self | Medium | Arrays | Sorting / Prefix / Scan | 68.9% | 37.5% | all |
| 876 | Middle of the Linked List | Easy | Linked List | Two Pointers | 81.8% | 37.5% | all |
| 1319 | Number of Operations to Make Network Connected | Medium | Graphs | BFS / DFS / Topological Sort | 66.5% | 37.5% | all |
| 622 | Design Circular Queue | Medium | Stack / Queue; Design | Monotonic Stack / Simulation; Data Structure Design | 54.7% | 37.5% | all |
| 1537 | Get the Maximum Score | Hard | Arrays | Sorting / Prefix / Scan | 41.1% | 37.5% | all |
| 673 | Number of Longest Increasing Subsequence | Medium | Dynamic Programming | State Transition | 51.9% | 37.5% | all |
| 6 | Zigzag Conversion | Medium | Core DSA | Implementation / Reasoning | 54.2% | 37.5% | all |
| 85 | Maximal Rectangle | Hard | Core DSA | Implementation / Reasoning | 58.8% | 37.5% | all |
| 215 | Kth Largest Element in an Array | Medium | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 68.9% | 37.5% | all |
| 1760 | Minimum Limit of Balls in a Bag | Medium | Arrays | Sorting / Prefix / Scan | 66.3% | 37.5% | all |
| 236 | Lowest Common Ancestor of a Binary Tree | Medium | Trees | DFS / BFS | 69.3% | 37.5% | all |
| 31 | Next Permutation | Medium | Backtracking | Backtracking | 45.3% | 37.5% | all |
| 283 | Move Zeroes | Easy | Core DSA | Two Pointers | 63.8% | 37.5% | all |
| 503 | Next Greater Element II | Medium | Stack / Queue | Monotonic Stack / Simulation | 68.4% | 37.5% | all |
| 759 | Employee Free Time | Hard | Core DSA | Implementation / Reasoning | 72.9% | 37.5% | all |
| 1647 | Minimum Deletions to Make Character Frequencies Unique | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 61.5% | 37.5% | all |
| 91 | Decode Ways | Medium | Dynamic Programming | State Transition | 38.0% | 37.5% | all |
| 787 | Cheapest Flights Within K Stops | Medium | Heap | Priority Queue | 41.8% | 37.5% | all |
| 1091 | Shortest Path in Binary Matrix | Medium | Arrays | Sorting / Prefix / Scan | 51.5% | 37.5% | all |
| 295 | Find Median from Data Stream | Hard | Heap | Priority Queue | 54.5% | 37.5% | all |
| 380 | Insert Delete GetRandom O(1) | Medium | Core DSA | Implementation / Reasoning | 55.4% | 37.5% | all |
| 465 | Optimal Account Balancing | Hard | Core DSA | Implementation / Reasoning | 50.5% | 37.5% | all |
| 468 | Validate IP Address | Medium | Strings | Hashing / Sliding Window | 28.3% | 37.5% | all |
| 729 | My Calendar I | Medium | Core DSA | Implementation / Reasoning | 58.3% | 37.5% | all |
| 70 | Climbing Stairs | Easy | Dynamic Programming | State Transition | 54.1% | 37.5% | all |