Intuit

Intuit Software Engineer Onsite Coding Questions

20+ questions from real Intuit Software Engineer Onsite Coding rounds, reported by candidates who interviewed there.

20
Questions
8
Topic Areas
10+
Sources

What does the Intuit Onsite Coding round test?

The Intuit onsite coding round is the core technical evaluation. Software Engineer candidates typically see 2-3 algorithm and data structure problems. Problems range from medium to hard difficulty, and interviewers evaluate both correctness and code quality.

Top Topics in This Round

Intuit Software Engineer Onsite Coding Questions

**Candidate Profile:** Software Development Engineer at a MAANG company (2.3 years of experience). Applied via LinkedIn referral. **Round 0: Technical Phone Interview (90 minutes)** The session combin

Intuit Technical round

System Design 2025

My friend recently got this interview, A4A final interview process. 1. For the Craft Demo, working on the [Java/Python/Fullstack] repo from the Intuit GitHub. Curious — anyone who’s gone through this:

LeetCode #1411: Number of Ways to Paint N × 3 Grid. Difficulty: Hard. Topics: Dynamic Programming. Asked at Intuit in the last 6 months.

#664 Strange Printer

Dynamic Programming

LeetCode #664: Strange Printer. Difficulty: Hard. Topics: String, Dynamic Programming. Asked at Intuit in the last 6 months.

LeetCode #66: Plus One. Difficulty: Easy. Topics: Array, Math. Asked at Intuit in the last 6 months.

LeetCode #1931: Painting a Grid With Three Different Colors. Difficulty: Hard. Topics: Dynamic Programming. Asked at Intuit in the last 6 months.

LeetCode #3719: Longest Balanced Subarray I. Difficulty: Medium. Topics: Array, Hash Table, Divide and Conquer, Segment Tree, Prefix Sum. Asked at Intuit in the last 6 months.

LeetCode #20: Valid Parentheses. Difficulty: Easy. Topics: String, Stack. Asked at Intuit in the last 6 months.

#1 Two Sum

Hash Table

LeetCode #1: Two Sum. Difficulty: Easy. Topics: Array, Hash Table. Asked at Intuit in the last 6 months.

LeetCode #994: Rotting Oranges. Difficulty: Medium. Topics: Array, Breadth-First Search, Matrix. Asked at Intuit in the last 6 months.

#647 Palindromic Substrings

Dynamic Programming

LeetCode #647: Palindromic Substrings. Difficulty: Medium. Topics: Two Pointers, String, Dynamic Programming. Asked at Intuit in the last 6 months.

LeetCode #3148: Maximum Difference Score in a Grid. Difficulty: Medium. Topics: Array, Dynamic Programming, Matrix. Asked at Intuit in the last 6 months.

LeetCode #2812: Find the Safest Path in a Grid. Difficulty: Medium. Topics: Array, Binary Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix. Asked at Intuit in the last 6 months.

LeetCode #468: Validate IP Address. Difficulty: Medium. Topics: String. Asked at Intuit in the last 6 months.

Hi Folks I have a Senior Software Engineer - Onsite with Craft demo. The craft Demo preparation is a 90 minutes session where I will be building whatever asked. I...

Triangular Farms Easy Shyam is a farmer who owns a large plot near Jewar. Now, since land acquisition for Asia\'s largest airport has started, he will have to sell his farms to...

Intuit | onsite | ROBBERY | Medium

Dynamic Programming 2022

ROBBERY ### Medium A thief plans to rob in a shop having 2 types of toys typeA toy and typeB toy. Toys have some weight and cost. i.e. Toy A has weight given by...

Aman and Coding ### Hard Aman is learning to code again after a break of 6 months. Now aman is provided with n questions in a test and he is lazy so...

Hi Folks, I got this question during onsite interview with Intuit. Any help to solve/approach is highly appreciated. Problem Statement: Given a string where each character is a sign (\'<\', \'>\', \'=\') and...

Intuit onsite

Math 2021

I was asked this question for my Intuit onsite round. Given an integer k, and an array of size n, transform the array to size k such that the resultant array...

See All 20 Questions from This Round

Full question text, answer context, and frequency data for subscribers.

Get Access