It was a good experience. But i didn't receive the offer. I was underconfident. Prepare well for the interview and you can crack it . All the best for it
Fiz uma entrevista na empresa Nothing Something (Pune).
Entrevista
some what easier compared to remaining top mncs so i think u should concentrate well while attempting the test may allow to crack the test, so try hard and all the very best for evryone
Candidatei-me online. Fui entrevistado pela Nothing Something em jan. de 2020
Entrevista
45 Minute skype interivew:Behavioural questions ,questions related to C++ and Python such as threading,optimization and basic C++ OOP Concepts
45 Minute technical skype interview with lead software engineer:was pretty similar to the first round with an emphasis on debugging and build tools,and some behavioural questions
Onsite 5 hour interview process
1st round with software eningeer ,with discussion related to background and debugging.With questions related to how would you debug your software .Since I was only aware of GDB and backtracing ,I was only able to answer that but it seems the interviewer wanted more professional approach to debugging which I wasn't aware of
2nd round with another software engineer :2 coding problems.
given a cyclic list find the longest sub list.T
given a string print the characters and how many times they occur in alphabetical order.For eg:given "hello world" the output would be a0b0c0d1e1f0g0h1i0j0k0l3 and so on.I was able to illustrate the process that we could use a map.
Perguntas de entrevista [1]
Pergunta 1
given a cyclic list find the longest sub list.T
given a string print the characters and how many times they occur in alphabetical order.For eg:given "hello world" the output would be a0b0c0d1e1f0g0h1i0j0k0l3 and so on.I was able to illustrate the process that we could use a map.
Answer:for every character in the string,we simply store that character and the no of times it occurs.But when it came t displaying the result,I forgot the way to display the result,but with some hints from the interviewer I was able to do it.As for the first my initial approach was to put the nodes of the list and then use that result to compute the longest chain (Similar to longest increasins subsequence).But the interivewer said this is not right.
Third round with principal software engineer :Advanced questions related to C++,Python and robotics motion planning.
difference between malloc and new
deadlock
forward vs move
global interpreter lock
Memory management exception handling