Preguntas de entrevista de Softwsre Developer en DoorDash

Ir al contenido Ir al pie de página

DoorDash

Entrevistas

Entrevista de Softwsre Developer

15 may 2024

Candidato de entrevista anónimo

Sin oferta

Experiencia neutra

Búsquedas relacionadas: Opiniones sobre DoorDash | Ofertas de empleos en DoorDash | Sueldos en DoorDash | Beneficios en DoorDash

Entrevistas de DoorDash Entrevistas para el puesto de Softwsre Developer en DoorDash Entrevista de DoorDash

Entrevista

Tech Screen - Coding Round - This round was fine. My interviewer was pretty lenient about getting the code I was asked to write up working Onsite Rounds: - System Design Round - Coding Round - Behavioral Round - Coding Round My thoughts: - Be ready to be able to answer common dynamic programming (DP) questions - None of the questions on Leetcode were asked of me in my tech screen and onsite round. Though you might be able to study for a screening question there - Some folks who I spoke with seemed happy with their job at DoorDash, while others did not. It seemed to largely correlate with whether or not they worked on DoorDash's core business vertical of food delivery. "Golden path" or something like that is what they called it. It seems like those teams have the worst engineering on-call experiences. - The interview process seemed pretty alright. I don't have any real complaints to make about it, They got back to me within a week that I wouldn't be getting an offer

Preguntas de entrevista [6]

Pregunta 1

LeetCode 329 Hard: Longest Common Subsequence

Responder pregunta

Pregunta 2

Given a list of deliveries with associated delivery times and a store id and a gig driver's priority tier, return the list of deliveries that a driver can see based on the time of day and their priority level ("high", or "normal"). All drivers can see deliveries that are on the same day. "normal" tier drivers can view the next day's deliveries if it's after 9 PM. High priority drivers can view the next day's deliveries if it's after 8 PM

Responder pregunta

Pregunta 3

Design the backend of a scalable donation service where you can donate to multiple charities. Assume you have access to a third party service to do the payment transfers.

Responder pregunta

Pregunta 4

- Given a list of ints representing order IDs, return the priority of the order IDs based on the values of their neighbors. An order is considered if it's greater than it's neighbors to the left and right of it - I wasn't able to find this question on LeetCode Test Case: [3, 5, 1, 4, 2] => [4, 2, 5, 3, 1] Explanation of test case: - If we iterate over [3, 5, 1, 4, 2], the order IDs that can be considered in this first pass is 5 and 4. In this case, remove 4 because it's the order ID with the smallest value. The result of the removal looks like this: [3, 5, 1, 2] - If we iterate over [3, 5, 1, 2], the order IDs that can be considered in this pass is 5 and 2. In this case, remove 2 because it's the order ID with the smallest value. The result of the removal looks like this: [3, 5, 1] - Continue on from there until the list is empty

1 respuesta

Pregunta 5

- Given 2 N-ary trees. Find the number of differences between the trees. A difference could be the difference in values in nodes at the same location in both trees. It also could also be a child node being added or removed. In the context of DoorDash, this was represented as the number of changes made to a restaurant's menu.

1 respuesta

Pregunta 6

Longest Increasing Path in a Matrix (LeetCode 329 H)

Responder pregunta

DoorDash

Entrevista de Softwsre Developer

Empresas seguidas

Búsquedas de empleo

Entrevista de Softwsre Developer