Intuit LeetCode Questions
73 questions all-time · 12 easy · 47 medium · 14 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Minimum Number of Taps to Open to Water a Garden Array, Dynamic Programming, Greedy | Hard | 100 | 50.7% |
| 2 | Valid Parentheses String, Stack | Easy | 95 | 42.3% |
| 3 | Course Schedule II Depth-First Search, Breadth-First Search, Graph, Topological Sort | Medium | 93 | 53.4% |
| 4 | Most Profitable Path in a Tree Array, Tree, Depth-First Search, Breadth-First Search, Graph | Medium | 93 | 67.6% |
| 5 | Maximum Product of Three Numbers Array, Math, Sorting | Easy | 91 | 45.3% |
| 6 | LRU Cache Hash Table, Linked List, Design, Doubly-Linked List | Medium | 89 | 45.2% |
| 7 | Max Area of Island Array, Depth-First Search, Breadth-First Search, Union Find, Matrix | Medium | 87 | 73.2% |
| 8 | Number of Substrings With Fixed Ratio Hash Table, Math, String, Prefix Sum | Medium | 87 | 55.9% |
| 9 | Maximum Total Beauty of the Gardens Array, Two Pointers, Binary Search, Greedy, Sorting, Enumeration, Prefix Sum | Hard | 87 | 30.0% |
| 10 | Destroy Sequential Targets Array, Hash Table, Counting | Medium | 87 | 40.6% |
| 11 | Length of the Longest Subsequence That Sums to Target Array, Dynamic Programming | Medium | 87 | 37.2% |
| 12 | Basic Calculator IV Hash Table, Math, String, Stack, Recursion | Hard | 87 | 48.7% |
| 13 | Number of Distinct Substrings in a String String, Trie, Rolling Hash, Suffix Array, Hash Function | Medium | 87 | 64.5% |
| 14 | Maximum Difference Score in a Grid Array, Dynamic Programming, Matrix | Medium | 87 | 46.7% |
| 15 | Make String Anti-palindrome String, Greedy, Sorting, Counting Sort | Hard | 87 | 42.5% |
| 16 | Sudoku Solver Array, Hash Table, Backtracking, Matrix | Hard | 84 | 63.9% |
| 17 | Rotting Oranges Array, Breadth-First Search, Matrix | Medium | 81 | 56.6% |
| 18 | Product of Array Except Self Array, Prefix Sum | Medium | 81 | 67.8% |
| 19 | Two Sum Array, Hash Table | Easy | 74 | 55.8% |
| 20 | Plus One Array, Math | Easy | 74 | 47.5% |
| 21 | Coin Change Array, Dynamic Programming, Breadth-First Search | Medium | 74 | 46.5% |
| 22 | Word Break Array, Hash Table, String, Dynamic Programming, Trie, Memoization | Medium | 70 | 48.3% |
| 23 | Logger Rate Limiter Hash Table, Design, Data Stream | Easy | 70 | 76.6% |
| 24 | Spiral Matrix Array, Matrix, Simulation | Medium | 70 | 53.9% |
| 25 | Unique Email Addresses Array, Hash Table, String | Easy | 70 | 67.6% |
| 26 | Heaters Array, Two Pointers, Binary Search, Sorting | Medium | 64 | 40.0% |
| 27 | Russian Doll Envelopes Array, Binary Search, Dynamic Programming, Sorting | Hard | 64 | 37.3% |
| 28 | Top K Frequent Elements Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect | Medium | 64 | 64.6% |
| 29 | Longest Increasing Subsequence Array, Binary Search, Dynamic Programming | Medium | 64 | 57.8% |
| 30 | 3Sum Array, Two Pointers, Sorting | Medium | 64 | 37.1% |
| 31 | House Robber Array, Dynamic Programming | Medium | 64 | 52.3% |
| 32 | Min Stack Stack, Design | Medium | 64 | 56.4% |
| 33 | Minimum Cost For Tickets Array, Dynamic Programming | Medium | 57 | 67.4% |
| 34 | Daily Temperatures Array, Stack, Monotonic Stack | Medium | 57 | 67.4% |
| 35 | 132 Pattern Array, Binary Search, Stack, Monotonic Stack, Ordered Set | Medium | 57 | 34.1% |
| 36 | Best Time to Buy and Sell Stock Array, Dynamic Programming | Easy | 57 | 55.3% |
| 37 | Middle of the Linked List Linked List, Two Pointers | Easy | 57 | 80.6% |
| 38 | Group Anagrams Array, Hash Table, String, Sorting | Medium | 57 | 70.9% |
| 39 | Trapping Rain Water Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack | Hard | 57 | 65.1% |
| 40 | Reorganize String Hash Table, String, Greedy, Sorting, Heap (Priority Queue), Counting | Medium | 47 | 56.2% |
| 41 | Decode String String, Stack, Recursion | Medium | 47 | 61.2% |
| 42 | Maximal Rectangle Array, Dynamic Programming, Stack, Matrix, Monotonic Stack | Hard | 47 | 53.7% |
| 43 | Minimum Limit of Balls in a Bag Array, Binary Search | Medium | 47 | 67.3% |
| 44 | Zigzag Conversion String | Medium | 47 | 51.6% |
| 45 | Kth Largest Element in an Array Array, Divide and Conquer, Sorting, Heap (Priority Queue), Quickselect | Medium | 47 | 68.0% |
| 46 | Employee Free Time Array, Line Sweep, Sorting, Heap (Priority Queue) | Hard | 47 | 72.6% |
| 47 | Lowest Common Ancestor of a Binary Tree Tree, Depth-First Search, Binary Tree | Medium | 47 | 66.8% |
| 48 | Next Permutation Array, Two Pointers | Medium | 47 | 43.1% |
| 49 | Move Zeroes Array, Two Pointers | Easy | 47 | 62.8% |
| 50 | Binary Tree Zigzag Level Order Traversal Tree, Breadth-First Search, Binary Tree | Medium | 47 | 61.7% |
| 51 | Binary Tree Maximum Path Sum Dynamic Programming, Tree, Depth-First Search, Binary Tree | Hard | 47 | 41.2% |
| 52 | Next Greater Element II Array, Stack, Monotonic Stack | Medium | 47 | 66.3% |
| 53 | Number of Islands Array, Depth-First Search, Breadth-First Search, Union Find, Matrix | Medium | 47 | 62.3% |
| 54 | Course Schedule Depth-First Search, Breadth-First Search, Graph, Topological Sort | Medium | 47 | 49.2% |
| 55 | Task Scheduler Array, Hash Table, Greedy, Sorting, Heap (Priority Queue), Counting | Medium | 47 | 61.5% |
| 56 | Number of Longest Increasing Subsequence Array, Dynamic Programming, Binary Indexed Tree, Segment Tree | Medium | 47 | 49.9% |
| 57 | Longest Valid Parentheses String, Dynamic Programming, Stack | Hard | 47 | 36.3% |
| 58 | Merge Two Sorted Lists Linked List, Recursion | Easy | 47 | 66.8% |
| 59 | Generate Parentheses String, Dynamic Programming, Backtracking | Medium | 47 | 77.1% |
| 60 | Binary Tree Level Order Traversal Tree, Breadth-First Search, Binary Tree | Medium | 47 | 70.6% |
| 61 | Palindrome Linked List Linked List, Two Pointers, Stack, Recursion | Easy | 47 | 55.9% |
| 62 | Insert Delete GetRandom O(1) Array, Hash Table, Math, Design, Randomized | Medium | 47 | 55.0% |
| 63 | Longest Substring Without Repeating Characters Hash Table, String, Sliding Window | Medium | 47 | 36.9% |
| 64 | Largest Plus Sign Array, Dynamic Programming | Medium | 47 | 48.6% |
| 65 | Find All Anagrams in a String Hash Table, String, Sliding Window | Medium | 47 | 52.2% |
| 66 | Median of Two Sorted Arrays Array, Binary Search, Divide and Conquer | Hard | 47 | 43.8% |
| 67 | Serialize and Deserialize Binary Tree String, Tree, Depth-First Search, Breadth-First Search, Design, Binary Tree | Hard | 47 | 59.0% |
| 68 | Climbing Stairs Math, Dynamic Programming, Memoization | Easy | 47 | 53.5% |
| 69 | Number of Operations to Make Network Connected Depth-First Search, Breadth-First Search, Union Find, Graph | Medium | 47 | 64.7% |
| 70 | Design Circular Queue Array, Linked List, Design, Queue | Medium | 47 | 52.6% |
| 71 | Get the Maximum Score Array, Two Pointers, Dynamic Programming, Greedy | Hard | 47 | 40.0% |
| 72 | Shortest Path in Binary Matrix Array, Breadth-First Search, Matrix | Medium | 47 | 49.8% |
| 73 | Minimum Falling Path Sum Array, Dynamic Programming, Matrix | Medium | 47 | 61.4% |
How to read this list
The tabs at the top split the questions by how recently people said they were asked in interviews. "Last 30 Days" is the past month, "Last 3 Months" is the past quarter, and so on. "All Time" is every question on record for this company.
Frequency is a score from 0 to 100 for how often a question showed up in that time window. A higher number means it came up more often, so the list starts with the most common questions first. Acceptance is the share of submissions that pass on LeetCode. Click any question to open it on LeetCode.