Round 1 ( Coding )
Total Questions – 04 – 90 Mins
Qn1 : 2D(m*n). Each time he will jump ‘X’ Units. Currently standing at S (P,Q) and wants to go to new position R (U,V) by taking jumps of exactly X units each time. Determine if he can reach his destination or not. If he can reach print min number of jumps to go from S to R.
Qn2 : This was like a search a word in word grid but asked in a little twisted way as a problem l.
Qn3: Jewels numbered from X to Y (inclusive) . Doesn’t know exact values of x and y . Currently there are N jewels our task is to determine number of jewels stolen given a array of current jewels
Example : [5,6,8] Output : 1 as 7 is not there , [1,10] Output : 8
This was very simple
Qn4: M Type of tanks numbered 1 to m . infinite number of tanks for each type. come up with good line of size n tanks if there are multiple good line return the one with lexographically smaller.
Good line is where tanks lined up in a array and the count of subarrays with only distinct tank types is maximum
Ex1 : [1,2] return 1
Ex2: [2,1] return 1 1
Ex3: [2,2] return 1 2
This was so simple
At Last only 6 Students were selected for next round
Intuit Interview Experience (On-Campus)
Intuit Came on July for our campus
They Filtered the applied students by criteria CGPA>8.5 ( Around 200 Students)