Problem database last updated: June 20, 2025

IIntuit logo

Intuit Coding Interview Questions

68 problems · 11 Easy, 45 Medium, 12 Hard · Ranked #37 of 458

Difficulty breakdown

11 Easy

16% · avg 23%

45 Medium

66% · avg 59%

12 Hard

18% · avg 18%

Top topics

array
66.2%
dynamic-programming
29.4%1.5x
string
19.1%
hash-table
19.1%
breadth-first-search
17.6%2.1x
stack
16.2%1.9x

Interview profile

Based on 68 reported problems, Intuit interviews are in line with industry averages - 18% Hard vs 18% overall. The majority (66%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.

Compared to the industry average, Intuit puts unusual emphasis on quickselect (2.9% of problems, 2.8x the industry average), monotonic-stack (7.4% of problems, 2.5x the industry average), topological-sort (2.9% of problems, 2.5x the industry average). If you're short on time, these are the categories to double down on.

The most common topics are array (66.2%), dynamic-programming (29.4%), string (19.1%), hash-table (19.1%). Problems below are sorted by frequency, the ones at the top are asked most often.

All 68 problems

Minimum Number of Taps to Open to Water a Garden

Solve

There is a one-dimensional garden on the x-axis. The garden starts at the point 0 and ends at the point n. (i.e., the length of the garden is n).

HardVery Likely
arraydynamic-programminggreedy

Valid Parentheses

Solve

Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.

EasyVery Likely
stringstack

Course Schedule II

Solve

There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, b...

MediumVery Likely
depth-first-searchbreadth-first-searchgraph

Most Profitable Path in a Tree

Solve

There is an undirected tree with n nodes labeled from 0 to n - 1, rooted at node 0. You are given a 2D integer array edges of length n - 1 where edges[i] = [ai,...

MediumVery Likely
arraytreedepth-first-search

Maximum Product of Three Numbers

Solve

Given an integer array nums, find three numbers whose product is maximum and return the maximum product.

EasyVery Likely
arraymathsorting

LRU Cache

Solve

Design a data structure that follows the constraints of a Least Recently Used (LRU) cache.

MediumVery Likely
hash-tablelinked-listdesign

Max Area of Island

Solve

You are given an m x n binary matrix grid. An island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical.) You may assume al...

MediumVery Likely
arraydepth-first-searchbreadth-first-search

Maximum Total Beauty of the Gardens

Solve

Alice is a caretaker of n gardens and she wants to plant flowers to maximize the total beauty of all her gardens.

HardVery Likely
arraytwo-pointersbinary-search

Destroy Sequential Targets

Solve

You are given a 0-indexed array nums consisting of positive integers, representing targets on a number line. You are also given an integer space.

MediumVery Likely
arrayhash-tablecounting

Length of the Longest Subsequence That Sums to Target

Solve

You are given a 0-indexed array of integers nums, and an integer target.

MediumVery Likely
arraydynamic-programming

Basic Calculator IV

Solve

Given an expression such as expression = "e + 8 - a + 5" and an evaluation map such as {"e": 1} (given in terms of evalvars = ["e"] and evalints = [1]), return...

HardVery Likely
hash-tablemathstring

Maximum Difference Score in a Grid

Solve

You are given an m x n matrix grid consisting of positive integers. You can move from a cell in the matrix to any other cell that is either to the bottom or to...

MediumVery Likely
arraydynamic-programmingmatrix

Sudoku Solver

Solve

Write a program to solve a Sudoku puzzle by filling the empty cells.

HardVery Likely
arrayhash-tablebacktracking

Product of Array Except Self

Solve

Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i].

MediumVery Likely
arrayprefix-sum

Rotting Oranges

Solve

You are given an m x n grid where each cell can have one of three values:

MediumVery Likely
arraybreadth-first-searchmatrix

Plus One

Solve

You are given a large integer represented as an integer array digits, where each digits[i] is the ith digit of the integer. The digits are ordered from most sig...

EasyLikely
arraymath

Two Sum

Solve

Given an array of integers nums and an integer target, return the indices of the two numbers that add up to target.

EasyLikely
arrayhash-map

Coin Change

Solve

You are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money.

MediumLikely
arraydynamic-programmingbreadth-first-search

Word Break

Solve

Given a string s and a dictionary of strings wordDict, return true if s can be segmented into a space-separated sequence of one or more dictionary words.

MediumLikely
arrayhash-tablestring

