https://github.com/programmer-ke/coding-katas

coding katas
https://github.com/programmer-ke/coding-katas

Last synced: 9 days ago
JSON representation

coding katas

• Host: GitHub
• URL: https://github.com/programmer-ke/coding-katas
• Owner: programmer-ke
• Created: 2021-01-31T11:46:42.000Z (almost 4 years ago)
• Default Branch: master
• Last Pushed: 2024-11-07T06:26:47.000Z (11 days ago)
• Last Synced: 2024-11-07T07:27:02.467Z (11 days ago)
• Language: Python
• Homepage:
• Size: 362 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Codings

The goal here is that each file demostrates a single concept in for

quick reference.

## Index

- [string_search.org](org/string_search.org): Naive and optimized string searching

- [search_swahili.ipynb](ipynb/search_swahili.ipynb): Exploring search techniques with Swahili text

- [model_from_scratch_mnist.ipynb](ipynb/model_from_scratch_mnist.ipynb): A simple ML model (almost) from scratch

- [generating_pseudorandom_numbers.py](py/generating_pseudorandom_numbers.py): pseudo-random number generator

- [generating_primes.py](py/generating_primes.py): Generating prime numbers

- [gcd.py](py/gcd.py): Calculating the greatest common divisor

- [square_root.py](py/square_root.py): Calculate square root of a number

- [base_conversion.py](py/base_conversion.py): Convert a number from on base to another

- [cosine.py](py/cosine.py): Calculate cosine using the taylor series

- [factorials.py](py/factorials.py): Check if a number is a factorial

- [simple_recursive_descent_parser.py](py/simple_recursive_descent_parser.py): A simple recursive descent parser

- [bit_manipulation.py](py/bit_manipulation.py): Bit manipulation

- [binary_search.py](py/binary_search.py): Binary Search

- [quicksort.py](py/quicksort.py): Quicksort

- [hash_table.py](py/hash_table.py): Hash table with separate chaining

- [nth_fibonacci.py](py/nth_fibonacci.py): Find the nth fibonacci number

- [fibonacci_sequence.py](py/fibonacci_sequence.py): Different approaches to generating the fibonacci sequence

### Heaps

- [heaps.py](py/heaps.py): Heap implementation

- [heapsort.py](py/heapsort.py): Heapsort

### Binary Trees

- [binary_search_trees.org](org/binary_search_trees.org): Binary search tree basics

- [kth_largest.py](py/kth_largest.py): Find kth largest element using binary search tree

### Linked Lists

- [detect_linkedlist_cycle.org](org/detect_linkedlist_cycle.org): Detect cycle in linked list

- [reverse_linkedlist.py](py/reverse_linkedlist.py): Initialize and reverse a linked list

## Others

These are code samples from other sources that I include here for reference

- Max Connected colours in a grid [code](others/max_connected.py)

- Basic sorting Algorithms [code](others/sorting_algos.py)