SUMMARY.md

Summary

Introduction

1-10: Lists

• 1: Find the last element
• 2: Find the second-last element
• 3: Find the K'th element
• 4: Find the number of elements
• 5: Reverse a list
• 6: Detect palindrome
• 7: Flatten a nested list
• 8: Eliminate consecutive duplicates
• 9: Pack consecutive duplicates
• 10: Run-length encoding

11-20: Lists, continued

• 11: Modified run-length encoding
• 12: Decode a run-length encoded list
• 13: Direct run-length encoding
• 14: Duplicate elements
• 15: Replicate elements K times
• 16: Drop every N'th element
• 17: Split a list
• 18: Extract a slice
• 19: Rotate a list
• 20: Remove the K'th element

21-28: Lists again

• 21: Insert an element
• 22: Integers within a range
• 23: Random selection
• 24: Draw N diffrent random numbers
• 25: Random permutation
• 26: Generate combinations
• 27: Group into disjoint subsets
• 28A: Sorting a list of lists
• 28B: Sorting by length frequency

31-41: Arithmetic

• 31: Prime number detection
• 32: Euclid's algorithm
• 33: Coprime
• 34: Euler's totient
• 35: Prime factors
• 36: Prime factors multiplicity
• 37: Euler's totient improved
• 38: Compare totient calculations
• 39: Prime numbers in a range
• 40: Goldbach's conjecture
• 41: Goldbach's list

46-50: Logic and codes

• 46: Truth table
• 47: Truth table part2
• 48: Truth table in general
• 49: Gray code
• 50: Huffman code

54-60: Binary trees

• 54: check binary tree
• 55: List up balanced binary tree
• 56: Symmetric binary tree
• 57: Binary search tree
• 58: List up symmetric balanced binary trees
• 59: List up balanced binary trees with given hight