Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso Zenefits nel mese di mag 2015
Colloquio
First I received a link to a HackerRank test. Very easy, with plenty of time and could code in any language I chose. Soon after we scheduled a Skype interview, also easy. Afterwards I got an email saying they are not interested in hiring fresh grads, even though I was applying for the position of Junior Software Engineer, the job opening explicitly mentioned people with no industry experience whatsoever and they had known I was a fresh grad long before they scheduled the interview.
Domande di colloquio [2]
Domanda 1
Write a function that receives a sentence and returns it with each word modified so that the first and last letters are unchanged, but the rest is a random permutation.
Implement a dictionary data structure for auto-completion. As the user keeps typing, we want to know how many words there are with the prefix typed so far.
Ho presentato la mia candidatura tramite l'università. Ho sostenuto un colloquio presso Zenefits (Vancouver, BC)
Colloquio
It started off with some questions about my previous technical experience and then the interviewer asked me to write a code related to dynamic programming. I solved the problem using divide and conquer, but I guess that wasn't enough as I received an email from HR team the next day about not going forward with the interview process. Interview question was really hard, so make sure you brush up on your algorithms before the interview.
Ho presentato la mia candidatura online. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso Zenefits nel mese di dic 2015
Colloquio
First was a coding challenge through Hacker Rank which wasn't too difficult. Got 3 hours to complete 2 problems. After successfully completing this, the next step was a technical phone interview which was just another question over Hacker Rank (not sure why this one was done over the phone). This one was much more difficult and you were only given an hour.
Domande di colloquio [1]
Domanda 1
Given an integer array, return the array that would come previously in lexographical order
