AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Intuit Software Developer Intern Interview Questions, Process, and Tips for Freshers
Top Intuit Software Developer Intern Interview Questions and Answers for Freshers
- 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
Intuit Software Developer Intern Interview Experiences for Freshers
7 interviews found
DSA based on any general language prefer C++
(3 Questions)
- Q1. DBMS, BST, Sieve of Erathnus, Dynamic Programming
- Q2. Debugging c++ code
- Q3. OOPS based question
(1 Question)
- Q1. General questions and some questions on personality
Dishi Jain
(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
- Q2. And other questions related to cs fundamentals
I applied via Job Portal and was interviewed in May 2023. There were 3 interview rounds.
4 coding question were there . The level was medium to hard
(2 Questions)
- Q1. This round was of 45 min with 1 coding ques and computer fundamentals
- Q2. Two sum was asked oops concept
I appeared for an interview in Feb 2021.
(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.
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
- 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:
- Select any two ...
- 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.
- 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.
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.
- 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.
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
(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
ARRconsisting ofNintegers, your task is to identify all distinct triplets within the array that sum up to a specified numberK.Explanation:
A t...
- 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.
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
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
Tip 1 : Have at least one project.
Tip 2 : Do not put things which you are not completely comfortable.
Skills evaluated in this interview
Intuit interview questions for designations
I appeared for an interview before Mar 2021.
(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
Nrows andMcolumns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t... - 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...
(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
STRof lengthN. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind... - 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
(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.
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 -
- Q2.
Kth Largest Element Problem
Given an array containing
Ndistinct positive integers and a numberK, determine the Kth largest element in the array.Example:
Input:
N = 6, K = 3, array = [2, 1, 5, 6, 3, ...
- 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.
Interview Preparation Tips
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.
Tip 1 : Keep your 2 best projects and interview experiences.
Tip 2 : NEVER put things that you don't thoroughly know.
Skills evaluated in this interview
Get interview-ready with Top Intuit Interview Questions
I appeared for an interview in Oct 2020.
(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.
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.
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
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.
Tip 1 : Do at least 2 projects.
Tip 2 : Mention your programming accounts.
Skills evaluated in this interview
I appeared for an interview before Sep 2020.
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.
(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.
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...
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
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 seekersMention 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 interviewSelectedSkills evaluated in this interview
Top trending discussions
Interview questions from similar companies
Software Developer Interview Questions & Answers
Bounteous x Accolite
Anonymous
posted on 11 Mar 2022
I appeared for an interview before Mar 2021.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
21 students were shortlisted from the 1st MCQ round and in this round we were asked to write the codes (function only) of 3 questions in 1 hour time.
- Q1.
Rotting Oranges Problem Statement
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
- 0 - representing an empty cell
- 1 - representing a fre...
- Ans.
Find the minimum time required to rot all fresh oranges in a grid.
Use Breadth First Search (BFS) to simulate the rotting process
Track the time taken to rot all oranges and return -1 if any fresh oranges remain
Handle edge cases like no fresh oranges or all oranges already rotten
Consider using a queue to efficiently process adjacent oranges
- Q2.
Majority Element Problem Statement
Given an array/list 'ARR' consisting of 'N' integers, your task is to find the majority element in the array. If there is no majority element present, return -1.
Exampl...
- Ans.
Find the majority element in an array, return -1 if no majority element exists.
Iterate through the array and keep track of the count of each element using a hashmap.
Check if any element's count is greater than floor(N/2) to determine the majority element.
Return the majority element or -1 if no majority element exists.
- Q3.
Maximum Path Sum Between Two Leaves Problem Description
You are provided with a non-empty binary tree in which each node contains a non-negative integer value. Your task is to find and return the maximum ...
- Ans.
Find the maximum path sum between two leaf nodes in a binary tree.
Traverse the tree to find the maximum path sum between two leaf nodes.
Keep track of the maximum sum found so far.
Consider all possible paths between leaf nodes.
Handle cases where the tree has only a single leaf node.
Implement a recursive function to calculate the maximum path sum.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
This was a technical round with DSA based questions.
- Q1.
N-th Node From The End Problem Statement
You are given a Singly Linked List of integers. The task is to find the N-th node from the end of the list.
Example:
Input:
If the given list is (1 -> -2 -&g...
- Ans.
Find the N-th node from the end of a Singly Linked List of integers.
Traverse the list to find the length L of the list.
Calculate the position of the N-th node from the beginning as L - N + 1.
Traverse the list again to reach the calculated position and return the node's value.
- Q2.
LCA of Binary Tree Problem Statement
You are given a binary tree consisting of distinct integers and two nodes,
XandY. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes... - Ans.
Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.
Traverse the binary tree to find the paths from the root to nodes X and Y.
Compare the paths to find the last common node, which is the LCA.
Handle cases where one node is an ancestor of the other or when one node is the LCA itself.
- Q3.
Reverse Words in a String: Problem Statement
You are given a string of length
N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o... - Ans.
Reverse words in a string while handling leading/trailing spaces and multiple spaces between words.
Split the input string by spaces to get individual words
Reverse the list of words
Join the reversed words with a single space in between
Handle leading/trailing spaces by stripping them before and after reversing
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview round with questions based on DSA
- Q1.
Minimum Time To Solve The Problems
Given 'N' subjects, each containing a certain number of problems, and 'K' friends, assign subjects to friends such that each subject goes to exactly one friend, maintain...
- Ans.
Assign subjects to friends to minimize maximum workload, find minimum time for most loaded friend.
Sort subjects in descending order
Assign subjects to friends one by one until all subjects are assigned
The maximum workload will be the sum of problems assigned to the friend with the most problems
Return the maximum workload as the minimum time required
- Q2. What is grammar in the context of compiler design?
- Ans.
Grammar in compiler design defines the syntax and structure of a programming language.
Grammar specifies the rules for forming valid statements in a programming language.
It consists of a set of production rules that define how valid programs can be constructed.
There are different types of grammars such as context-free grammar, regular grammar, etc.
Example: In C programming language, the grammar specifies that a for loop...
- Q3. What is a token in compiler design?
- Ans.
A token in compiler design is a basic unit of syntax that the compiler can understand and process.
Tokens are the smallest units of a program that are meaningful to the compiler.
Examples of tokens include keywords, identifiers, operators, and punctuation symbols.
Tokens are generated by the lexical analysis phase of the compiler.
Tokens are used by the parser to build the abstract syntax tree of the program.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical round with questions on DSA and Compiler Design mainly. He told me that you’ll be having your final HR round in some time. I knew that I was going well because he seemed to be quite satisfied with my answers.
- Q1.
Sum Root to Leaf Numbers
You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...
- Ans.
Find the total sum of all root to leaf paths in a binary tree formed by concatenating node values.
Traverse the binary tree from root to leaf nodes, keeping track of the current path sum
Add the current path sum to the total sum when reaching a leaf node
Use modulo (10^9 + 7) to handle large outputs
- Q2. What is a regular language?
- Ans.
A regular language is a language that can be recognized by a finite automaton.
Regular languages can be described by regular expressions.
Regular languages are closed under union, concatenation, and Kleene star operations.
Examples of regular languages include the set of all strings over an alphabet that contain an even number of 'a's.
- Q3. What are NP and NP-Hard problems?
- Ans.
NP problems are decision problems that can be verified in polynomial time, while NP-Hard problems are at least as hard as the hardest problems in NP.
NP problems can be verified in polynomial time but not necessarily solved in polynomial time.
NP-Hard problems are at least as hard as the hardest problems in NP, but may not be in NP themselves.
Examples of NP problems include the subset sum problem and the traveling salesm...
Round duration - 30 minutes
Round difficulty - Easy
That was the round for which I’ve been waiting for hours
She was very friendly and nice to talk to. It didn’t seem that I was talking to the HR. It was more like talking to a friend. Finally we discussed about the pay-scale and work culture in Accolite.
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
I applied via Naukri.com and was interviewed before May 2018. There were 5 interview rounds.
Interview Questionnaire
4 Questions
- Q1. Telephonic technical
- Q2. Core Java related exception handling ,design pattern ,oops solid design principle, rest API, different annotations of spring and jpa
- Q3. Same questions on telephonic round but detailed elaborate and given simple problem statement we had to justify that why it's time n space complexity valid. Rest API questions hibernate orm use
- Q4. Manager round just to check whether you have actually worked on project or not stress testing performance questions scenario questions
Interview Preparation Tips
Skills: Core Java sevlet JSP hibernate spring rest API, Communication, Body Language, Problem Solving, Analytical Skills, Decision Making Skills
Duration: 1-4 weeks
I appeared for an interview in Sep 2019.
Interview Questionnaire
1 Question
- Q1. Pl sql related questions
Interview Preparation Tips
Laterly after I had lunch by 2pm Hr came n told me that Manager is not available now so we will be conducting ur further round in weekdays.
Then there was no mail or call so I purposely mailed them still haven't got proper response from them, so at last I told my friend who referd me to ask for an update the same HR told him that they want Immediate joiner so we can't process him to further round. Wasted my whole day over there
Intuit Interview FAQs
Tell us how to improve this page.
Intuit Interviews By Designations
- Intuit Software Developer Interview Questions
- Intuit Senior Software Engineer Interview Questions
- Intuit Software Developer Intern Interview Questions
- Intuit Software Engineer Interview Questions
- Intuit Software Engineer2 Interview Questions
- Intuit SDE-2 Interview Questions
- Intuit Intern Interview Questions
- Intuit Senior Software Engineer 2 Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Engineer Interview Questions
- Senior Software Engineer Interview Questions
- Associate Software Engineer Interview Questions
- Softwaretest Engineer Interview Questions
- Software Engineer Trainee Interview Questions
- Software Developer Interview Questions
- Software Development Engineer Interview Questions
- Junior Software Developer Interview Questions
- Show more
Intuit Software Developer Intern Interview Process for Freshers
based on 3 interviews
1 Interview rounds
- Coding Test Round
Interview Questions from Similar Companies
Fast track your campus placements
Intuit Software Developer Intern Reviews and Ratings
based on 1 review
Rating in categories
|
Senior Software Engineer
228
salaries
|  ₹20.1 L/yr - ₹80 L/yr |
|
Software Engineer2
152
salaries
| ₹20 L/yr - ₹62 L/yr |
|
Software Engineer
102
salaries
| ₹27.6 L/yr - ₹47.6 L/yr |
|
Software Developer
53
salaries
| ₹10.2 L/yr - ₹35.4 L/yr |
|
Devops Engineer
44
salaries
| ₹4.6 L/yr - ₹16 L/yr |
Salesforce
Yodlee
Xoriant
CitiusTech
- Home >
- Interviews >
- Intuit Interview Questions >
- Intuit Software Developer Intern Interview Questions for Fresher
