Candidatei-me por meio de uma faculdade ou universidade. O processo levou 2 dias. Fiz uma entrevista na empresa Adap.tv.
Entrevista
Initially there was a Technical&Aptitude Written test. some of the questions are MCQ and some or not MCQ's. Tests consists of 20 questions ( 9 apt q.ns and 11 technical q.ns ). Most of the technical questions are from C, CPP(OOPS). The written test is elimination round. In our campus out of 30, around 14 students cleared the 1st round. The second round is Coding assignment. You can code in any language and you can use internet also. The question was bit difficult, you really need to have good programming skills for this. In round 2, Out of 15 only 5 has been shortlisted.
There were three interviews 1 hour each. 1st two rounds are completely technical rounds. Last round is HR and Technical. In the 1st technical you might be asked to solve the problems which you did not solve in the written test. 2nd round will be pure technical. I was asked some programs on Binary trees, Linked Lists etc. Last round mostly consists of HR questions.
The interviewers are really friendly. They will help you in solving problems if you get struck.
Candidatei-me por indicação de um funcionário. O processo levou 2 semanas. Fui entrevistado pela Adap.tv (San Mateo, CA) em jul. de 2014
Entrevista
starts with a phone interview with a quick coding problem on-line. than there are 4 interviews at their campus is san mateo, one interview with the HR manager and the other 3 are proffecionals. one engineer asked a theoretical question, but the other two asked to solve the problem on a white board.
Candidatei-me online. O processo levou mais de 1 semana. Fui entrevistado pela Adap.tv (Hyderābād) em jun. de 2014
Entrevista
There was a programming assignment, followed by three to four telephone rounds. Telephone interviews were conducted at our convenience. Interviewers were sometimes friendly and it was a positive experience on the whole. They asked some indepth questions about my current on-going project.
Given a rod of length n inches and an array of prices that contains prices of all pieces of size smaller than n. Determine the maximum value obtainable by cutting up the rod and selling the pieces. You need to sell the whole rod.