Spiral Matrix

Solve

Given an m x n matrix, return all elements of the matrix in spiral order.

MediumLikely
arraymatrixsimulation

Unique Email Addresses

Solve

Every valid email consists of a local name and a domain name, separated by the '@' sign. Besides lowercase letters, the email may contain one or more '.' or '+'...

EasyLikely
arrayhash-tablestring

Min Stack

Solve

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.

MediumLikely
stackdesign

Heaters

Solve

Winter is coming! During the contest, your first job is to design a standard heater with a fixed warm radius to warm all the houses.

MediumLikely
arraytwo-pointersbinary-search

Top K Frequent Elements

Solve

Given an integer array nums and an integer k, return the k most frequent elements. You may return the answer in any order.

MediumLikely
arrayhash-tabledivide-and-conquer

Russian Doll Envelopes

Solve

You are given a 2D array of integers envelopes where envelopes[i] = [wi, hi] represents the width and the height of an envelope.

HardLikely
arraybinary-searchdynamic-programming

3Sum

Solve

Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0.

MediumLikely
arraytwo-pointerssorting

House Robber

Solve

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from rob...

MediumLikely
arraydynamic-programming

Longest Increasing Subsequence

Solve

Given an integer array nums, return the length of the longest strictly increasing subsequence.

MediumLikely
arraybinary-searchdynamic-programming

Trapping Rain Water

Solve

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.

HardLikely
arraytwo-pointersdynamic-programming

Best Time to Buy and Sell Stock

Solve

You are given an array prices where prices[i] is the price of a given stock on the ith day.

EasyLikely
arraydynamic-programming

Daily Temperatures

Solve

Given an array of integers temperatures represents the daily temperatures, return an array answer such that answer[i] is the number of days you have to wait aft...

MediumLikely
arraystackmonotonic-stack

Middle of the Linked List

Solve

Given the head of a singly linked list, return the middle node of the linked list.

EasyLikely
linked-listtwo-pointers

132 Pattern

Solve

Given an array of n integers nums, a 132 pattern is a subsequence of three integers nums[i], nums[j] and nums[k] such that i < j < k and nums[i] < nums[k] < num...

MediumLikely
arraybinary-searchstack

Minimum Cost For Tickets

Solve

You have planned some train traveling one year in advance. The days of the year in which you will travel are given as an integer array days. Each day is an inte...

MediumLikely
arraydynamic-programming

Group Anagrams

Solve

Given an array of strings strs, group the anagrams together. You can return the answer in any order.

MediumLikely
arrayhash-tablestring

Get the Maximum Score

Solve

You are given two sorted arrays of distinct integers nums1 and nums2.

HardSometimes
arraytwo-pointersdynamic-programming

Longest Substring Without Repeating Characters

Solve

Given a string s, find the length of the longest substring without duplicate characters.

MediumSometimes
hash-tablestringsliding-window

Climbing Stairs

Solve

You are climbing a staircase. It takes n steps to reach the top.

EasySometimes
mathdynamic-programmingmemoization

Kth Largest Element in an Array

Solve

Given an integer array nums and an integer k, return the kth largest element in the array.

MediumSometimes
arraydivide-and-conquersorting

Next Permutation

Solve

A permutation of an array of integers is an arrangement of its members into a sequence or linear order.

MediumSometimes
arraytwo-pointers

Median of Two Sorted Arrays

Solve

Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays.

HardSometimes
arraybinary-searchdivide-and-conquer

Decode String

Solve

Given an encoded string, return its decoded string.

MediumSometimes
stringstackrecursion

Merge Two Sorted Lists

Solve

You are given the heads of two sorted linked lists list1 and list2.

EasySometimes
linked-listrecursion

Generate Parentheses

Solve

Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.

MediumSometimes
stringdynamic-programmingbacktracking

Binary Tree Zigzag Level Order Traversal

Solve

Given the root of a binary tree, return the zigzag level order traversal of its nodes' values. (i.e., from left to right, then right to left for the next level...

MediumSometimes
treebreadth-first-searchbinary-tree

Zigzag Conversion

Solve

The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better...

MediumSometimes
string

Longest Valid Parentheses

Solve

Given a string containing just the characters '(' and ')', return the length of the longest valid (well-formed) parentheses substring.

HardSometimes
stringdynamic-programmingstack

Binary Tree Level Order Traversal

Solve

Given the root of a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level).

MediumSometimes
treebreadth-first-searchbinary-tree

