Intuit came to our campus for intern and FTE (full-time employment) roles for freshers, it’s an On-Campus interview experience!

There will be 4 rounds in total:

• Coding round (online)
• Technical round-1
• Technical round-2
• HR round

Coding round:

• You might not get as much of complex data structure questions like Binary tree/Graphs
• You will get complex array questions including multi-dimensional arrays like matrix questions.
• Online proctored test experience
• You will have to install a plugin/extension for screen sharing/screen proctoring where they can see your screen and monitor all activities on it.
• You will be given 4 questions with an ample time of 90 mins.
• Questions:

It’s a simple array question. Given two integers n and m, m is the number of distinct tanks you have and n is the line size Now arrange the tanks in a line assuming you have infinite supply of each tank and there should be n tanks in the row such that number of distinct subarrays is maximized if many such arrangement’s possible then return the lexographically smallest. sample cases:

Sample cases:

1) input: 3 5

output: 1 2 3 1 2

explanation: line size is 5 and number of distinct tanks available are 3 so we can place the tanks as 1 2 3 1 2. so that number of distinct subarrays is maximized and it’s lexographically smallest.

2)input: 2 1

output: 1

This is a very easy level question, Given n the size of the array and followed by n integers , now these all integers represent jewellery items in a shop in that shop all items are numbered continuously now you have only these jewels found , find the minimum number of missing jewels.

sample cases:

1) input: 2

1 10

output: 8

explanation: missing are 2,3,4,5,6,7,8 ,9 so total 8 were missing.

2) input: 3

5 6 8

output: 1

explanation : If only 7 is missing then we can get minimum robbed jewels.

Question: https://practice.horje.org/problems/find-the-string-in-grid0111/1

Didn’t remember the question exactly some dp question on matrix.

I got shortlisted for tech round 1 (by solving 2.5/4), there was a ppt (pre-placement talk) where the company objectives and the details regarding salary break-up, job profile, etc. were discussed (intern stipend was 1 LPM , FTE CTC was 45 LPA).

Technical round -1 : duration: 45-50 minutes

First the interviewer asked to introduce myself ,and then he started with oops .What is encapsulation, polymorphism, abstraction. what are your hobbies and then as my preferred language is CPP he asked me about map. Time complexity of ordered and unordered map. Followed with 2 DSA questions.

Given two sorted linked lists merge them to form a sorted linked list.(Standard question).
Question: /archive/merge-two-sorted-linked-lists/

It’s an array question of medium level. Given n the size of the array and followed by n elements assume you have n light bulbs arranged in a row starting from 1 to n. Now the array elements represents that that particular bulb is on at this instance. You need to find how many k exist such that first k bulbs are on and last n-k bulbs are off.

(Approach used by me: Take count=0 ,Traverse the array and keep track of minimum element from left when its equal to index (1 based index) then increase count)

Sample :

input:

5

2 1 4 3 5

2 -> off on off off off -> 0

1 -> on on off off off -> 1

4 -> on on off on off -> 1

3 -> on on on on off -> 2

5 -> on on on on on -> 3

so the answer is 3.

I was able to completely solve the both. Then he asked questions related to DBMS, OS like what is normalization, paging, process, scheduling. (There were 2 interviewers one tested my skills on DSA other on core subjects).

I got qualified for tech round 2.

Technical round -2: Time duration : 90minutes.

Firstly, the interviewer asked to introduce myself and then he asked me questions from oops , dbms ,os . Like inheritance , normal forms and to explain about various normal forms also about what is a process and various states of a process.

1 DSA question :: 4 approaches
Given an array of integers modify the array such that each index gets replaced with product of remaining elements.

• I discussed a brute force approach (time complexity: O(N^2) -> using nested for loops)
  interviewer asked to optimize it to O(N)
• Then I fond the product of array and at each i divided it with element (O(N) time complexity)
  interviewer asked to do it without using division operator and in O(N) time.
• I’ve used left array to store product from left end and right array to store product from right end and at each index we replace it with left[index-1]*right[index+1] and also some corner cases for index =0 and index = n-1.
  asked to do with O(N) time O(1) space without using division operator.
• I’ve used concept of logarithms log p-log e = log (p/e) where p is product of array and e is element of array .

  Interviewer was expecting this optimized approach he also asked me to elaborate on array’s product approach (iii one) and appreciated for that!

  and then why scheduling is important.
  some of scheduling algorithms like FCFS , Round robin.
  When we search for something on google how it works.
  Why normalization is important?

  Projects: They asked me about the projects which I mentioned in my resume , unfortunately I didn’t update the projects section so I discussed the same one which is in my resume it’s a very very basic one ( I would have performed better here).

  That project is a react application so , the interviewer asked me why did I choose react framework over others and it’s advantages. Also, asked to explain how actually a react application is built , What are components in react .

If you’re going to deploy a website which has a simple UI login, signup, username , password fields ,then what are the checks will you do before deploying.

Verdict: Got rejected ????
Learning: Have some good projects in resume , revise core subjects like operating systems, database management system , computer networks thoroughly.