I applied through university. I interviewed at BuyHatke
Interview
The first round was a coding round on interviewbit platform. Shortlisted candidates had 3 rounds of interviews. In the first round, basic DSA questions were asked. The second round was also based on DSA and included cs subjects like DBMS and OS questions as well. The final round was with the CEO of the company itself.
Interview questions [1]
Question 1
Round 1: delete a node in a linked list, number of islands problem, level order traversal of a tree.
Round 2: DIfference between threads and processes, normalization and coin change DP problem.
Round 3: Elevator problem and situational questions and some questions based on graphs.
I applied through university. The process took 1 day. I interviewed at BuyHatke (Jamshedpur) in Jul 2019
Interview
BuyHatke conducted campus recuirtment for SDE role in our campus,NIT Jamshedpur. The interview process consisted of four phase.First round was the CV shortlisting. 71 students are selected for online round.The Second round was a online contest on InterviewBit on Data Structure and Algorithm.Test duration is one and half hour and consisted four questions.Students who solved atleast two questions are shortlisted for the next round. Rest Rounds are taken on Skype.Third round was taken by one of the employee of BuyHatke. He asked three questions based on DS and Algo, some questions on project and some basic questions on OS. Fourth round was taken by the CEO of Buyhatke. He asked one algorithms questions,one System design question,Some details about project. They give enough time to think of the approach.Overall it was a very good experience.
Interview questions [13]
Question 1
Input is a sorted list of disjoint intervals sorted according to first element, and your goal is to insert a new interval and merge all necessary intervals returning a final new list.
For example, if the interval list is
[[1,5], [10,15], [20,25]] and you need to insert the interval [12,27], then your program should return the new list: [[1,5], [10,27]].(Online Round)
Given a binary tree, a target node in the binary tree, and an integer value k, print all the nodes that are at distance k from the given target node.(Online Round)
Given An unsorted array of integers print all distinct four element tuple(Quadruplets) in it having given sum in sorted order.(Online Round)
E.g. A[]=[2,7,4,0,9,5,1,3]
sum=20
Output : 0,4,7,9
1,3,7,9
2,4,5,9
Box Stacking Problem
You are given a set of n types of rectangular 3-D boxes, where the i^th box has height h(i), width w(i) and depth d(i) (all real numbers). You want to create a stack of boxes which is as tall as possible, but you can only stack a box on top of another box if the dimensions of
the 2-D base of the lower box are each strictly larger than those of the 2-D base of the higher box. Of course, you can rotate a box so that any side functions as its base. It is also allowable to use multiple instances of the same type of box.(Online Round)
Median in a stream of integers (running integers)
Given that integers are read from a data stream. Find median of elements read so for in efficient way.
For example, let us consider the stream 5, 15, 1, 3 …
After reading 1st element of stream - 5 -> median - 5
After reading 2nd element of stream - 5, 15 -> median - 10
After reading 3rd element of stream - 5, 15, 1 -> median - 5
After reading 4th element of stream - 5, 15, 1, 3 -> median - 4, so on.
Find maximum possible stolen value from houses. There are n houses build in a line, each of which contains some value in it. A thief is going to steal the maximal value of these houses, but he can’t steal in two adjacent houses because owner of the stolen houses will tell his two neighbour left and right side. What is the maximum stolen value.
Examples:
Input : hval[] = {6, 7, 1, 3, 8, 2, 4}
Output : 19
Thief will steal 6, 1, 8 and 4 from house.
Imagine you have a dictionary
You need to find the list of all words which are compounds words
moonlight = moon + light
newspaper = news + paper
AFT = a + f + t
the dictionary needs to be traversed and you need to figure out all such words
Here’s your dictionary
a
aft
afte
after
aftereffect
afternoon
afterthought
air
airbag
aircraft
airline
bag
c
e
effect
f
plane
r
thought
t
You can share the link of ideone of running code.
You need to design an efficient elevator system. Think over it. And take test cases.
100 floor building
You are on the 27th floor going to the 100th floor
And person from 60th floor who wants to go downwards
Person on ground floor is pressing to go upwards. Ground floor person has requested first. Whose request would you honour first. According to your algorithm
How would you code this ? What all variables would you take and what would be the complexity of the code
Write the code for it and send the IDE link.
I applied through university. I interviewed at BuyHatke
Interview
The first round is coding. They conducted it on Interviewbit. Make sure your concepts are very clear and you practice data structures and dynamic programming problems thoroughly.
Also you need to be thorough with everything mentioned in your resume since they ask every topic in depth