La procedura ha richiesto più di una settimana. Ho sostenuto un colloquio presso MapR Technologies
Colloquio
Hackerrank exercise and onsite interview with 4 people. Only one whiteboard question. The interviewer asked question with 25 minutes left and the question was not well formed. Seemed like the requirements kept changing as you asked more questions. I only had time to tell the approach. Apart from this interviewer, everyone else were very good.
Ho presentato la mia candidatura tramite segnalazione di un dipendente. La procedura ha richiesto 3 settimane. Ho sostenuto un colloquio presso MapR Technologies (San Jose, CA) nel mese di ott 2015
Colloquio
First I came in for an informal talk, to see if I might be a good fit and to understand the current problems the company is trying to solve and where I can help. Thinking that the timing, my personal career goals and skills might be a good match, we decided to schedule a full interview. I came on site and met with several folks from various roles and levels within the company. I was asked thoroughly about my background on various different types of projects. Very good and detailed discussion. We went through some whiteboard problem solving exercises of varying degrees of complexity, none too advanced to solve in less than a few minutes. Finally, we discussed the product, strategy, and exciting initiatives coming down the pipe at the company and how I might be involved. The HR representative conducted an interview wrap up where we talked about my aspirations and personal desire for mentorship and leadership opportunities in addition to the day to day work to ensure that the overall balance would work for both of us. Eventually, they called with an offer and I accepted.
Domande di colloquio [3]
Domanda 1
Explain your role as a front-end architect of Progressive Insurance Direct Auto Quoting application
Discuss the design and implementation of the Temporal Sequencing capability of Explorys hadoop-based medical metrics engine, including both technical and interpersonal strategies.
Given an arbitrary list of components and their dependencies, both direct and transitive, describe an algorithm to compute a flat, ordered list of components such that when installing any one component, all dependent components will have been installed.
