Upload Button Icon Add office photos

Intuit

Compare button icon Compare button icon Compare

Filter interviews by

Intuit Software Developer Intern Interview Questions, Process, and Tips

Updated 26 Dec 2024

Top Intuit Software Developer Intern Interview Questions and Answers

  • Q1. Grid Satisfaction Problem In this problem, you are given a grid of size N*M containing two types of people: type ‘A’ and type ‘B’. You are given the number of people of ...read more
  • Q2. Problem Statement: Find the Number of States You are given ‘n’ cities, some of which are connected by bidirectional roads. You also have an ‘n x n’ matrix ‘roads’, where ...read more
  • Q3. Binary Tree Diameter Problem Statement You are given a Binary Tree, and you need to determine the length of the diameter of the tree. The diameter of a binary tree is th ...read more
View all 12 questions

Intuit Software Developer Intern Interview Experiences

7 interviews found

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected
Round 1 - Coding Test 

DSA based on any general language prefer C++

Round 2 - Technical 

(3 Questions)

  • Q1. DBMS, BST, Sieve of Erathnus, Dynamic Programming
  • Q2. Debugging c++ code
  • Q3. OOPS based question
Round 3 - HR 

(1 Question)

  • Q1. General questions and some questions on personality
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Technical 

(2 Questions)

  • Q1. What is polymorphism?
  • Ans. 

    Polymorphism is the ability of a function or method to behave differently based on the object it is acting upon.

    • Polymorphism allows objects of different classes to be treated as objects of a common superclass.

    • There are two types of polymorphism: compile-time (method overloading) and runtime (method overriding).

    • Example: Inheritance allows a child class to override a method from its parent class, exhibiting polymorphic b

  • Answered by AI
  • Q2. And other questions related to cs fundamentals

Software Developer Intern Interview Questions Asked at Other Companies

Q1. Sum of Maximum and Minimum Elements Problem Statement Given an ar ... read more
asked in Amazon
Q2. Fish Eater Problem Statement In a river where water flows from le ... read more
asked in Apple
Q3. Kevin and his Fruits Problem Statement Kevin has 'N' buckets, eac ... read more
asked in CommVault
Q4. Sliding Maximum Problem Statement Given an array of integers ARR ... read more
Q5. Reverse Words in a String: Problem Statement You are given a stri ... read more
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Job Portal and was interviewed in May 2023. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Don’t add your photo or details such as gender, age, and address in your resume. These details do not add any value.
View all tips
Round 2 - Coding Test 

4 coding question were there . The level was medium to hard

Round 3 - Technical 

(2 Questions)

  • Q1. This round was of 45 min with 1 coding ques and computer fundamentals
  • Q2. Two sum was asked oops concept

I was interviewed in Feb 2021.

Round 1 - Coding Test 

(4 Questions)

Round duration - 90 Minutes
Round difficulty - Medium

