INTUIT SWE Intern - 2026 (oncampus) interview experience
Summary
I interviewed for a SWE Intern position at Intuit's on‑campus program, completed the OA and two technical rounds, and was selected.
Full Experience
Hii, few months back I completed Intuit's swe intern interview conducted on-campus (NSUT-Delhi).
I'll be sharing my experience:
It consisted of total 3 rounds - OA, and two technical interviews.
OA:
OA was conducted on campus in a proctored environment on glider (coding platform). OA has 4 questions - easy to hard.
One was a simple prefix sum (where my dumbass applied segment tree, tho passed all the test cases).
one was a standard heap question of finding median in a data stream,
One was a direct leetcode question "Alien dictionary" and one was a dungeon game question where we had a grid containing numbers that contains how many health points will a guy get if he enters this cell. I had to output the minimum health required to start the game so that throughout the progress (from 0,0 to n-1,n-1) health wouldn't go negative. I did it using BFS+binary search.
I basically did all the questions and the shortlist was released a week later and I made it to the interviews. 16 students made it to the interviews.
Interviews:
We were told that interviews will be conducted in a virtual mode in the TnP building for proctoring purposes.
Technical Interview 1:
My first interview was very fun actually, interviewer introduced himself, I introduced myself, He started scanning my resume and asked me to explain the projects that I had on my resume. I did and few follow up questions were there about how did I save the vectors and like that(It was a ML project). 20mins passes by then he asked me which is my favourite cs core subject, I answered with OOPS. He basically told me to tell him about OOPS from the very scratch till whatever I know. I was prepared very well for the OOPS part and the interviewer was impressed.
He further asked me questions on whether I had worked on some production level project or not and few other cs related questions.
Shortlist was sent shortly and 8 people were on the technical-round 2, and I was also one of them.
Technical Interview 2:
This round was focussed heavily on DSA part. Interviewer asked me to open glider and gave me question which was basically LRU cache and told me to implement it from scratch (writing main too). I did it, had some error in first time, did some debugging and all the test cases he gave, passed clearly.
Then he went on asking about types of constructors, destructors, heaps and how would one implement mutex (locks) because of the heavy incoming traffic, which I answered fairly.
Now he moved on to the OS side, asked me about scheduling algorithms, asked me about threads and the differences between the threads and processes. Why doesn't chrome crash if one of the tabs crashes out??
Then we moved to the dbms part, they wrote a query, I was asked to improve it, I suggested using indexing (B+ Trees) but the interviewer was expecting views and I was not well brushed with views so I simply said I don't remember that well about views.
He then went on asking about dictionaries in the DBMS, Normalizations, caching and few other concepts. I was not well with the dbms concepts so I was kind of dicey for my selection.
After few hours, around 7:28pm same day, got the result.
FINAL RESULT - SELECTED.
They selected 4 students in total.
Interview Questions (4)
Find Median in a Data Stream
Design a data structure that supports the following operations:
- Insert(num): Add a number to the data stream.
- GetMedian(): Return the median of all inserted numbers.
The median is the middle value after the numbers are sorted. If there are an even number of elements, the median is the average of the two middle values. The goal is to achieve each operation in O(log n) time.
Alien Dictionary
Given a list of words sorted lexicographically according to an unknown alien language, derive a possible order of characters in that language.
Each word is a string of lowercase English letters. The input guarantees that there is at least one valid ordering.
Dungeon Game
A 2D grid represents a dungeon where each cell contains an integer indicating health points gained (positive) or lost (negative) when the player enters the cell. The player starts at the top‑left cell (0,0) and must reach the bottom‑right cell (n‑1,m‑1) moving only right or down. The player’s health must never drop to zero or below. Determine the minimum initial health required to start so that the player can reach the goal alive.
Implement LRU Cache
Design and implement an LRU (Least Recently Used) cache with the following API:
- LRUCache(int capacity): Initialize the cache with a positive size capacity.
- int get(int key): Return the value of the key if it exists, otherwise return -1.
- void put(int key, int value): Update the value of the key if it exists. Otherwise, add the key‑value pair to the cache. If adding exceeds capacity, evict the least recently used key.
All operations must run in O(1) time.