Intuit Interview Questions, Process, and Tips

Make e-commerce website design.

Coding Test

Assignment

Q1. Technical Questions asked based on resume
Add your answer

Q1. General HR Questions to check communication skills
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. 
Given a grid with type A and B people, maximize satisfaction based on neighbors.
• Start with type A people for maximum satisfaction

• Optimally place people to maximize satisfaction

• Consider satisfaction levels for each type of person and their neighbors
Answered by AI
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. 
The objective is to minimize total penalty by selecting two numbers, summing them, and accumulating the penalty until only one number remains.
• Iteratively select two numbers, sum them, and accumulate the penalty until only one number remains.

• Choose the two smallest numbers to minimize the penalty.

• Repeat the process until only one number remains to find the minimum possible penalty.
Answered by AI
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. 
The task is to find the diameter of a binary tree, which is the longest path between any two nodes in the tree.
• Traverse the tree to find the longest path between two nodes.

• Keep track of the maximum diameter found during traversal.

• The diameter may or may not pass through the root node.

• Consider the height of the left and right subtrees to calculate the diameter.
Answered by AI
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. 
Find the number of states of cities connected by roads in a matrix.
• Identify connected cities using DFS or Union-Find algorithm

• Count the number of disjoint sets to determine the number of states

• Handle self-connections of cities by setting roads[i][i] = 1
Answered by AI
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. 
Identify all distinct triplets within an array that sum up to a specified number.
• Iterate through the array and use nested loops to find all possible triplets.

• Use a set to store unique triplets and check if the sum equals the target.

• Handle edge cases like duplicate elements and no valid triplets.

• Return the triplets as space-separated integers or -1 if no triplets exist.
Answered by AI
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.

Ds questions related to hashing

Q1. Salary negotiation
Add your answer

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...read more
Ans. 
Count the number of islands in a 2D matrix of 1s and 0s.
• Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.

• Maintain a visited array to keep track of visited cells to avoid redundant traversal.

• Increment the island count each time a new island is encountered.

• Consider edge cases like boundary conditions and handling of diagonals while traversing.

• Handle the...read more
Answered by AI
Add your answer

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...read more
Ans. 
Given a string, find the longest palindromic substring, prioritizing the one with the smallest start index.
• Iterate through the string and expand around each character to find palindromes

• Keep track of the longest palindrome found and its starting index

• Return the longest palindromic substring with the smallest start index
Answered by AI
Add your answer

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' -> '...read more
Ans. 
Rearrange the nodes of a singly linked list in a specific order without altering the data of the nodes.
• Use two pointers to split the linked list into two halves, reverse the second half, and then merge the two halves alternately.

• Ensure to handle cases where the number of nodes is odd or even separately.

• Time complexity: O(N), Space complexity: O(1)

• Example: Input: 1 -> 2 -> 3 -> 4 -> 5 -> NULL, Output: 1 -
Answered by AI
Add your answer
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, ...read more
Ans. 
Find the Kth largest element in an array of distinct positive integers.
• Sort the array in non-increasing order and return the Kth element.

• Use a priority queue or quick select algorithm for efficient solution.

• Handle constraints like array size and element values properly.

• Ensure all elements in the array are distinct for accurate results.
Answered by AI
Add your answer