AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Intuit Interview Questions and Answers
98 Interview questions
Count Pairs with Given Sum
Given an integer array/list arr and an integer 'Sum', determine the total number of unique pairs in the array whose elements sum up to the given 'Sum'.
Input:
The first line co...Count the total number of unique pairs in an array whose elements sum up to a given value.
Use a hashmap to store the frequency of each element in the array.
Iterate through the array and for each element, check if (Sum - current element) exists in the hashmap.
Increment the count of pairs if the complement exists in the hashmap.
Divide the count by 2 to avoid counting duplicates like (arr[i], arr[j]) and (arr[j], arr...
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 th...
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.
Handl...
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' -> 'L...
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...
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, 8...
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.
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 palindr...
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
Maximum Non-Adjacent Subsequence Sum
Given an array of integers, determine the maximum sum of a subsequence without choosing adjacent elements in the original array.
Input:
The first line consists of an ...
Find the maximum sum of a subsequence without choosing adjacent elements in an array.
Use dynamic programming to keep track of the maximum sum at each index, considering whether to include the current element or not.
At each index, the maximum sum can be either the sum of the current element and the element two positions back, or the maximum sum at the previous index.
Iterate through the array and update the maximum ...
Generate All Parentheses Combinations
Given an integer N, your task is to create all possible valid parentheses configurations that are well-formed using N pairs. A sequence of parentheses is considered we...
Generate all valid parentheses combinations for N pairs.
Use backtracking to generate all possible combinations of parentheses.
Keep track of the number of open and close parentheses used.
Add '(' if there are remaining open parentheses, and add ')' if there are remaining close parentheses.
Stop when the length of the generated string is 2*N.
Detect the First Node of the Loop in a Singly Linked List
You are provided with a singly linked list that may contain a cycle. Your task is to return the node where the cycle begins, if such a cycle exists...
To detect the first node of a loop in a singly linked list, we can use Floyd's Cycle Detection Algorithm.
Use Floyd's Cycle Detection Algorithm to detect the cycle in the linked list.
Once the cycle is detected, find the starting node of the cycle using two pointers approach.
The first pointer moves one step at a time while the second pointer moves two steps at a time until they meet at the starting node of the cycle...
Inorder Successor in a Binary Tree
Find the inorder successor of a given node in a binary tree. The inorder successor is the node that appears immediately after the given node during an inorder traversal. ...
Find the inorder successor of a given node in a binary tree.
Perform an inorder traversal of the binary tree to find the successor node
If the given node has a right child, the successor is the leftmost node in the right subtree
If the given node does not have a right child, backtrack to find the ancestor whose left child is the given node
Word Presence in Sentence
Determine if a given word 'W' is present in the sentence 'S' as a complete word. The word should not merely be a substring of another word.
Input:
The first line contains an int...Check if a given word is present in a sentence as a complete word.
Split the sentence into words using spaces as delimiter.
Check if the given word matches any of the words in the sentence.
Ensure the word is not just a substring of another word in the sentence.
Intuit Interview Experiences
80 interviews found
Anonymous
DSA based on any general language prefer C++
(3 Questions)
- Q1. DBMS, BST, Sieve of Erathnus, Dynamic Programming
- Q2. Debugging c++ code
- Ans.
Debugging C++ code involves identifying and fixing errors to ensure the program runs correctly and efficiently.
Use a debugger tool like gdb to step through code and inspect variables.
Check for common errors such as off-by-one errors in loops, e.g., accessing array[10] instead of array[9].
Utilize print statements to trace the flow of execution and variable values.
Review compiler warnings and errors carefully; they often...
- Q3. OOPS based question
(1 Question)
- Q1. General questions and some questions on personality
I applied via LinkedIn and was interviewed in Nov 2024. There were 2 interview rounds.
Glider coding test
1 easy and 1 medium leetcode question
(2 Questions)
- Q1. Min cost of painting the houses, given no two adjacent houses are of same color
List
input ={[17,2,17],[16,16,5],[14,3,19]} To be solved using dynamic programming - Ans.
Dynamic programming solution to find minimum cost of painting houses with no adjacent houses of same color
Create a 2D dp array to store the minimum cost of painting each house with each color
Iterate through each house and each color option, updating the dp array with the minimum cost
Return the minimum cost of painting the last house
- Q2. Questions on multithreading and different type of thread pool
Interview Preparation Tips
- Dynamic Programming
I applied via Approached by Company and was interviewed in Sep 2024. There was 1 interview round.
(2 Questions)
- Q1. Very broad generic system design question, where she was trying to know all that I know of. Not a focused system design question to focus on any particular aspect.
- Q2. Given a string of parenthesis, determine if it forms valid parenthesis or not.
- Ans.
Check if a string of parenthesis is valid or not.
Use a stack to keep track of opening parenthesis.
Iterate through the string and push opening parenthesis onto the stack.
When encountering a closing parenthesis, pop from the stack and check if it matches the corresponding opening parenthesis.
If stack is empty at the end and all parenthesis have been matched, the string is valid.
Interview Preparation Tips
Skills evaluated in this interview
I applied via Company Website and was interviewed in Nov 2024. There were 2 interview rounds.
Good experience with the coding with medium difficulty questions
(2 Questions)
- Q1. Dbms related queries
- Q2. OS practical questions
Selected
I applied via Approached by Company and was interviewed in Jul 2024. There were 3 interview rounds.
(2 Questions)
- Q1. Why and How Intuit? What would make you a fit.
- Ans.
Intuit's innovative culture and focus on customer-centric solutions align with my passion for driving business growth through data-driven insights.
Intuit's reputation for developing cutting-edge financial software solutions appeals to my interest in leveraging technology to drive business success.
I admire Intuit's commitment to customer satisfaction and believe my analytical skills can contribute to enhancing user expe...
- Q2. Previous roles and responsibilities
- Ans.
I have experience as a Business Analyst in the software industry, where I analyzed user requirements and translated them into functional specifications.
Analyzed user requirements to understand business needs
Translated requirements into functional specifications for development team
Collaborated with stakeholders to ensure project success
(2 Questions)
- Q1. Presentational Skills
- Q2. How you are the best fit for this role
- Ans.
I have a strong background in analyzing product data and identifying business opportunities.
Extensive experience in analyzing market trends and customer feedback to drive product improvements
Proven track record of successfully launching new products and optimizing existing ones
Strong communication skills to collaborate with cross-functional teams and stakeholders
Proficient in using data analysis tools and techniques to...
(1 Question)
- Q1. Provided instructions and questions based on it.
Interview Preparation Tips
Aamir Khakhu
Selected
I appeared for an interview in Apr 2025, where I was asked the following questions.
- Q1. Design a system similar to Splitwise that facilitates the tracking and settling of shared expenses among users.
- Ans.
A system for tracking and settling shared expenses among users, enhancing transparency and simplifying financial interactions.
User Registration: Users can create accounts using email or social media, allowing them to manage their expenses and connections easily.
Expense Tracking: Users can log expenses with details like amount, date, and category (e.g., dinner, rent), making it easy to track who owes what.
Group Manageme...
- Q2. Database partitioning and sharding
I applied via Recruitment Consulltant and was interviewed in May 2024. There were 2 interview rounds.
(2 Questions)
- Q1. Rest API retry based questions.
- Q2. Data access layer questions
(2 Questions)
- Q1. Dad algo based question
- Q2. Dad algo based question 2
Interview Preparation Tips
Selected
(1 Question)
- Q1. Design Rate Limiter
Selected
I appeared for an interview in Apr 2025, where I was asked the following questions.
- Q1. Solve tree problem
- Q2. Implement snake LLD
Srinivas Damam
Html, js and css concepts
Binary search related questions
(2 Questions)
- Q1. Projects handled at the current organisation
- Ans.
Developed and maintained multiple web applications for internal use
Led a team in redesigning the company's main website to improve user experience
Implemented new features and functionalities based on user feedback
Optimized existing codebase to improve performance and scalability
Integrated third-party APIs to enhance application capabilities
- Q2. How to figure errors before customers report it
- Ans.
Implement automated monitoring and logging to proactively detect errors before customers report them.
Set up automated monitoring tools to track system performance and detect anomalies
Implement logging mechanisms to capture errors and exceptions in real-time
Utilize error tracking software to aggregate and analyze error data
Establish alerts and notifications for critical errors to prompt immediate action
Regularly review ...
Skills evaluated in this interview
Top trending discussions
Intuit Interview FAQs
Some of the top questions asked at the Intuit interview -
The duration of Intuit interview process can vary, but typically it takes about less than 2 weeks to complete.
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 Developer Interview Questions
- Senior Software Engineer Interview Questions
- Software Developer Intern Interview Questions
- Software Engineer Interview Questions
- Software Engineer2 Interview Questions
- Business Analyst Interview Questions
- Sales Executive Interview Questions
- Associate Software Engineer Interview Questions
- Show more
Overall Interview Experience Rating
based on 59 interview experiences
Difficulty level
Duration
Interview Questions from Similar Companies
Intuit Reviews and Ratings
based on 208 reviews
Rating in categories
|
Senior Software Engineer
334
salaries
|  ₹35 L/yr - ₹59 L/yr |
|
Software Engineer2
166
salaries
| ₹30 L/yr - ₹51.2 L/yr |
|
Software Engineer
125
salaries
| ₹23.7 L/yr - ₹39.5 L/yr |
|
Staff Software Engineer
57
salaries
| ₹46.4 L/yr - ₹81 L/yr |
|
Software Developer
43
salaries
| ₹18.6 L/yr - ₹33.5 L/yr |
Salesforce
Yodlee
Xoriant
CitiusTech
- Home >
- Interviews >
- Intuit Interview Questions
