Intuit Interview Experience for SDE Internship (Off-Campus)

The first round was the resume selection round, followed by 1 Online Coding Round in the HackerRank platform, 2 Technical Interview Rounds,s and the HR Round.

Coding Round:
Total Four questions were asked in the coding round. One question was easy, two questions were of medium level and one was of hard level. I was able to solve 3 questions completely i.e. easy and medium questions and passed some of the test cases for a hard one. Questions were based on arrays, strings, and trees.

Technical Interview Round 1:

The interview started with my introduction, explanation as well as my contribution to the projects which I mentioned in my resume.
After that, the interview was started and I was asked both computer fundamental questions based on SQL queries, OOPs, OS as well as DSA questions.

In computer fundamentals I was asked the following questions:

1. What is a database and database management system and why it is preferred over traditional file management systems? I was knowing the answer very well and explained it very clearly.
2. In the second question, I was supposed to write the SQL query as per the conditions given by the interviewer. In this, I was supposed to write the query in the editor (the editors link was previously given by them in the mail). For this question, I was able to give two methods one by writing from scratch and the other by using prebuilt functions.
3. The third question I was asked was based on the OOPs concept. I was asked about the pillars of OOPs. After this, I was asked to explain polymorphism and its types with some examples.
4. The fourth question was about the difference between function overloading and overriding.
5. The last question was based on OS i.e. Explain the threading concept in OS

Then came the DSA question in which I was asked 2 coding questions and then there was a kind of rapid-fire based on DSA concepts.

1. The first question was very easy where I needed to Reverse the doubly linked list. I started with the brute force approach and ended with the optimal solution to this problem. I need to run the whole code in the compiler and show the output to the interviewer.
2. The second question was based on the array. Given an array arr[] and an integer K, the task is to find the maximize the sum of K elements in the Array by taking only corner elements. The first approach which I gave was not correct for all the cases. So the interviewer asked me to give an example in which my approach will be failed and asked me to come up with a new approach. Later I came up with a sliding window approach which was correct and passed all the test cases correctly.

After that, I was supposed to answer the following DSA-based questions,

1. What is the difference between a list and a vector?
2. When to use a list and when to use a vector?
3. Complexity for insertion in list and vector.
4. The time complexity for searching an element in a Binary tree.
5. Worst case time complexity for searching element in BST.
6. How to convert BT to BST?

Although my interview went well unfortunately I was not selected for the next Interview Round. But I learned a lot from this interview and it was a good experience for me as in this interview I was supposed to answer the questions based on multiple computer fundamental concepts.
I hope my experience will help you with the interview preparation. Hoping for the best for you guys and Best of Luck!!