Pergunta de entrevista da empresa FinMechanics

How will you find the Largest Common Substring between two strings?

Resposta da entrevista

Sigiloso

24 de ago. de 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.