Intuit Interview Questions — 73 DSA Problems

68 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Intuit LeetCode questions for software engineering interviews.

• Minimum Number of Taps to Open to Water a Garden (HARD) — Array, Dynamic Programming, Greedy
• Valid Parentheses (EASY) — String, Stack
• Course Schedule II (MEDIUM) — Depth-First Search, Breadth-First Search, Graph, Topological Sort
• Most Profitable Path in a Tree (MEDIUM) — Array, Tree, Depth-First Search, Breadth-First Search, Graph
• Maximum Product of Three Numbers (EASY) — Array, Math, Sorting
• LRU Cache (MEDIUM) — Hash Table, Linked List, Design, Doubly-Linked List
• Max Area of Island (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
• Number of Substrings With Fixed Ratio (MEDIUM) — Hash Table, Math, String, Prefix Sum
• Maximum Total Beauty of the Gardens (HARD) — Array, Two Pointers, Binary Search, Greedy, Sorting, Enumeration, Prefix Sum
• Destroy Sequential Targets (MEDIUM) — Array, Hash Table, Counting
• Length of the Longest Subsequence That Sums to Target (MEDIUM) — Array, Dynamic Programming
• Basic Calculator IV (HARD) — Hash Table, Math, String, Stack, Recursion
• Number of Distinct Substrings in a String (MEDIUM) — String, Trie, Rolling Hash, Suffix Array, Hash Function
• Maximum Difference Score in a Grid (MEDIUM) — Array, Dynamic Programming, Matrix
• Make String Anti-palindrome (HARD) — String, Greedy, Sorting, Counting Sort
• Sudoku Solver (HARD) — Array, Hash Table, Backtracking, Matrix
• Rotting Oranges (MEDIUM) — Array, Breadth-First Search, Matrix
• Product of Array Except Self (MEDIUM) — Array, Prefix Sum
• Two Sum (EASY) — Array, Hash Table
• Plus One (EASY) — Array, Math
• Coin Change (MEDIUM) — Array, Dynamic Programming, Breadth-First Search
• Word Break (MEDIUM) — Array, Hash Table, String, Dynamic Programming, Trie, Memoization
• Logger Rate Limiter (EASY) — Hash Table, Design, Data Stream
• Spiral Matrix (MEDIUM) — Array, Matrix, Simulation
• Unique Email Addresses (EASY) — Array, Hash Table, String
• Heaters (MEDIUM) — Array, Two Pointers, Binary Search, Sorting
• Russian Doll Envelopes (HARD) — Array, Binary Search, Dynamic Programming, Sorting
• Top K Frequent Elements (MEDIUM) — Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect
• Longest Increasing Subsequence (MEDIUM) — Array, Binary Search, Dynamic Programming
• 3Sum (MEDIUM) — Array, Two Pointers, Sorting
• House Robber (MEDIUM) — Array, Dynamic Programming
• Min Stack (MEDIUM) — Stack, Design
• Minimum Cost For Tickets (MEDIUM) — Array, Dynamic Programming
• Daily Temperatures (MEDIUM) — Array, Stack, Monotonic Stack
• 132 Pattern (MEDIUM) — Array, Binary Search, Stack, Monotonic Stack, Ordered Set
• Best Time to Buy and Sell Stock (EASY) — Array, Dynamic Programming
• Middle of the Linked List (EASY) — Linked List, Two Pointers
• Group Anagrams (MEDIUM) — Array, Hash Table, String, Sorting
• Trapping Rain Water (HARD) — Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack
• Reorganize String (MEDIUM) — Hash Table, String, Greedy, Sorting, Heap (Priority Queue), Counting
• Decode String (MEDIUM) — String, Stack, Recursion
• Maximal Rectangle (HARD) — Array, Dynamic Programming, Stack, Matrix, Monotonic Stack
• Minimum Limit of Balls in a Bag (MEDIUM) — Array, Binary Search
• Zigzag Conversion (MEDIUM) — String
• Kth Largest Element in an Array (MEDIUM) — Array, Divide and Conquer, Sorting, Heap (Priority Queue), Quickselect
• Employee Free Time (HARD) — Array, Line Sweep, Sorting, Heap (Priority Queue)
• Lowest Common Ancestor of a Binary Tree (MEDIUM) — Tree, Depth-First Search, Binary Tree
• Next Permutation (MEDIUM) — Array, Two Pointers
• Move Zeroes (EASY) — Array, Two Pointers
• Binary Tree Zigzag Level Order Traversal (MEDIUM) — Tree, Breadth-First Search, Binary Tree