Loading...
Choose Language...
JavaScript
Ruby
Crystal
Java
Python
Rust
C++
C#
Haskell
CoffeeScript
Dart
Elixir
COBOL (Beta)
Go
Scala
PureScript (Beta)
C
Kotlin
Groovy
Clojure
Idris (Beta)
Train Now

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.

Description

A description has not yet been added for this collection.

Ad
3 kyu
How many are smaller than me II?
2,305joh_pot
Algorithms
Performance
3 kyu
Alphabetic Anagrams
6,075Azuaron
Mathematics
Logic
Strings
Algorithms
4 kyu
Determining if a graph has a solution
1,478damned3
Algorithms
Data Structures
Graph Theory
4 kyu
Compute a convex hull
389dustryder
Algorithms
Geometry
Retired
Permutations (retired)
41arhigod
Fundamentals
Recursion
Algorithms
Computability Theory
Logic
Theoretical Computer Science
6 kyu
Treebeard #Determine Tree Age
141smolen
Recursion
Arrays
Fundamentals
6 kyu
Sum The Tree
4,655jz9000
Trees
Recursion
Binary Trees
Binary Search Trees
Data Structures
Fundamentals
6 kyu
k-permutations of n
213MTDzi
Algorithms
Recursion
Permutations
4 kyu
Elemental Words
865dcsmith
Strings
Algorithms
Recursion
Arrays
5 kyu
Fun with trees: is perfect
1,465janitormeir
Trees
Recursion
Binary Trees
Binary Search Trees
Data Structures
Algorithms
4 kyu
Simple Fun #381: Find d = a + b + c II
59myjinxin2015
Algorithms
Performance
Arrays
5 kyu
Maximum Contiguous Sum
786thibaultCha
Arrays
Algorithms
3 kyu
Fabergé Easter Eggs crush test
1,764Ivana
Mathematics
Dynamic Programming
Performance
Algorithms