Kodr
Contenido
Blog
About
Español
English
›
Key Concepts
Technical Interviews
What are technical interviews based on?
Contenido esencial y cómo resolver algoritmos
Notación Big-O
Notación Big-O
Ejemplos Big-O
Ejercicios Big-O
Optimisation Techniques
Optimización BUD
DIY Optimisation
Key Concepts
Linked Lists
Stack & Queues
Trees
Graphs
Tries
Sorting
Searching
Recursion
Dynamic Programming
Problems: Arrays & Strings
Is Unique
String Rotation
Check Permutacion
URLify
One Edit Away
String Compression
Rotate Matrix
Zero Matrix
Valid Parenthesis
Problems: Linked Lists
Remove duplicates
Kth to last node
Delete Middle Node
Partition
Sum List
Palindrome
Intersection
Loop Detection
Problems: Stacks & Queues
Stack Min
Stack Of Plates
Queue via Stacks
Sort Stack
Animal Shelter
Problems: Trees
Path Sum
Construct Binary Tree from Inorder and Postorder Traversal
Problems: Binary Search Trees & Graphs
Route Between Two Nodes
Minimal Tree
List of Depths
Check Balanced
Validate BST
Successor
Build Order
First Common Ancestor
Check Sub-Tree
(Harder) Random Node
Problems: Sorting & Searching
Merge Sorted Array
First Bad Version
Problems: Dynamic Programming
Triple Step
Magic Index
(Hard) Towers Of Hanoi
Tries
😅 Estamos trabajando para traducir este contenido al Español
Last updated on 3/8/2020
←
Anterior
Siguiente
→
