Links importantes e úteis para ajudá -lo a resolver problemas
- LeetCode Artigos importantes
- Algoritmos de classificação
- LEETCode Pick
- Árvores de fenwick
- Guia de preparação da entrevista
- Design do sistema: sistemas distribuídos
- 14 Padrões para aceitar qualquer entrevista técnica - Hackernoon Artic
- DSA Path
- Problemas de tópicos para os favoritos
- Guia de rodada comportamental
- Preparação da entrevista
- Melhor artigo médio
- Operações de operações de todo o mundo intermediário
- DP-For-Beginners-Problems-ou Patterns-ou-Sple-Solutions
- Importante todas as perguntas do padrão de string
- Melhor do melhor
Vedios
- LeetCode-Mock-Interview-Video-Series-5-Steps-to-Landle-Coding-Interview
Cobrindo as perguntas da entrevista da Amazon.
Link: https://drive.google.com/file/d/1vybnvxxkpn2unav8qwvm5yzkxxzioqxg/view?usp=Sharing
Recurso [Google]
Problemas mais populares para o Google (últimos 6 meses):
- Diferença mínima entre o maior e o menor valor em três movimentos (35 vezes): https://leetcode.com/problems/minimum-difference-between-largest-and-smalest-value-in-hree--moves/
- Adivinhe a palavra (32 vezes): https://leetcode.com/problems/guess-the-word/
- Limitador de taxa de logger (31 vezes): https://leetcode.com/problems/logger-rate-limiter/
- Colisão de asteróides (30 vezes): https://leetcode.com/problems/astroid-collision/
- Cadeia de cordas mais longa (28 vezes): https://leetcode.com/problems/longest-string-chain/
- Número de boas maneiras de dividir uma corda (23 vezes): https://leetcode.com/problems/number-of-good-ways-to-split-a-tring/
- Contas Square Submatrices com todos (22 vezes): https://leetcode.com/problems/count-square-submatrices-with-all-ones/
- Caminho mais curto em uma grade com eliminação de obstáculos (20 vezes): https://leetcode.com/problems/shorstest-path-in-a- glid-with-obstacles-elimination/
- Importância do funcionário (19 vezes): https://leetcode.com/problems/employee-importance/
- Pontos máximos que você pode obter do Cards (19 vezes): https://leetcode.com/problems/maximum-points-you--an-obtain-fromcards/
- Número de subsequências correspondentes (17 vezes): https://leetcode.com/problems/number-of-matching-subsequences/
- Exclua nós e Return Forest (17 vezes): https://leetcode.com/problems/delete-nodes-and-retrurn-forest/
- Encontre e substitua em String (16 vezes): https://leetcode.com/problems/find-and-replace-in-string/
- Loja de valores-chave baseada no tempo (15 vezes): https://leetcode.com/problems/time com baseado em
- Intervalos de mesclagem (15 vezes): https://leetcode.com/problems/merge-intervals/
- Bulls e vacas (14 vezes): https://leetcode.com/problems/bulls-and-cows/
- Decode String (12 vezes): https://leetcode.com/problems/decode-tring/
- Substring mais longa sem caracteres repetidos (12 vezes): https://leetcode.com/problems/longest-substring-without-repeating-characters/
- Mediana de duas matrizes classificadas (12 vezes): https://leetcode.com/problems/median-of-two-sorted-arrays/
- Árvores binárias equivalentes a flip (11 vezes): https://leetcode.com/problems/flip-equivalent-binary-rees/
- Adicione dois números (11 vezes): https://leetcode.com/problems/add-two-numbers/
- Ajuste da tela da frase (11 vezes): https://leetcode.com/problems/sentence-screen-ftitt/
- Frota de carro (10 vezes): https://leetcode.com/problems/car-fleet/
- Koko Eating Bananas (10 vezes): https://leetcode.com/problems/koko-eating-bananas/
- Rle iterator (10 vezes): https://leetcode.com/problems/rle-iterator/
- Caminho mais crescente em uma matriz (10 vezes): https://leetcode.com/problems/longest-inncreing-path-in-a--matrix/
- Stone Game III (9 vezes): https://leetcode.com/problems/stone-game-iii/
- Número máximo de pontos com custo (9 vezes): https://leetcode.com/problems/maximum-number-of-points-with-cost/
- Valor máximo da equação (9 vezes): https://leetcode.com/problems/max-value-of-equation/
- Subseqüência mais longa e crescente (9 vezes): https://leetcode.com/problems/longest-inncreing-subsequence/
- Subarray máximo (8 vezes): https://leetcode.com/problems/maximum-subarray/
- Limpador de sala de robô (8 vezes): https://leetcode.com/problems/robot-room-cleaner/
- 3sum (8 vezes): https://leetcode.com/problems/3sum/
- Linha mais longa de consecutiva em Matrix (8 vezes): https://leetcode.com/problems/longest-line-of-consecutive-ne-in-matrix/
- Matriz de pares duplos (8 vezes): https://leetcode.com/problems/array-of-doubled-pairs/
- Frota de carro II (8 vezes): https://leetcode.com/problems/car-fleet-ii/
- 01 Matrix (8 vezes): https://leetcode.com/problems/01-matrix/
- Número mínimo de paradas de reabastecimento (8 vezes): https://leetcode.com/problems/minimum-number-of-refueling-stops/
- Fluxo de água do Atlântico do Pacífico (7 vezes): https://leetcode.com/problems/pacific-atlantic-water-flow/
Amazon [tudo para se preparar]
- https://leetcode.com/discuss/interview-experience/1100618/amazon-or-sde-2-or-offer-or-london/884366
- https://www.amazon.jobs/en/software-development-interview-prep?cmpid=Ecotot700005b#/lessons/fbo1d1ic_sawawi-q2teksf-pc82nqxr
- https://www.principle.cards/
- https://leetcode.com/discuss/interview-experience/1886061/amazon-sde-new-grad-london-march-2022-indian-offer
“Postagens de código de leetcode que você não pode perder"
- ??? ??????? ??????????? + ????? ??????? + ?????? ??????:
- https://lnkd.in/dxb7xbsc
- https://lnkd.in/dhgnchdh
- https://lnkd.in/dv65f9s2
- https://lnkd.in/dmmstexb
- https://lnkd.in/dycbzm7p
- https://lnkd.in/dvphrbi3
- https://lnkd.in/d5c5afdb
- ??? ???????????? ??????:
- https://lnkd.in/dawkbyxu
- https://lnkd.in/d2vthapc
- https://lnkd.in/duaggsrg
- https://lnkd.in/dv9kq2e9
- https://lnkd.in/drsxpyfw
- ??? ??????? ??????? ??????? (??? + ???):
- https://lnkd.in/dyqeeu8v
- https://lnkd.in/gz_aeptp
- https://lnkd.in/dfxbu9sk
- https://lnkd.in/dccyuvuj
- https://lnkd.in/dcu9mzef
- https://lnkd.in/dfbm9apg!
- https://lnkd.in/ddv7-88p
- ???? ??????????? ? ??????:
- https://lnkd.in/dzjnpsmn
- https://lnkd.in/dd4duvtf
- https://lnkd.in/d5prrerh)
- https://lnkd.in/d2fpnafa
- https://lnkd.in/dp98-kv7
- https://lnkd.in/d57qtjku.
- https://lnkd.in/dmebekbu
- ???? ??????????? ? ??????:
- https://lnkd.in/dzp38bkc
- https://lnkd.in/dmp3zkmr
- https://lnkd.in/dmsw4yb6
- https://lnkd.in/djxydmhe