Given a numeric string, remove exactly k digits (preserving the remaining order) to form the smallest possible integer, trimming leading zeros and returning "0" if nothing remains. This is a greedy/monotonic-stack style problem where you remove digits that create larger prefixes to minimize the result under the constraint k ≤ n.
Use esses exemplos para entender em que contexto ela costuma cair e adaptar sua prática.
Minimize memory consumption in an Amazon Data Center by removing a contiguous segment of processes. Given a list of processes with their memory consumption and a number m, remove m contiguous processes to minimize total memory usage.
Nenhum anexo público associado a esta pergunta.
No app você encontra perguntas parecidas, compara empresas e aprofunda essa busca com mais filtros.
Amazon