Question d’entretien chez FinMechanics
How will you find the Largest Common Substring between two strings?
Réponse à la question d'entretien
Utilisateur anonyme
24 août 2024
I first told the brute-force method, then I told that it can be written as a recursive function and then be optimised using dynamic programming by memoization. Then I wrote the pseudocode.