Ho presentato la mia candidatura tramite l'università. Ho sostenuto un colloquio presso BuyHatke
Colloquio
I got a call from a consulting firm regarding this opening.
Round 1: Hackerank Online test:(1.5 hours) It had two questions. you have to pass all the test cases.
Given an array of numbers, print only those numbers which have 1, 2 and 3 as digits. the numbers should be sorted and comma separated.
given a sequence of M and N with M representing increasing and N representing decreasing. output the smallest number that follows this pattern.
Domande di colloquio [1]
Domanda 1
I got a call from a consulting firm regarding this opening.
Round 1: Hackerank Online test:(1.5 hours) It had two questions. you have to pass all the test cases.
Given an array of numbers, print only those numbers which have 1, 2 and 3 as digits. the numbers should be sorted and comma separated.
given a sequence of M and N with M representing increasing and N representing decreasing. output the smallest number that follows this pattern.
The process of recruitment was not fair enough. Students were not chosen fairly. Only 1 student out of many was chosen and that too didn't get an offer. They just wanted to do their name and wanted more followers on Linkedin.
Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso BuyHatke
Colloquio
there was a coding test then the shortlisted 20 students. then there was two technical interviews back to back.The interviewers were nice and the question of the test were average.
Domande di colloquio [1]
Domanda 1
Introduce Yourself
reverse linked list
subsequences of array having sum k