Maximal Rectangle

Solve

Given a rows x cols binary matrix filled with 0's and 1's, find the largest rectangle containing only 1's and return its area.

HardSometimes
arraydynamic-programmingstack

Insert Delete GetRandom O(1)

Solve

Implement the RandomizedSet class:

MediumSometimes
arrayhash-tablemath

Move Zeroes

Solve

Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements.

EasySometimes
arraytwo-pointers

Number of Operations to Make Network Connected

Solve

There are n computers numbered from 0 to n - 1 connected by ethernet cables connections forming a network where connections[i] = [ai, bi] represents a connectio...

MediumSometimes
depth-first-searchbreadth-first-searchunion-find

Shortest Path in Binary Matrix

Solve

Given an n x n binary matrix grid, return the length of the shortest clear path in the matrix. If there is no clear path, return -1.

MediumSometimes
arraybreadth-first-searchmatrix

Number of Islands

Solve

Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands.

MediumSometimes
arraydepth-first-searchbreadth-first-search

Course Schedule

Solve

There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, b...

MediumSometimes
depth-first-searchbreadth-first-searchgraph

Binary Tree Maximum Path Sum

Solve

A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequ...

HardSometimes
dynamic-programmingtreedepth-first-search

Design Circular Queue

Solve

Design your implementation of the circular queue. The circular queue is a linear data structure in which the operations are performed based on FIFO (First In Fi...

MediumSometimes
arraylinked-listdesign

Lowest Common Ancestor of a Binary Tree

Solve

Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.

MediumSometimes
treedepth-first-searchbinary-tree

Palindrome Linked List

Solve

Given the head of a singly linked list, return true if it is a palindrome or false otherwise.

EasySometimes
linked-listtwo-pointersstack

Find All Anagrams in a String

Solve

Given two strings s and p, return an array of all the start indices of p's anagrams in s. You may return the answer in any order.

MediumSometimes
hash-tablestringsliding-window

Serialize and Deserialize Binary Tree

Solve

Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitte...

HardSometimes
stringtreedepth-first-search

Reorganize String

Solve

Given a string s, rearrange the characters of s so that any two adjacent characters are not the same.

MediumSometimes
hash-tablestringgreedy

Number of Longest Increasing Subsequence

Solve

Given an integer array nums, return the number of longest increasing subsequences.

MediumSometimes
arraydynamic-programmingbinary-indexed-tree

Task Scheduler

Solve

You are given an array of CPU tasks, each labeled with a letter from A to Z, and a number n. Each CPU interval can be idle or allow the completion of one task....

MediumSometimes
arrayhash-tablegreedy

Minimum Falling Path Sum

Solve

Given an n x n array of integers matrix, return the minimum sum of any falling path through matrix.

MediumSometimes
arraydynamic-programmingmatrix

Minimum Limit of Balls in a Bag

Solve

You are given an integer array nums where the ith bag contains nums[i] balls. You are also given an integer maxOperations.

MediumSometimes
arraybinary-search

Next Greater Element II

Solve

Given a circular integer array nums (i.e., the next element of nums[nums.length - 1] is nums[0]), return the next greater number for every element in nums.

MediumSometimes
arraystackmonotonic-stack

Largest Plus Sign

Solve

You are given an integer n. You have an n x n binary grid grid with all values initially 1's except for some indices given in the array mines. The ith element o...

MediumSometimes
arraydynamic-programming

How often are these problems asked?

Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Intuit interviews.

Very Likely

75-100%

Likely

50-74%

Sometimes

25-49%

Rare

0-24%

Preparing for your Intuit coding interview

Intuit interviews focus heavily on array, dynamic-programming, string problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.

Beyond solving problems, practice explaining your approach. Intuit interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.

Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.

Frequently Asked Questions

What coding problems does Intuit ask in interviews?add

Intuit has been reported to ask 68 distinct coding problems. The most common topics are array, dynamic-programming, string. 11 are Easy difficulty, 45 are Medium, and 12 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.

How hard are Intuit coding interviews?add

Based on 68 reported problems, Intuit interviews are in line with industry averages - 18% Hard vs 18% overall. 66% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.

How should I prepare for a Intuit coding interview?add

Start with the highest-frequency problems listed on this page. Focus on the core topics: array, dynamic-programming, string. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.

Other companies to explore

Ready to ace your Intuit interview?

Simulate a real Intuit coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.

Simulate a Intuit interview with AIarrow_forward