# Summary

[Introduction](./build/README.md)

# 1-10: Lists

* [1: Find the last element](./build/Problem01.md)
* [2: Find the second-last element](./build/Problem02.md)
* [3: Find the K'th element](./build/Problem03.md)
* [4: Find the number of elements](./build/Problem04.md)
* [5: Reverse a list](./build/Problem05.md)
* [6: Detect palindrome](./build/Problem06.md)
* [7: Flatten a nested list](./build/Problem07.md)
* [8: Eliminate consecutive duplicates](./build/Problem08.md)
* [9: Pack consecutive duplicates](./build/Problem09.md)
* [10: Run-length encoding](./build/Problem10.md)

# 11-20: Lists, continued

* [11: Modified run-length encoding](./build/Problem11.md)
* [12: Decode a run-length encoded list](./build/Problem12.md)
* [13: Direct run-length encoding](./build/Problem13.md)
* [14: Duplicate elements](./build/Problem14.md)
* [15: Replicate elements K times](./build/Problem15.md)
* [16: Drop every N'th element](./build/Problem16.md)
* [17: Split a list](./build/Problem17.md)
* [18: Extract a slice](./build/Problem18.md)
* [19: Rotate a list](./build/Problem19.md)
* [20: Remove the K'th element](./build/Problem20.md)

# 21-28: Lists again

* [21: Insert an element](./build/Problem21.md)
* [22: Integers within a range](./build/Problem22.md)
* [23: Random selection](./build/Problem23.md)
* [24: Draw N diffrent random numbers](./build/Problem24.md)
* [25: Random permutation](./build/Problem25.md)
* [26: Generate combinations](./build/Problem26.md)
* [27: Group into disjoint subsets](./build/Problem27.md)
* [28A: Sorting a list of lists](./build/Problem28A.md)
* [28B: Sorting by length frequency](./build/Problem28B.md)

# 31-41: Arithmetic

* [31: Prime number detection](./build/Problem31.md)
* [32: Euclid's algorithm](./build/Problem32.md)
* [33: Coprime](./build/Problem33.md)
* [34: Euler's totient](./build/Problem34.md)
* [35: Prime factors](./build/Problem35.md)
* [36: Prime factors multiplicity](./build/Problem36.md)
* [37: Euler's totient improved](./build/Problem37.md)
* [38: Compare totient calculations]()
* [39: Prime numbers in a range](./build/Problem39.md)
* [40: Goldbach's conjecture](./build/Problem40.md)
* [41: Goldbach's list](./build/Problem41.md)

# 46-50: Logic and codes

* [46: Truth table](./build/Problem46.md)
* [47: Truth table part2](./build/Problem47.md)
* [48: Truth table in general](./build/Problem48.md)
* [49: Gray code](./build/Problem49.md)
* [50: Huffman code](./build/Problem50.md)

# 54-60: Binary trees

* [54: check binary tree]()
* [55: List up balanced binary tree](./build/Problem55.md)
* [56: Symmetric binary tree](./build/Problem56.md)
* [57: Binary search tree](./build/Problem57.md)
* [58: List up symmetric balanced binary trees](./build/Problem58.md)
* [59: List up balanced binary trees with given hight](./build/Problem59.md)