Question 1:
Find the first non-repeating character in a string.
Question 2:
Dynamic Programming / Matrix traversal problem: - rock collector
Find optimal path in grid while moving only in allowed directions (up/right).
Sigue a tus empresas favoritas para estar al tanto de las últimas oportunidades y disponer de información desde adentro.
Búsquedas de empleo
Recibe recomendaciones y actualizaciones personalizadas al iniciar tu búsqueda.
Pregunta de entrevista en Goldman Sachs: Question 1:
Find the first non-repeating character in a string.
Question 2:
Dynamic Programming / Matrix traversal problem: - rock collector
Find optimal path in grid while moving only in allowed directions (up/right).
| Glassdoor