Question d’entretien chez Goldman Sachs
First online coding round - A hard leetcode problem - finding longest prefix which is also suffix
Réponse à la question d'entretien
Utilisateur anonyme
14 nov. 2024
I was able to code it using Rolling hash
First online coding round - A hard leetcode problem - finding longest prefix which is also suffix
Utilisateur anonyme
I was able to code it using Rolling hash