I applied through college or university. The process took 2 days. I interviewed at Pocket Gems
Interview
I just resume dropped on my school's career services page and got a very prompt response to schedule a first round interview. That said, the interview itself was much more "code monkey"-ish than I expected. In most other interviews I've had, interviewers care more about your thought process than your ability to write syntactically correct code, but here they expected it to compile and run. It's not necessarily a bad thing, just not at all what I expected so my usual "write pseudocode for functions I don't know the exact name of" approach didn't work, and I had to rely on the interviewer to fill in the syntax blanks. In the end, I think this is what doomed me because while I eventually got the desired output, it took a fair amount of trial and error with respect to syntax, and I was rejected almost immediately after the interview (quite literally within five minutes). My advice would be to pick a language and know it well.
Interview questions [1]
Question 1
Given a list of ints and an integer k, return the k (note: not the kth) most frequent elements
I applied online. I interviewed at Pocket Gems in May 2015
Interview
apply online, get interview, phone interview first round. The questions are fair enough. But the interviewer was keep interrupting me, spend half time writing unless code and argue with him. But he is nice overall.
Interview questions [1]
Question 1
string and kth from a array. Just like other questions.
I applied through college or university. I interviewed at Pocket Gems (San Francisco, CA) in May 2015
Interview
Asked 2 questions. The first one was some type of warm up question. The second was the one that I seemed to have gotten stuck. The interviewer seems nice. When I got stuck on his second question, I told him my thought process, and somewhat helped me out.
Interview questions [1]
Question 1
Write a function which, given a ternary expression string input, parses the input into the correct tree and returns the root node of the tree.