Timing: 6 PM to 7:30 PM IST
Environment: Test took place on Hackerrank. The test was proctored.
Details: 4 questions with varying difficulty were there. Partial score was allowed.

  • Q1. 

    Grid Satisfaction Problem

    In this problem, you are given a grid of size N*M containing two types of people: type ‘A’ and type ‘B’. You are given the number of people of each type: 'countA' denotes the num...

  • Ans. Using Recursion

    The approach is to use Recursion along with Bitmasking. We can observe that we only need to know the last M cells we processed. We should only consider the cells at the top and left of the current cell because the right direction will be covered by someone else's left position, and the bottom position will be covered by someone else's top position. If a cell is filled, its contribution is fixed. If a nei...

  • Answered Anonymously
  • Q2. 

    Max Game Minimum Penalty Problem

    In this game, you are given a collection of 'N' numbers. The objective is to minimize the total penalty incurred while playing by following these steps:

    1. Select any two ...
  • Ans. Brute Force
    1. The idea is to keep only the required elements in the vector/array. Let the given array be { 3, 4, 5, 4}.
    2. We pick the 2 smallest elements i.e 3 and 4 in the above example and replace them with their sum. The above array hence becomes {5, 4, 7}.
    3. Along with this, we also maintain the penalty variable and keep on updating it. Initial value of the penalty will be 0. After we perform step 2, the penalty becomes 4+3...
  • Answered Anonymously
  • Q3. 

    Binary Tree Diameter Problem Statement

    You are given a Binary Tree, and you need to determine the length of the diameter of the tree.

    The diameter of a binary tree is the length of the longest path betwe...

  • Ans. Recursion

    The basic idea of this approach is to break the problem into subproblems. 

    Now, there are three possible cases:

     

    1. The diameter of the tree is present in the left subtree.
    2. The diameter of the tree is present in the right subtree.
    3. The diameter of the tree passes through the root node.

     

    Let us define a recursive function, ‘getDiamter’, which takes the root of the binary tree as input parameter and return...

  • Answered Anonymously
  • Q4. 

    Problem Statement: Find the Number of States

    You are given ‘n’ cities, some of which are connected by bidirectional roads. You also have an ‘n x n’ matrix ‘roads’, where if city ‘i’ and city ‘j’ are conne...

  • Ans. Use Disjoint-set data structure

    Disjoint-set (or Union-find) is a data structure that stores a collection of disjoint (non-overlapping) sets. This data structure consists of three basic operations:

    • makeSet(‘V’): Create a new set containing the element 'V'.
    • unionSet(‘A’, ‘B’): Merge the two specified sets, the set containing element ‘A’ and the set containing element ‘B’.
    • findSet('V'): Return the representative (also called...
  • Answered Anonymously
Round 2 - Video Call 

(1 Question)

Round duration - 30 Minutes
Round difficulty - Easy

Problems were asked from projects, and with one easy algorithm problem, they tested problem-solving skill.

The interview started with an introduction, post which my projects were discussed.
Out of two projects, one was discussed for about 15 minutes, and another for 5 minutes. The questions were more on underlying concepts, its conceptual working, rather than implementation details. They were satisfied with my answer.

  • Q1. 

    Triplets with Given Sum Problem

    Given an array or list ARR consisting of N integers, your task is to identify all distinct triplets within the array that sum up to a specified number K.

    Explanation:

    A t...

  • Ans. Brute Force
    • The most trivial approach would be to find all triplets of the array and count all such triplets whose ‘SUM’ = 'K'.
    • We can find the answer using three nested loops for three different indexes and check if the values at those indexes sum up to 'K'.
    • Create a set  to keep the track of triplets we have visited. Run first loop from i = 0 to i = ‘N’ - 3, second loop from j = i + 1 to j = ‘N’ - 2 and third loop ...
  • Answered Anonymously
Round 3 - Video Call 

Round duration - 60 Minutes
Round difficulty - Medium

In this round, my project was discussed for 5 minutes, and later only OS, DBMS was asked. No coding problems were asked.
It was more of a discussion round for me.
One of the interviewers had 20+ years of experience, while the other 7+ years of eperience.
Questions were mostly asked from the OS course (nearly 45 minutes) and had a healthy discussion. I didn't knew the answers to a few questions, of which the interviewer explained the answer.

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in BangaloreEligibility criteriaCGPA – 7.5 CGPA or 75%, Branches – CSE/IT/Software Engineering, Mathematics and ComputingIntuit interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, Operating Systems, Databases, Computer Networks, OOPS, ArchitectureTime required to prepare for the interview - 6 MonthsInterview preparation tips for other job seekers

Tip 1 : Keep practising questions on Data Structures and Algorithms to enhance problem-solving skills.
Tip 2 : Do at least one project with a proper understanding of underlying concepts.
Tip 3 : Coursework are important

Application resume tips for other job seekers

Tip 1 : Have at least one project.
Tip 2 : Do not put things which you are not completely comfortable.

Final outcome of the interviewSelected

Skills evaluated in this interview

Intuit interview questions for designations

 Software Developer

 (18)

 Software Engineer Intern Trainee

 (1)

 Intern

 (2)

 Software Engineer

 (6)

 Software Engineer2

 (5)

 Summer Intern

 (1)

 Senior Software Engineer

 (11)

 Software Engineer Trainee

 (1)

I was interviewed before Mar 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Hard

4 questions. 2 hard, 1 medium, 1 easy. Those who were able to 2.5 questions were shortlisted. 2 DP Questions Hard, 1 Graph medium and 1 easy array based question.

  • Q1. 

    Number of Islands Problem Statement

    You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...

  • Ans. 

    Used DFS and Flood Fill Algorithm.

  • Answered Anonymously
Round 2 - Face to Face 

(1 Question)

Round duration - 40 minutes
Round difficulty - Medium

Face to Face Interaction. Project discussion in great depth. Talked about Machine learning.

  • Q1. 

    Longest Palindromic Substring Problem Statement

    You are provided with a string STR of length N. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind...

  • Ans. 

    A twisted level of Longest Palindromic Substring. If you know the approach for this, the question was a cakewalk.

  • Answered Anonymously
Round 3 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Hard

Very tough Data structure questions to get the most optimum approach only.

  • Q1. 

    Rearrange Linked List Problem Statement

    Given a singly linked list in the form 'L1' -> 'L2' -> 'L3' -> ... 'Ln', your task is to rearrange the nodes to the form 'L1' -> 'Ln' -> 'L2' -> '...

  • Ans. 

    Use a Stack based approach storing the heads in 2 stacks. Reverse the second half and join the linked list.

  • Answered Anonymously
  • Q2. 

    Kth Largest Element Problem

    Given an array containing N distinct positive integers and a number K, determine the Kth largest element in the array.

    Example:

    Input:
    N = 6, K = 3, array = [2, 1, 5, 6, 3, ...
  • Ans. 

    I used a heap based approach and so did it in O(Log(n)). Interviewers told me to optimise so I did it with a Dequeue in O(n).

  • Answered Anonymously

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in BengaluruEligibility criteria7 CGPAIntuit interview preparation:Topics to prepare for the interview - Trees(Red Black, AVL, binary), Graphs, DP, Queue, String ManipulationTime required to prepare for the interview - 5 MonthsInterview preparation tips for other job seekers

Tip 1 : Keep your good projects ready in Resume and be ready to explain design related questions. They are looking for approaches.
Tip 2 : Practice by writing the code from scratch and not completing a simple function.
Tip 3 : Good Communication skills will be an added advantage.

Application resume tips for other job seekers

Tip 1 : Keep your 2 best projects and interview experiences.
Tip 2 : NEVER put things that you don't thoroughly know.

Final outcome of the interviewSelected

Skills evaluated in this interview

Get interview-ready with Top Intuit Interview Questions

I was interviewed in Oct 2020.

Round 1 - Video Call 

(1 Question)

Round duration - 30 minutes
Round difficulty - Medium

The round lasted for about 45 min. I was asked a lot of OOPs questions. There was a detailed discussion on one of my project along with current problems in my project. How can I make it more secured and increase scalability.

  • Q1. 

    Stack using Two Queues Problem Statement

    Develop a Stack Data Structure to store integer values using two Queues internally.

    Your stack implementation should provide these public functions:

    Explanation:

    ...
  • Ans. 

    I just had to write the push and pop functions. After discussing my approach and its complexities, I was allowed to code.

  • Answered Anonymously
Round 2 - Video Call 

Round duration - 90 minutes
Round difficulty - Hard

There were two interviewers. After introduction, and small discussion on my project. They asked my favourite subject, I answered OOP- was asked to differentiate between OOP language and Procedure Oriented Languages. Then definition of OOP and real life examples of overloading and overriding. 

I was asked to code a data structure where I can obtain, add, remove one occurrence and all occurrence in O(1). I tried using maps, he was not very satisfied. 

 

 

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Birla Institute of Technology, Mesra. Eligibility criteriaSelected candidates were contacted based on resume.Intuit interview preparation:Topics to prepare for the interview - Data structure, Algorithms, OOPs, Operating System, DBMSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Do competitive programming in 1st and 2nd year.
Tip 2 : Study every data structure and algorithm in dfs manner. Once done then practice. 
Tip 3 : Don't ignore theoretical subjects.

Application resume tips for other job seekers

Tip 1 : Do at least 2 projects. 
Tip 2 : Mention your programming accounts.

Final outcome of the interviewRejected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Coding Test 

Round duration - 90 minutes
Round difficulty - Easy

This was a coding round in which two questions were asked. I solved first question fully and the second question partially.

Round 2 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

This was face to face interview round and the interviewer asked me one question only.

  • Q1. Given an array of size n, how would you find the smallest subarray that contains k distinct values?
  • Ans. 
    • I used the concept of Sliding window to solve this question. I initialized the start pointer and end pointer to 0, then moved the end pointer to a point at which the distinct elements between the start and end pointer was equal to k, I kept the track through a map, and then moved the start pointer ahead till the point where distinct elements between the start and end pointer were equal to k - 1 and accordingly stored t...
  • Answered Anonymously
Round 3 - Face to Face 

Round duration - 60 minutes
Round difficulty - Easy

I had an interview with two tech people from Intuit who had an experience of 5-6 years in the industry.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Delhi Technological University. I applied for the job as SDE - Intern in BangaloreIntuit interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Operating Systems, Database Management, Computer Networks.Time required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

I used Codezen platform of Coding Ninjas to practice data structures related questions . There you will get topic wise questions. So try to do as much as practice there or at any other coding portal to enhance your speed and efficiency. 

Application resume tips for other job seekers

Mention good level projects in your resume and also your internships or previous experiences with a brief explanation about what you have done in that internship.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview questions from similar companies

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Jun 2024. There were 2 interview rounds.

Round 1 - Aptitude Test 

Technical MCQ questions on core computer science subjects were asked.

Round 2 - One-on-one 

(2 Questions)

  • Q1. How to find whether the given linked list has loop in it?
  • Q2. Explain osi model with example of browser.
Interview experience
3
Average
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Google updates and was interviewed before Oct 2022. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Technical 

(1 Question)

  • Q1. There are three technical rounds one round will be tough
Round 3 - HR 

(2 Questions)

  • Q1. They didn't ask me anything
  • Q2. Will give U false promises and showoff about the company

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare well for DSA , but with that knowledge try for any product based company not only one in limelight you can try any other but not Accolite, because though you clear all those 3 rounds and get hired , there is nothing in this company other than false promises and mere showoff. They are either terminating or extending the internship for of no reason amid doing projects, and also you will not get the work you are trained and desired for , they will use U for QA testing rather being hired as developer

I was interviewed in Apr 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 30 Minutes
Round difficulty - Easy

Timing of test start from 11 AM and everything goes well here .

  • Q1. What is segmentation in the context of operating systems?
  • Q2. How many levels of normalization are there in database management systems?
Round 2 - Coding Test 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Easy

It happen nicely and no problem occur.

  • Q1. 

    Trapping Rain Water Problem Statement

    You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...

  • Ans. Brute Force Approach

    The idea here is to travel over every elevation on the map and calculate the units of water the elevation can store.

     

    Here is the algorithm :

     

    1. Iterate over every elevation or element and find the maximum elevation on to the left and right of it. Say, the maximum elevation on to the left of the current elevation or element that we are looking at is ‘maxLeftHeight’ and the maximum elevation on...
  • Answered Anonymously
  • Q2. 

    Sort 0 1 2 Problem Statement

    Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.

    Input:

    The first line contains an integer 'T' representing the n...
  • Ans. Sorting

    Use any good sorting algorithm like Merge Sort, Quick Sort or inbuilt sorting function of different languages.

    • Sort the Array and just return.
    Space Complexity: O(1)Explanation:

    O(1), As we are using constant space.

    Time Complexity: O(nlogn)Explanation:

    O(N*log(N)), where ‘N’ is the size of the array.

    We are using inbuilt sort algorithm which has Overall Time Complexity O(N*log(N))

  • Answered Anonymously
Round 3 - Video Call 

(2 Questions)

Round duration - 90 mintues
Round difficulty - Hard

Environment is very bad the intervier video call is lagging.

  • Q1. What are the sub-parts or phases of the analysis part in compiler design?
  • Q2. 

    Left Rotations of an Array

    Given an array of size N and Q queries, each query requires left rotating the original array by a specified number of elements. Return the modified array for each query.

    Input:

    ...
  • Ans. Rotate One Element At A Time

    The idea is to create a function which would rotate the array one element at a time. This can be done by shifting the array towards left by one element and copying the first element to the end of the array. For every query repeatedly call the above function, until the desired rotation is obtained.

     

    If the number of rotations required, say ‘K’, is greater than the number of elements, ‘N’,...

  • Answered Anonymously

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Netaji Subhas University Of Technology. I applied for the job as SDE - Intern in BangaloreEligibility criteria6 CGPAAccolite interview preparation:Topics to prepare for the interview - Recursion,Tress of different types, DP, Graphs,array and pointer.Time required to prepare for the interview - 3 MonthsInterview preparation tips for other job seekers

Tip 1 : Prepare Data structure and algorithm
Tip 2 : Focus on operating system 
Tip 3 : RDBMS and CAO are also important

Application resume tips for other job seekers

Tip 1 : Have some projects on resume.
Tip 2 : Always write things which you can explain there.

Final outcome of the interviewSelected

Skills evaluated in this interview

Intuit Interview FAQs

How many rounds are there in Intuit Software Developer Intern interview?
Intuit interview process usually has 2-3 rounds. The most common rounds in the Intuit interview process are Technical, Resume Shortlist and Coding Test.
What are the top questions asked in Intuit Software Developer Intern interview?

Some of the top questions asked at the Intuit Software Developer Intern interview -

  1. What is polymorphi...read more
  2. This round was of 45 min with 1 coding ques and computer fundament...read more
  3. general questions and some questions on personal...read more

Tell us how to improve this page.

Intuit Software Developer Intern Interview Process

based on 3 interviews

1 Interview rounds

  • Coding Test Round
View more

Intuit Software Developer Intern Reviews and Ratings

based on 1 review

4.0/5

Rating in categories

3.0

Skill development

4.0

Work-life balance

4.0

Salary

4.0

Job security

4.0

Company culture

4.0

Promotions

3.0

Work satisfaction

Explore 1 Review and Rating
Senior Software Engineer
219 salaries
unlock blur

₹20.9 L/yr - ₹76.4 L/yr

Software Engineer2
146 salaries
unlock blur

₹20 L/yr - ₹60 L/yr

Software Engineer
126 salaries
unlock blur

₹14 L/yr - ₹43.8 L/yr

Devops Engineer
45 salaries
unlock blur

₹4.2 L/yr - ₹16 L/yr

Staff Software Engineer
43 salaries
unlock blur

₹32 L/yr - ₹97 L/yr

Explore more salaries
Compare Intuit with

Salesforce

4.0
Compare

Yodlee

3.8
Compare

SAP

4.2
Compare

Oracle

3.7
Compare
Did you find this page helpful?
Yes No
write
Share an Interview