J'ai postulé en ligne. Le processus a pris 1 jour. J'ai passé un entretien chez Nearbuy (New Delhi) en déc. 2016
Entretien
Total of 4 rounds:
First round for basic HTML, CSS.
Second Round for JS , Algo and logical questions
Third Round with CTO - Technical and managerial round
Fourth Round - HR
Questions d'entretien [1]
Question 1
Basic questions, JS, Algos, some logical and puzzels
J'ai postulé via la recommandation d'un employé. Le processus a pris 2 semaines. J'ai passé un entretien chez Nearbuy (Mumbai) en juin 2020
Entretien
There were three rounds one with a senior developer, one with the lead developer and one with an engineering manager. All the rounds went well after. HR said to contact me in a day but didn't respond back. After a lot of reaching him through various mediums, he finally agreed to give a result by the end of the day. He rejected me claiming my background was not alright. Worst interview experience I ever had with a company. HR has absolute no regards for a candidate who is wasting his time to go through the interview process.
Questions d'entretien [1]
Question 1
One of the question asked by Lead developer was very good. There are 44 students some of them are good at cricket and some of them are good in football(consider they have two attributes one for cricket rank and one football rank). Now there a function which takes the input of sports(cricket , football) and you need to return the best student of that sport available at that point of time. how will you structure the data for a optimized solution(HINT: LinkedList).
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 1 jour. J'ai passé un entretien chez Nearbuy (Kharagpur, West Bengal) en déc. 2015
Entretien
There was a preliminary round with 30 aptitude questions and 3 programming questions requiring good algorithm skills. After that there were 2 rounds of interviews (one technical and the other hr interview).
Questions d'entretien [1]
Question 1
There is a 2-D array with 0's and 1's arranged in increasing orders in rows. Within minimum time, how do you find out the row with maximum number of 0's?