Upload Button Icon Add office photos

Intuit

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Intuit Senior Staff Software Engineer Interview Questions and Answers

Updated 8 Oct 2024

Intuit Senior Staff Software Engineer Interview Experiences

1 interview found

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Not Selected

I applied via Approached by Company and was interviewed in Sep 2024. There was 1 interview round.

Round 1 - Technical 

(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.

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - The expectancy was to directly know the underlying technology that the interviewer was using in her team. Trying to arrive at an answer progressively to determine the technology was not appreciated. Not a good experience with the interview. They expect us to know what they are using internally, rather than focusing on interview and candidate experience.

Skills evaluated in this interview

Interview questions from similar companies

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Not Selected

I applied via Job Portal and was interviewed in Sep 2023. There were 2 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Technical 

(2 Questions)

  • Q1. LeetCode based questions
  • Q2. Data Structures and Algorithms questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Practice Data Structures and Algorithms

I applied via Company Website and was interviewed before Dec 2020. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Questions on Java,SQL,some trending technologies(IOT,Big data),pattern questions, programming questions with different approaches.

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare basics of DSA, have knowledge about the databases, some common dml ,ddl statements, programming knowledge of a particular language like C,Java, python,etc...have good command on oops concepts... little bit of frameworks knowledge will also help

I applied via Referral and was interviewed before Jan 2021. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. Java questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare basic questions

I applied via Newspaper Ad and was interviewed before Jun 2021. There were 3 interview rounds.

Round 1 - Aptitude Test 
Round 2 - Technical 

(1 Question)

  • Q1. Basic questions of java.
Round 3 - HR 

(1 Question)

  • Q1. Intro and other hr related questions.

Interview Preparation Tips

Interview preparation tips for other job seekers - Cover the basic questions regarding the programming language.

I applied via Approached by Company and was interviewed before Apr 2021. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Aptitude Test 

My resume

Round 3 - HR 

(3 Questions)

  • Q1. What are your salary expectations?
  • Q2. What are your strengths and weaknesses?
  • Q3. Tell me about yourself.

Interview Preparation Tips

Interview preparation tips for other job seekers - I like the it companies and technologies

Interview Questionnaire 

20 Questions

  • Q1. He asked me my specialization?
  • Q2. Why not further studies? (He had noted that I was third in my batch. He appeared impressed by that
  • Q3. He asked me to tell him about my favorite project
  • Q4. He then looked at my grades. He commented that my lowest grade – B- was in Digital Image Processing. I just looked at him like a doofus thinking of what to say. But he quickly added, ‘don’t worry, it happe...
  • Q5. He then asked me a question that had been asked in Round 4, written test:Describe an optimal algorithm to find the second minimum number in an array of numbers. What is the exact number of comparisons requ...
  • Q6. Given a polygon (could be regular, irregular, convex, concave), find out whether a particular point lies inside it or outside it
  • Ans. 

    To determine if a point is inside a polygon, use the ray casting algorithm.

    • Create a line from the point to a point outside the polygon

    • Count the number of times the line intersects with the polygon edges

    • If the count is odd, the point is inside the polygon; otherwise, it is outside

  • Answered by AI
  • Q7. He asked me to explain Canny’s algorithm to him. (this was because my DIP project was related to this)
  • Q8. Then, he gave me a practical problem to solve: Suppose you are given an image which contains some text and some photos. How do you find the location of the image?
  • Q9. Which are the four storage classes in C
  • Ans. 

    The four storage classes in C are auto, register, static, and extern.

    • Auto: default storage class for all local variables

    • Register: used to define local variables that should be stored in a register instead of RAM

    • Static: used to define local variables that retain their value between function calls

    • Extern: used to declare a global variable that is defined in another file

  • Answered by AI
  • Q10. Given a program: int i; int main() { int j; int *k = (int *) malloc (sizeof(int)); … } Where are each of these variables stored?
  • Ans. 

    i is stored in global data segment, j is stored in stack, k is stored in heap.

    • i is a global variable and is stored in the global data segment

    • j is a local variable and is stored in the stack

    • k is a pointer variable and is stored in the stack, while the memory it points to is allocated on the heap using malloc()

  • Answered by AI
  • Q11. Question on polymorphisms
  • Q12. He again went back to the first question he had asked me. Once again
  • Q13. Then he wrote out some code and asked me how the compiler will generate code for it. I gave some answer, but he was clearly not satisfied. I thought it was all over by then. Then, he asked me a DIP quest...
  • Q14. Given a set of words one after another, give me a data structure so that you’ll know whether a word has appeared already or not
  • Ans. 

    Use a hash table to store the words and check for existence in constant time.

    • Create a hash table with the words as keys and a boolean value as the value.

    • For each new word, check if it exists in the hash table. If it does, it has appeared before. If not, add it to the hash table.

    • Alternatively, use a set data structure to store only the unique words and check for existence in the set.

  • Answered by AI
  • Q15. He asked me some questions on Interprocess Communication: What’s a semaphore? How are they used? He would often pick out words from my answers and ask me what they meant. He wanted to make sure that I rea...
  • Q16. He then asked me some DB fundas. Transaction. Serializability, Consistent state, etc
  • Q17. Finally, he asked me whether I had any questions
  • Q18. There is a clock at the bottom of the hill and a clock at the top of the hill. The clock at the bottom of the hill works fine but the clock at the top doesn’t. How will you synchronize the two clocks. Obv...
  • Q19. There was one more puzzle.. I don’t remember it. but I do remember that we started discussing ways of generating large prime numbers
  • Q20. We also talked a bit about my phone browser project

Interview Preparation Tips

Round: Test
Duration: 15 minutes
Total Questions: 1

Round: Test
Duration: 30 minutes
Total Questions: 2

Round: Test
Duration: 30 minutes
Total Questions: 3

Round: Test
Total Questions: 4

Round: Technical Interview
Experience: 1.When I told him that I had none as I didn’t want to specialize in this stage, he was a little surprised but appeared satisfied with my reason.2.I told him that my profile clearly indicated that I’ve been trying to get into the industry via internships, industry-funded projects right from second year, second sem. I said that I was fully sure that I didn’t want to do MS anytime soon.3.I told him about the web-browser that I had developed for cell-phones. I thought that was the only project which was closest to what Adobe was working on. He appeared satisfied with my answers.4. So people, be fully prepared to explain any anomalous grades. I was prepared with the explanation of the W in the my grade-sheet but not of the B- in DIP. I know that this is really stupid considering that I was interviewing with Adobe. Don’t make this mistake.5.I screwed up, big time in this question. I had superficially discussed this question with my friend a while ago and he had outlined an algorithm which I thought that I had understood, but I hadn’t. I started off explaining it but got stuck in the middle. He sternly told me to read it up again. One solution that I could tell him, and which I had written in the test was this Use two variables – min and second min. Initialize them by comparing the first two elements of the array. This is (1) comparison. Then, go through the entire array, from index 2 to n-1 comparing each element, first with min and then with second min, updating each variable as necessary. This will involve a worst case of two comparisons for each element. Therefore, total number of comparisons = 2*(n-2) + 1 = 2*n – 3 comparisons.I’ll try to update this with a better solution, sometime soon.6.This is an easy, straight question from graphics. You shoot a ray parallel to the x-axis passing through this point. Start with odd parity. Change parity of ray each time it intersects an edge of the polygon (consider special case of when the line passes through a vertex of the polygon. Change parity only if it passes through a vertex which has one edge above it and one edge below the ray). If the parity of ray is even when it passes through the point, it is inside the polygon, else it is not.7.This is simple. Study DIP8.I gave various alternatives – from searching for RGB components, to using OCR.. he didn’t appear fully satisfied. I think he was looking for edge-detection, but that would fail, if the text contained tables, etc.

Round: Technical Interview
Experience: He was friendly at the start but this interview was my worst. He asked me my favorite subject. I said that it was Programming. (He laughed at that)

1. static, extern, register, auto2.I started off correctly, but he was able to confuse me. He brought in shared libraries, static libraries fundas into the discussion. We had a discussion for about twenty-minutes on this. Finally, he was happy with one of my answers because I had deduced which policy made sense and answered correctly. He said that out of all the people interviewed so far (I was second last), nobody had been able to answer all of these questions correctly.3.this is easy – get it from any C++ book. He tried to confuse me again, but this time I was ready and he was finally satisfied.Then he looked at my grades and said that out of all your grades, you have only two Bs and one of them is in Compilers. Why? (Damn it. three non-A grades and that’s all they ask about. What’s wrong with this world?!)Didn’t you like Compilers? “Not in particular”, I replied. “Fine. Now, I HAVE to ask you questions on compilers”, he said.4.He again went back to the first question he had asked me. Once again5.I first suggested that we capture only a small portion of the board. To locate that portion, we could search for the chalk in the prof’s hand – of course, taking care that it had the blackboard in the background (no point capturing a video of the prof scratching his chin, na?). Further, if the prof was writing only text, we could convert the video into text by OCR and then transmitting. Simple diagrams could also be reduced to a set of vector-graphics instructions (we rarely, see the prof shading stuff). I think he liked my approach, but was not completely satisfied. Anyway, we left it at that and went forward.6.I suggested various alternatives. but he kept helping me and finally, we came up with an array of pointers to 26-trees (each node of the tree has 26 children). Store every word as a path from the root to a leaf with pointers in the correct places. For example, hello would be stored as – pointer from ‘h’ index of the root array to a node which had a pointer from ‘e’ index of it’s array to a node which had a pointer from ‘l’ index of the array.. and so on. This is both time and space efficient.7.I was able to answer all his questions, but I made the mistake of telling him, when we started off that I didn’t know much about this subject as I had done it a long time ago. He was very annoyed at that, apparently because a lot of people before me had said this.8.I was able to answer all of them. I stumbled around a bit in a few questions where I was explaining correctly, but not using the keywords that he was looking for.9.I thought that I should say something to make him realize that I was not completely stupid and so asked him whether there was any logic to the order in which the short-listed candidates were called. This turned out to be a dumb move. The order was alphabetic and he sent me off with a parting shot, saying “You guys do pattern recognition and stuff and still you can’t recognize such a simple pattern” Me and my big mouth! Moral of the story: Don’t ask questions for the sake of asking.

Round: Puzzle Interview
Experience: After the first two interviews, this one was like having a warm batch after being cold and wet for days! I did well in this one.1.You have to go up the hill and come back, with horse, without horse, getting four equations to solve four unknowns – time to go uphill – with horse, without horse, time to go downhill – with horse, without horse. Then you can go up the hill and set the clock to ‘(time when you left) + (time to go uphill with horse)’2.  I told him the funda of Mersenee primes (luckily remembered it) and he was decently impressed.

General Tips: Finally hired by Adobe. Special thanks to AmbitionBox team. Really amazing site for sharing experience. That’s all for the Adobe. They are focusing on your approach and your coding skills. All the best.
Skills: Algorithm, Data structure, C++, C, DIP
College Name: BIT Mesra

Skills evaluated in this interview

I was interviewed before Oct 2021.

Round 1 - Aptitude Test 

There are technical and objective questions

Round 2 - Group Discussion 

They asked about projects and asked to speak on any topics.

Round 3 - HR 

(2 Questions)

  • Q1. What is the preferred location? Where do I want to see myself in 5 years?
  • Q2. What are expectations from the company?

Interview Preparation Tips

Interview preparation tips for other job seekers - Just keep basic knowledge of data structure. Solve Objectives questions.

Intern Interview Questions & Answers

TCS user image Anonymous

posted on 2 Jun 2022

I applied via Newspaper Ad and was interviewed before Jun 2021. There were 2 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - HR 

(1 Question)

  • Q1. Please Give introduction

Interview Preparation Tips

Interview preparation tips for other job seekers - Good luck with your interview. You need it

I applied via Referral and was interviewed before Apr 2021. There were 2 interview rounds.

Round 1 - Aptitude Test 

Puzzles, Psychometric Test

Round 2 - One-on-one 

(1 Question)

  • Q1. Some water in 3 Jars question, you had to measure out 5L correctly

Interview Preparation Tips

Interview preparation tips for other job seekers - Make the interview interactive, I got this input from another Senior. Before i went into the interview room the volunteers were telling all those who goes into Room No 1 is screwed. I was praying i don't get room no 1. But fortunately for me I got room no 1 because when the interviewer gave me the puzzle and handed over pen and paper he went back to relax his posture and when i explained i will fill the 5L Jar first, he immediately came forward to listen to me, at that moment i knew i got the job because i felt the previous candidates never made their interview interactive and that's why he went back to relax his posture.
Contribute & help others!
anonymous
You can choose to be anonymous

Intuit Interview FAQs

How many rounds are there in Intuit Senior Staff Software Engineer interview?
Intuit interview process usually has 1 rounds. The most common rounds in the Intuit interview process are Technical.
How to prepare for Intuit Senior Staff Software Engineer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Intuit. The most common topics and skills that interviewers at Intuit expect are Java, AWS, Rest, Agile Development and Data Structures.
What are the top questions asked in Intuit Senior Staff Software Engineer interview?

Some of the top questions asked at the Intuit Senior Staff Software Engineer interview -

  1. Given a string of parenthesis, determine if it forms valid parenthesis or n...read more
  2. Very broad generic system design question, where she was trying to know all tha...read more

Recently Viewed

LIST OF COMPANIES

Discover companies

Find best workplace

INTERVIEWS

BIZONGO

No Interviews

INTERVIEWS

Confluent

No Interviews

INTERVIEWS

Confluent

No Interviews

INTERVIEWS

Confluent

No Interviews

INTERVIEWS

BIZONGO

No Interviews

INTERVIEWS

BIZONGO

No Interviews

INTERVIEWS

Intuit

No Interviews

INTERVIEWS

Arms

No Interviews

INTERVIEWS

Intuit

No Interviews

Tell us how to improve this page.

Intuit Senior Staff Software Engineer Interview Process

based on 1 interview

Interview experience

3
  
Average
View more

Interview Questions from Similar Companies

TCS Interview Questions
3.7
 • 10.4k Interviews
Accenture Interview Questions
3.8
 • 8.1k Interviews
Infosys Interview Questions
3.6
 • 7.5k Interviews
Wipro Interview Questions
3.7
 • 5.6k Interviews
IBM Interview Questions
4.0
 • 2.3k Interviews
Oracle Interview Questions
3.7
 • 846 Interviews
SAP Interview Questions
4.2
 • 283 Interviews
CitiusTech Interview Questions
3.4
 • 269 Interviews
Adobe Interview Questions
3.9
 • 233 Interviews
View all
Senior Software Engineer
219 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer2
146 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
126 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Devops Engineer
45 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Staff Software Engineer
43 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Intuit with

Salesforce

4.0
Compare

Yodlee

3.8
Compare

SAP

4.2
Compare

Oracle

3.7
Compare
Did you find this page helpful?
Yes No
write
Share an Interview