Me postulé en línea. El proceso tomó 2 semanas. Acudí a una entrevista en Hertz (Park Ridge, NJ) en feb 2013
Entrevista
I had 2 interviews. Phone interview followed by in person interview. I was interviewd by software architect and software manager. Both of them were very friendly and maked the process easy.
Preguntas de entrevista [1]
Pregunta 1
What are delegates in C#.
How to sort array in C#.
Me postulé en línea. El proceso tomó 2 semanas. Acudí a una entrevista en Hertz
Entrevista
Recruiter call just to make sure you and recruiter are on the same page, then hiring manager with some behavioral questions and a leetcode question, then two rounds of leetcode type questions and a system design question.
Preguntas de entrevista [1]
Pregunta 1
Leetcode 394. Decode String
Design API for a parking garage
Cosing test, Recruiter call, Technical round. Straight forward and simple. Everything was good and answered well. Didn’t hear back from them again. Later HR said position was closed and no guess on the feedbcak
Preguntas de entrevista [1]
Pregunta 1
Basic software patterns, libraries used to solve distributed problems.
Me postulé en línea. El proceso tomó 3 meses. Acudí a una entrevista en Hertz (Seattle, WA) en oct 2024
Entrevista
Applied online on August and got notified for an interview in early October. First set up a 15 min chat with the recruiter, I scheduled for a time but the guy did not show up. Rescheduled for the next week and the recruiter showed up and said he was on leave? Interview process contains 3 rounds: 2 technical (1 leetcode 1 team member) + 1 vibe check (with hiring manager).
First round interview was a 45 min Leetcode, medium linkedlist problem and was asked to write a unit testing function. Cleared this round and was told will hear back from them in a couple of days. It has been a week now and nothing happened. There is no way to contact anyone. Found the recruiter's email online and sent him message, still nothing. Everyone ghosting and utter waste of time. But from Glassdoor interview reviews, this seems to be no surprise.
Preguntas de entrevista [1]
Pregunta 1
Suppose you got two linkedlist:
n1 -> n2 -> n3 ... -> n(k) and l1 -> l2 -> l3 -> l(m), reorder and get n1 -> l(m) -> n2 -> l(m-1). k and m might have different length, connect the remaining nodes to the end if run out. After implementation, write a simple unit testing function.