College : Tier 1 (IIT)
Branch : Non - Circuital
Status / Current Company : Wipro
Experience : 9 months (2021 Graduate)
Location: Banglore
Date : March 2022
Interview Process:
Total Rounds : [ 1 Machine Coding + 1 Problem Solving and Data Structures Round ]
Round 1 : ( Machine Coding Round )
Recruiter reached out to me and scheduled my Machine Coding Round, later I found that was a Hiring Drive and there were around 50 guys in that Drive.
We all were given the introduction of the Problem Statement and they required a workable , Object Oriented code.
Evaluation criteria :
Demo-able code
Functional correctness
Code readability
Usage of design patterns, where applicable
Language proficiency
The code should be parameterized rather than hardcoded.
Testing
Exception
Problem : Bowling Alley
Write machine code for a single-lane bowling alley system.
One bowling game will be played by multiple players on a single lane.
During the game, players and their scores will be maintained and shown by the
system and the winner will be declared at the end of the game.
There was a Bonus Part also, but that should be attempted if you have already solved the base problem and time is remaining.
I solved the Base Problem and wrote a Object Oriented Code and demostrated the interviewer. He was satisfied with the code and later we discussed the Bonus Approach.
Tips : 1) First try to solve Base Problem, then try Bonus Part.
2) Code must be running with zero errors, and must be readable.
3) Use OOPs as much as possible.
4) No Restriction on Language
5) When giving demostration , first give overview of your classes and then explain in detail.
I got a call from recruiter , stating that I have cleared the round and thus I got my PS/DS round scheduled!
Round 2 : ( PS/DS Round )
Interviewer starts with her Intro and then asked me to introduce myself. Then quickly, asked DSA Problems.
Question 1: Given an array of integers, find the longest subarray in this array which is divisible by k.
Example : arr[] = 7 8 3 -3 4 2 1 and k = 3 ,
the longest subarray is 7 8 3 -3 4 2 which is divisible by 3 so answer is 6
I first gave the brute force approach of checking each subarray O(n2), but interviewer asked to optimize it further.
I was unable to get the idea how to reduce the TC.
After trying to explain my apprach , interviewer gave a HINT to use remainder somehow.
I got the hint and thus explain that we can use Map to store the remainder of prefixSum and k (i.e. prefixSum%k ) till everyIndex ,
and check if current remainder is already there, thus update the answer maxLength.
He was satisfied and asked me to write the code, I wrote the code and we discussed on TC.
Question 2 : Given is an array of integers where each number exists exactly twice except one number.
It is also guaranteed that the duplicate occurrences occur consecutively.
Find the number that occurs only once
Eg 1 1 2 2 4 4 6 8 8, ans = 6
I explain all approaches from basic, first to use Map to store the frequency, then I explained the XOR approach.
He asked to optimize it further, then since duplicate element occur simuntaneously, I explain we can use Divide and Conqure approach (Similar to Binary Search ).
Example : use low , high, mid = (low+high)/2
if number of element in left of mid is even then our answer is in right part and vice-versa.
He was satisfied and asked me to write the code and discussed TC.
In this Round , I messed up in Question 1 (couldn't come up with O(N) approach ) thus was slightly unsure about the HM round.
I tried mailing Recruiters and HR multiple times but no response till yet. I am considering myself rejected but atleast Flipkart can send a rejection mail!
Anyways , It was nice interviewing for Flipkart!