Loading...
Train NowChoose Language...
- JavaScript
- Python
- Ruby
- Crystal
- TypeScript
- C#
- COBOL (Beta)
- C
- Scala
- Rust
- Java
- C++
- Haskell
- Fortran (Beta)
- PHP
- CoffeeScript
- Solidity (Beta)
- Go
- F#
- Elixir
- Swift
- NASM
- λ Calculus (Beta)
- Objective-C (Beta)
- Factor (Beta)
- Kotlin
- VB (Beta)
- D (Beta)
- BF (Beta)
- RISC-V (Beta)
- OCaml (Beta)
- Lua
Start training on this collection. Each time you skip or complete a kata you will be taken to the next kata in the series. Once you cycle through the items in the collection you will revert back to your normal training routine.
DescriptionEdit
After understanding how to do a proof by induction, train on mastering different data structures and algorithms.
TYPES OF DATA STRUCTURES
-Simple array-based data structures: arrays, matrices, stacks, queues
-Binary search trees
-Hash tables
TYPES OF ALGORITHMS
-Searching algorithms
-Binary search
-Divide and conquer
-Sorting algorithms