Metamidmar. de 2025
Asked on my screening interview; as is
Given a string of '(' and ')', return the minimum number of insertions needed to make it balanced under the rule that each '(' must be closed by two consecutive ')' (i.e., treat '))' as one closing), with insertions allowed anywhere. This is a linear-time greedy/stack-style balance problem (n up to 1e5).
Use esses exemplos para entender em que contexto ela costuma cair e adaptar sua prática.
Asked on my screening interview; as is
Nenhum anexo público associado a esta pergunta.
No app você encontra perguntas parecidas, compara empresas e aprofunda essa busca com mais filtros.