Intuit Interview Experience for Summer Internship (Off-Campus)

• Date: Feb 2023
• Company: Intuit
• Location: Bangalore, India

Introduction:

I recently had the opportunity to interview for a position of summer intern at Intuit. I got this opportunity through LinkedIn and it comprised 2 technical rounds.

Round-1

• The first round was a technical round and it’s proposed duration was 45 minutes.
• Question 1: Interviewer asked the logic for this problem (https://www.geeksforgeeks.org/problems/length-of-largest-region-of-1s-1587115620/1)
• Question 2: Follow Up problem (https://leetcode.com/problems/making-a-large-island/) and was asked to code the same
• Question 3: A linked list is provided and you need to reverse only the nodes present at odd positions. The interviewer further asked if this could be done by using constant extra space and coding the same.
• Question 5: What is Polymorphism?
• Question 6: What is Paging?
• Question 7: What is Indexing & Normalisation? getting
• Suggestion: I would suggest going through previous interview experiences and to get in touch with all concepts of OS, DBMS, and OOPS.

Round-2

• The second round was also a technical round and it’s proposed duration was 90 minutes.
• Questions from OOPS
  1. Questions about Virtual Functions and was also asked to code it.
  2. Detailed Discussion on Polymorphism
  3. MCQ Questions on OOPS
  4. Operator Overloading
• Questions from OS
  1. What is the difference between multithreading & multiprocessing
  2. What is Virtual Memory
  3. What are internal & external fragmentation
  4. What is Thrashing
  5. What is Paging & Segmentation
  6. Detailed Discussion on Memory Management
• Questions from DBMS
  • What is Indexing and explain its types?
  • What is Normalization and explain different types of normalization?
  • Questions on SQL Queries
• Questions from DSA
  • Implement Heap and Heapify
  • Question similar to (https://www.geeksforgeeks.org/kth-largest-element-in-a-stream/)
  • Question on Topological Sorting
• Suggestion: I would suggest knowing the implementation of data structures like heap, binary search trees, binary trees.

Verdict: Accepted