(1) https://leetcode.com/problems/robot-return-to-origin/
(2) string of words {"eat","toe","cat"} word = {"oet"} return "{toe"} input constrains : lowercase alphabets
Beware: It would be declared in something else in an object that will be typedef at the start and the interviewer won't help you if you are not coding in java.

Question

(1) https://leetcode.com/problems/robot-return-to-origin/
(2) string of words {"eat","toe","cat"}  word = {"oet"} return "{toe"} input constrains : lowercase alphabets
Beware: It would be declared in something else in an object that will be typedef at the start and the interviewer won't help you if you are not coding in java.

Utilisateur anonyme · Accepted Answer

(1) Switch case
(2) Count sort word and count sort words -> return which is equal. Remember don't try to explain how count sort works and how it is better than normal sort, I interviewer is only interested in passing his test cases.

Goldman Sachs

Question d’entretien chez Goldman Sachs

Réponse à la question d'entretien

Entreprises suivies

Recherche d’emplois