Written Test:
3 questions on hackerrank :
Ques 1) N days and M employees are there. A matrix of N*M is given consisting of characters ‘Y’ and ‘N’ only. each row represents a day in which each cell tells whether the mth employee is present on that day or not. You have to tell the maximum continuous days on which all the employees were present. Similar Question : Length of largest region in Boolean Matrix.
Ques 2) n items were there in a bag with a id number. Id numbers of the items were not distinct i.e. can be repeated. you can take out at most m items from that bag. You have to take out items in such a way that the unique ids of remaining items are minimum.
Ques 3) You were given m sentences and n Phrases. You have to tell which sentence contains all the phrases.
for eg.
Input :
2
hello everyone
bye everyone
1
hello
Output:
1
Explanation: As first sentence contains all the phrase of first phrase.
Round 1: Technical round (Face to Face)
Ques 1) Optimal Game strategy
Ques 2) pair of indices given . You can swap infinite times between these indices. Output the smallest lexicographical string after doing these operations.
Round 2: Technical Round (Face to Face)
Ques 1) Implement Search engine with autocomplete feature.
Ques 2)Temple Offerings
Ques 3) Project Discussions
Round 3: HR
Ques 1) Project Discussions Personally this round was fantastic. The interviewer was awesome .
LRU implementation Favourite Subject
Finally I got selected. Overall 6 people were selected out of 34.
Thanks for Reading
Placewit grows the best engineers by providing an interactive classroom experience and by helping them develop their skills and get placed in amazing companies. Learn more at Placewit . Follow us on Instagram and Facebook for daily learning.
