Candidatei-me por indicação de um funcionário. O processo levou 3 semanas. Fui entrevistado pela Rocket Fuel (South Norwalk, CT) em fev. de 2017
Entrevista
Overall, the process was straightforward and quick. It started with my cover letter and resume submission with a referral. Then an online timed coding challenge on Hackerrank. It was a basic algorithm problem with some directions about OOD and modularity. The challenge was medium difficulty and was kind of fun. Then I had a phone interview with the engineering manager and it was very clear that she read through my solution thoroughly, which I appreciated. Finally, a four hour interview with various parts of the engineering team with questions spanning from DB design to writing a React component.
Perguntas de entrevista [1]
Pergunta 1
Just be prepared to answer questions about your coding challenge solution.
Candidatei-me online. Fui entrevistado pela Rocket Fuel (Redwood City, CA) em mai. de 2017
Entrevista
Interview process is quite standard. First, I had to complete coding challenge, one phone interview and one onsite interview. In onsite interview, I met 5 people. I really enjoyed the process and Everyone was nice, polite. HR was helpful throughout the process.
Onsite interview had white board coding along with some design questions. Coding Questions were not taken from geeksforgeeks or leetcode. Some Questions were tricky to solve. Interviewers were polite and helpful.
Candidatei-me por meio de uma faculdade ou universidade. O processo levou 1 dia. Fui entrevistado pela Rocket Fuel (Redwood Shores, CA) em dez. de 2012
Entrevista
Rocketfuel visited my college for placements. There was a coding test via interviewstreet and shortlisted students had interviews on Dec 1. The coding test was difficult.
I was shortlisted and had 4 interviews (3 face to face and 1 via skype). Interview questions were good and I answered all the questions (Took some hints in between)
Perguntas de entrevista [3]
Pergunta 1
Implement LRU cache. Come up with the best you can.
Find the universal sink in a graph in O(Nodes) time complexity. The graph is given as an adjacency matrix.
A Node which has incoming edge from all nodes and has no outgoing edge is called Universal sink.
