Round 1: Print linkedlist in reverse Design filesystem using tree, Should use B-Tree Implement LRU Cache Find BST is pure BST
Hi all, through this post I will be sharing with you guys my interview experience with Intuit. The interviews were for a summer internship. There… Read More »
Online Round: There were 4 coding questions: You have been two integers n and m where n is the size of the array and m… Read More »
Technical Round-1 1. Maximum Subarray Sum problem: Different approaches and code 2. Given a 2-D char array, with random alphabets, find the word “INTUIT”, s/t… Read More »
Intuit was the first company to visit our campus. They selected 6 students. Online Round ———————— Only people with CGPA of 9+ were allowed to… Read More »
Intuit had visited our campus for recruting 2016 batch students for internship + FTE for Devops profile. We had four rounds. Round one : Online… Read More »
Intuit came for on-campus hiring for 2016 batch and internship offerings for 2017 batch in our college last week. Round One (Online round, 90 minutes):… Read More »
Intuit came to our college campus for placements. Shortlisted 13 students after written and then selected 4 students for Full Time Job.
There are 3 ants sitting on three corners of a triangle. All ants randomly pick a direction and start moving along edge of the triangle.… Read More »
1st Round : (2 hrs) 1. Implement LRU Cache, 2. Implement your own Blocking Queue.
Experience – 1.8years Round-1:(Technical-1:10 min) 1. Introduce yourself.
Intuit visited our campus for summer internship for positions of Software developer and Software Quality Engineering. I was among the 5 people to be selected… Read More »
I recently cleared Intuit Interview. It was a life changing experience and I am very happy to crack the interview for SSE.
Written round: 1. Write a parser which takes java file as input and give count of uncommented lines as output.
Round One (Written round, 60 minutes): 1. Given an unsorted linked list, remove all duplicates without using temporary buffers.