Intuit Software Developer Intern Interview Questions, Process, and Tips

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

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:
...read more
Ans. 
Implement a stack using two queues to store integer values.
• Use two queues to simulate stack operations efficiently.

• Maintain the top element in one of the queues for easy access.

• Ensure proper handling of edge cases like empty stack.

• Example: Push elements onto one queue, then dequeue and enqueue to the other queue for pop operation.

• Example: Use a flag to track the top element and update it accordingly.
Answered by AI
Add your answer

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. 

 

 

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 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. 
Use sliding window technique to find smallest subarray with k distinct values.
• Use a sliding window approach to keep track of the subarray with k distinct values.

• Use a hashmap to store the frequency of each element in the window.

• Slide the window to the right until the hashmap contains k distinct elements.

• Shrink the window from the left while maintaining k distinct elements.

• Update the minimum subarray length as you slide...read more
Answered by AI
Add your answer

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.