J'ai postulé via un établissement d'enseignement supérieur ou universitaire. J'ai passé un entretien chez Workday (Boulder, CO) en avr. 2016
Entretien
First they asked personality questions, straightforward and easy. They went on to ask a few technical questions about memory and storage. Then continued on to ask whiteboard questions about different types of data structures.
Questions d'entretien [1]
Question 1
What is the difference between passed by value and passed by reference?
J'ai postulé en ligne. Le processus a pris 4 semaines. J'ai passé un entretien chez Workday (Boulder, CO) en déc. 2017
Entretien
Nice introductory call, then a call with a tech lead, then an on-site interview. Heard back a week later they went with a local candidate. Although I was disappointed to not get an offer, I felt they made the interview process as pleasant as possible.
Questions d'entretien [1]
Question 1
NDA so don't want to say anything specific but no particularly difficult questions if you are qualified for the role.
J'ai postulé via un recruteur. Le processus a pris 3 jours. J'ai passé un entretien chez Workday (Pleasanton, CA) en août 2016
Entretien
I received this interview after dropping my resume at an internal intern open house. I received an interview invitation within the next three days. The interview process consisted of three back-to-back 45-min rounds. 2 technical, 1 behavioral. The first interview was technical, and I was asked to solve a data structure problem. The second interview was behavioral, and I was asked about my background in coding, previous projects, and exposure to mobile development. Lastly, the third interview was a fairly easy and straightforward technical question about OOP and a simple string manipulation question. We briefly covered Big O Notation. All my interviewers were pleasant and made an effort to keep the interviews lighthearted and friendly.
Questions d'entretien [2]
Question 1
Create a LRU cache that can hold five objects maximum at a time, and write the get, add, and remove functions for it. If you add an item to the cache with five items in it, the least accessed item should be removed, and your item should be added to the top of the cache.
Given a string, return the first letter that does not have a duplicate. Talk about the time efficiency of your solution and re-write the solution to be space efficient.