3 interviews. The interview is technical. Interviewer gives you problems in which you have to code in browser (like Google Docs). They will also ask you about runtime space/time complexity of the algorithm.
Problems:
1. Reverse string
2. Find substring
3. Deep copy graph
4. Lowest common ancestor
I forgot other questions.
J'ai postulé via un recruteur. Le processus a pris 2 semaines. J'ai passé un entretien chez Pocket Gems en févr. 2015
Entretien
I was emailed by HR for my resume and was then asked to email available times for an interview. The process was fairly straightforward and they responded quickly. My first phone interview had a coding question on an online codesharing site CoderPad. I was only asked one coding question, but didnt finish the question in time. After the coding question they'll ask about runtime. They responded quickly (same day) with my notice that I wasnt right for the part, but overall it was a good experience.
Questions d'entretien [1]
Question 1
How to convert a ternary expression to binary search tree
Ex.
a?b:c:d
Given:
class Node{
Node left;
Node right;
}
J'ai postulé via un recruteur. Le processus a pris 1 jour. J'ai passé un entretien chez Pocket Gems
Entretien
1 phone interview. It involved 2 technical questions on algorithms and optimization. They are very helpful to soundboard ideas during the process especially when I was stumbling at the end. Can do language of choice.
Questions d'entretien [2]
Question 1
Find a substring within a string. Return the int value of the position in the string where the substring starts. Know the Big O notation for your algorithm.
J'ai postulé en ligne. J'ai passé un entretien chez Pocket Gems (San Francisco, CA)
Entretien
First phone interview was not like the rest on here. No algorithm questions were given, but about 100 lines of code written in a C-based language like Java but not quite. I had to understand code that I had never seen before like what it does it do (answer: if you get 3 of the same colors in a row you get a match point and you win if the score is >= 3) and change the match point algorithm to where you can get points for 4 and 5 colors in a row. The only problem was the interviewer was so poor in trying to communicate what he wanted me to do that I took too long to figure it out. Almost everything I tried he said wouldn't work, which was wrong but the interviewer is king I guess. Thus, I failed. There is really no way to prepare for this type of interview.
Questions d'entretien [1]
Question 1
Change the code to where you get a match of 5, then it adds 5 points and if you have a match of 4 then it adds 4 points and so on.