Intuit Software Developer Intern Interview Questions, Process, and Tips

DSA based on any general language prefer C++

Q1. DBMS, BST, Sieve of Erathnus, Dynamic Programming
Add your answer
Q2. Debugging c++ code
Add your answer
Q3. OOPS based question
Add your answer

Q1. General questions and some questions on personality
Add your answer

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
Add your answer
Q2. And other questions related to cs fundamentals
Add your answer

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

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

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...read more
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...read more
Answered Anonymously
Add your answer
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 ...read more
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...read more
Answered Anonymously
Add your answer
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...read more
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...read more
Answered Anonymously
Add your answer
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...read more
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...read more
Answered Anonymously
Add your answer

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...read more
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 ...read more
Answered Anonymously
Add your answer

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.