Intuit interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Intuit
2 rounds | 4 Coding
problems
Rejected
Interview preparation journey
Journey
I recently went through two interview rounds at Intuit, which was a highly valuable learning experience. The first round focused on DSA, testing not just problem-solving ability but also clarity of thought, edge-case handling, and code optimization under time constraints. The second round was a recruiter screening, where the discussion centred on my projects, technical depth, career goals, and cultural fit. What stood out was the structured, respectful interview process and the emphasis on real-world impact over rote answers. Overall, the experience strengthened my confidence, highlighted areas for improvement, and reaffirmed my interest in building scalable, user-centric software systems.
Application story
I applied for the role through the official Intuit careers portal after coming across the opening online. After submitting my application, I received a follow-up from the recruitment team to proceed with the interview process. The communication throughout was clear and timely, with proper guidance shared at each stage. The process was well-structured and professionally managed, starting with an initial screening and moving forward step by step toward the interviews. Overall, the journey felt smooth, transparent, and candidate-friendly, making it a positive and insightful application experience.
Why selected/rejected for the role?
I was not selected for the role, but the experience was an important learning milestone. I believe I performed well in problem-solving and communication; however, the process highlighted that depth and consistency under pressure play a crucial role in competitive interviews. The feedback—both explicit and implicit—showed me the importance of writing clean, optimal solutions quickly and clearly explaining trade-offs. This rejection helped me identify gaps in speed and edge-case handling, pushing me to refine my preparation strategy. Overall, it strengthened my mindset, improved my approach to interviews, and better prepared me for future opportunities.
Preparation
Duration: 3 months
Topics: Data Structures, Algorithms, Dynamic Programming, Graphs, Trees, Arrays & Strings, Recursion, Time & Space Complexity
Tip 1: Practice DSA consistently with a focus on understanding patterns rather than memorizing solutions.
Tip 2: Analyse every mistake after solving problems and revise weak topics regularly.
Application process
Where: Company Website
Eligibility: NA, (Salary package: 27 LPA)
Tip 1: Keep your resume concise and impact-driven, highlighting measurable results and real contributions instead of generic responsibilities.
Tip 2: Showcase strong projects with clean GitHub links, and ensure every skill mentioned is something you can confidently explain and defend in an interview.
Interview rounds
01
Round
Easy
Online Coding Test
Duration90 minutes
Interview date15 Jan 2026
Coding problem3
1. Longest Substring Without Repeating Characters
Moderate
30m average time
65% success
0/80
Asked in companies
Given a string input of length n, find the length of the longest substring without repeating characters i.e return a substring that does not have any repeating characters.
Substring is the continuous sub-part of the string formed by removing zero or more characters from both ends.
Problem approach
Step 1: I first thought of a brute-force approach where I check all possible substrings and verify if each substring has unique characters. I realized this would take too much time for large inputs.
Step 2: I identified that the problem could be optimized using the sliding window technique with two pointers to maintain a window of unique characters.
Step 3: I used a hash set (or map) to keep track of characters in the current window. When a duplicate character appeared, I moved the left pointer forward until the window became valid again.
Step 4: At each step, I updated the maximum length of the valid window.
Step 5: This reduced the time complexity to O(n), and the solution handled all edge cases efficiently.
2. Merge Intervals
Moderate
20m average time
80% success
0/80
Asked in companies
You are given N number of intervals, where each interval contains two integers denoting the start time and the end time for the interval.
The task is to merge all the overlapping intervals and return the list of merged intervals sorted by increasing order of their start time.
Two intervals [A,B] and [C,D] are said to be overlapping with each other if there is at least one integer that is covered by both of them.
For example:
For the given 5 intervals - [1, 4], [3, 5], [6, 8], [10, 12], [8, 9].
Since intervals [1, 4] and [3, 5] overlap with each other, we will merge them into a single interval as [1, 5].
Similarly, [6, 8] and [8, 9] overlap, merge them into [6,9].
Interval [10, 12] does not overlap with any interval.
Final List after merging overlapping intervals: [1, 5], [6, 9], [10, 12].
Problem approach
Step 1: I first understood the problem clearly and identified that overlapping intervals need to be combined into a single interval.
Step 2: I realized that sorting the intervals by their start time is necessary to process them in order.
Step 3: After sorting, I initialized a result list and started comparing the current interval with the last merged interval.
Step 4: If the intervals overlapped, I merged them by updating the end time; otherwise, I added the interval as a new entry.
Step 5: Finally, I returned the merged list, which handled all edge cases efficiently with optimal time complexity.
3. Maximum Subarray Sum
Moderate
0/80
Asked in companies
You are given an array/list ARR consisting of N integers. Your task is to find the maximum possible sum of a non-empty subarray(contiguous) of this array.
Note: An array C is a subarray of array D if it can be obtained by deletion of several elements(possibly zero) from the beginning and the end of array D.
For e.g.- All the non-empty subarrays of array [1,2,3] are [1], [2], [3], [1,2], [2,3], [1,2,3].
Problem approach
Step 1: I first thought of a brute-force approach, checking all possible subarrays and calculating their sums. This helped me understand the problem clearly, but the time complexity was too high.
Step 2: I realized the brute-force solution was inefficient, so I focused on optimizing it by avoiding repeated sum calculations.
Step 3: I applied Kadane’s Algorithm, where I maintained a running sum and reset it whenever it became negative, while tracking the maximum sum found so far.
Step 4: I handled edge cases like arrays with all negative numbers.
Step 5: The final solution worked in O(n) time and O(1) space, which met the expected efficiency.
02
Round
Easy
HR Round
Duration30 minutes
Interview date21 Jan 2026
Coding problem1
Timing: The round was conducted during regular working hours, not late night.
Environment: The environment was calm, professional, and well-organized, which made the conversation comfortable and smooth.
Other Significant Activity: The recruiter clearly explained the role, team expectations, and overall hiring process, and also discussed my background and career goals.
Interviewer: The recruiter was friendly, attentive, and supportive, creating an open discussion rather than a stressful interview. The interaction felt more like a two-way conversation focused on mutual fit.
1. HR Questions
- Tell me about yourself and your current role.
- Walk me through your resume and key projects.
- Why are you interested in Intuit and this role?
- What kind of problems do you enjoy working on?
- How do you approach learning a new technology quickly?
- Describe a challenging situation you faced and how you handled it.
- What are your strengths and areas you are working to improve?
- Where do you see yourself in the next few years?
Problem approach
Tip 1: Be structured and honest: I answered in a clear flow (context → action → outcome) instead of long stories.
Tip 2: Connect answers to impact: I linked my experiences to problem-solving, ownership, and learning mindset.
Tip 3: Show growth mindset: For weaknesses or failures, I focused on what I learned and how I improved.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
How do you remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
SDE - 1
2 rounds | 3 problems
Interviewed by Intuit
Selected 
2208 views
0 comments
0 upvotes
SDE - 1
2 rounds | 4 problems
Interviewed by Intuit
Rejected
1230 views
0 comments
0 upvotes
SDE - 1
1 rounds | 2 problems
Interviewed by Intuit
Rejected
1310 views
0 comments
0 upvotes
SDE - 1
3 rounds | 6 problems
Interviewed by Intuit
Selected 1451 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
Selected 115097 views
24 comments
0 upvotes
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
Selected 58238 views
5 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
Selected 35147 views
7 comments
0 upvotes