Intuit Coding Interview Questions
25 Intuit coding interview problems with full optimal solutions — 15 easy, 7 medium, 3 hard. Every problem ships with multiple approaches (brute-force first, then the optimal), complexity tables for each, company-specific tips on what an Intuit interviewer values, and a FAQ section.
Showing 14 problems of 25
- #5easysometimes asked
5. Remove Element
Given an array and a value, remove all instances of that value in-place and return the new length. Intuit asks this as a basic two-pointer exercise — analogous to filtering out 'voided' transactions from a ledger before reconciliation.
- #7easysometimes asked
7. Plus One
Given an array of digits representing a large integer, increment by one and return the resulting array. Intuit asks this to gauge whether you can manage carries cleanly — relevant for arbitrary-precision currency math where you can't trust a 64-bit int.
- #9easysometimes asked
9. Binary Tree Inorder Traversal
Return the inorder traversal of a binary tree's nodes' values. Intuit asks this in form-rule contexts — TurboTax stores conditional rules as trees and often needs deterministic left-to-right visitation order.
- #10easysometimes asked
10. Same Tree
Given two binary trees, determine whether they are structurally identical with equal node values. Intuit asks this in form-comparison contexts — TurboTax verifies that a saved form-rule tree matches the canonical template.
- #12easysometimes asked
12. Single Number
Given an array where every element appears twice except one, find the singleton. Intuit asks this to test whether you recognize XOR as the canonical O(1)-space trick versus reaching for a hash map.
- #13easysometimes asked
13. Majority Element
Given an array of size n, find the element that appears more than n/2 times. Intuit asks this to test whether you know Boyer-Moore voting versus reaching for a hash count, and whether you handle the tax-bracket-style 'most common category' framing.
- #14easysometimes asked
14. House Robber
Given an array representing the loot at each house, maximize the loot you can steal without taking from two adjacent houses. Intuit asks this as a gateway DP problem and reframes it as 'maximum non-adjacent dividends to schedule' for accounting candidates.
- #15easysometimes asked
15. Move Zeroes
Move all zeros in an array to the end while keeping the order of non-zero elements, in-place. Intuit asks this to test the two-pointer pattern and to probe whether you mutate input safely (a real issue when arrays represent ledger rows).
- #19mediumsometimes asked
19. Product of Array Except Self
Given an array, return an array where each element is the product of all other elements — without using division and in O(n) time. Intuit asks this to test prefix/suffix patterns and to probe whether you avoid division (which fails on zero) in financial calculations.
- #20mediumsometimes asked
20. Subarray Sum Equals K
Given an integer array and an integer k, return the number of contiguous subarrays whose sum equals k. Intuit asks this to test the prefix-sum + hash-map pattern and to reframe it as 'count ledger windows that reconcile to a target balance.'
- #21mediumrarely asked
21. Palindromic Substrings
Count the number of palindromic substrings in a string. Intuit asks this as a string-DP warm-up and to probe whether you can pick the right expansion approach over the obvious DP table.
- #23hardsometimes asked
23. Find Median from Data Stream
Design a data structure that supports adding integers and returning the running median in O(log n) add and O(1) median. Intuit asks this for senior coding rounds, framing it as 'running median of daily transaction amounts in QuickBooks.'
- #24hardsometimes asked
24. Sliding Window Maximum
Given an integer array and a window size k, return the maximum of each contiguous k-sized window. Intuit asks this for senior coding rounds and reframes it as 'running max-balance over a rolling N-day window in a ledger.'
- #25hardrarely asked
25. LFU Cache
Design an LFU (least-frequently-used) cache with O(1) get and put. Intuit asks this only at senior levels; it tests whether you can compose three data structures — hash for keys, hash for frequency buckets, doubly-linked lists per bucket — without breaking the O(1) contract.
Related interview-prep guides
Codility for Tech Interviews in 2026: The Complete Guide for Candidates
Codility is the dominant algorithmic-assessment platform across European tech hiring. Heavy in the UK, Germany, Netherlands, Nordics, and Poland where the company was founded. It scores candidates on both correctness and time complexity, runs 60-to-120-minute timed tests, and ships three products: Tests, CodeCheck, and CodeLive. This guide is what 2026 candidates need to know.
Karat Technical Interview Guide 2026: How the Third-Party Loop Actually Works
Karat is technical-interview-as-a-service. Karat-employed engineers run the technical loop for the hiring company in Karat's own recorded video and coding environment. The dynamic is different from an in-house interview: the interviewer is a contractor, not a future teammate, the rubric is fixed, the session is recorded for asynchronous review, and the hiring team's engineers watch the playback a day later. This guide is the practical map of how that loop works in 2026 and how a modern desktop setup runs alongside it.
Hatchways Tech Interview Assessment: The Complete 2026 Guide for Early-Career Devs
Hatchways is a project-based assessment and portfolio platform aimed at early-career developers: bootcamp grads, recent CS grads, and junior engineers funneled through Springboard's hiring partner network since the 2022 acquisition. Assessments take hours to days, not minutes, and the artifact reviewers see is a deployed app plus commit history plus an optional video walkthrough.