Intuit interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Intuit
1 rounds | 2 Coding
problems
Rejected
Interview preparation journey
Preparation
Duration: 3 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip 1 : Prepare your resume well.
Tip 2 : Deploy your projects so that the interviewer can view it. Also provide a hyperlink on your resume.
Tip 3 : Be thorough with Data Structures and Algorithms. Also prepare well topics such as OS,DBMS.
Application process
Where: Campus
Eligibility: Above 6.5 CGPA
Tip 1 : Deploy your projects so that the interviewer can view it. Also provide a hyperlink on your resume
Tip 2 : It's not important to have fancy projects. Only mention those on which you're confident.
Interview rounds
01
Round
Easy
Video Call
Duration45 mins
Interview date27 Aug 2022
Coding problem2
1. Two Sum
Easy
10m average time
90% success
0/40
Asked in companies
You are given an array of integers 'ARR' of length 'N' and an integer Target. Your task is to return all pairs of elements such that they add up to Target.
Note:
We cannot use the element at a given index twice.
Follow Up:
Try to do this problem in O(N) time complexity.
Problem approach
You are given an array of integers 'ARR' of length 'N' and an integer Target. Your task is to return all pairs of elements such that they add up to Target.
2. Increasing Subsegment
Moderate
15m average time
80% success
0/80
Asked in companies
Gary has a sequence 'ARR', consisting of 'N' integers.
We'll call a sequence ARR[i], ARR[i+1], ..., ARR[j] where 1 ≤ i ≤ j ≤ N a subsegment of the sequence ARR. The value (j - i + 1) denotes the length of the subsegment.
Your task is to find the longest subsegment of ARR, such that it is possible to change at most one number (change one number to any integer you want) from the subsegment to make the subsegment strictly increasing.
You need to return the length of the maximum subsegment that you can find by changing only one integer in the given sequence.
Problem approach
Gary has a sequence 'ARR', consisting of 'N' integers.
We'll call a sequence ARR[i], ARR[i+1], ..., ARR[j] where 1 ≤ i ≤ j ≤ N a subsegment of the sequence ARR. The value (j - i + 1) denotes the length of the subsegment.
Your task is to find the longest subsegment of ARR, such that it is possible to change at most one number (change one number to any integer you want) from the subsegment to make the subsegment strictly increasing.
You need to return the length of the maximum subsegment that you can find by changing only one integer in the given sequence.
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
3 rounds | 6 problems
Interviewed by Intuit
Selected 1452 views
0 comments
0 upvotes
SDE - 1
2 rounds | 4 problems
Interviewed by Intuit
Rejected
163 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