GitHub - NguyenHai-LETI/100days: 100 days of algorithms

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 112 Commits
resource		resource
.gitignore		.gitignore
README.md		README.md
bonus - fast convex hull.ipynb		bonus - fast convex hull.ipynb
day 00 - logo.ipynb		day 00 - logo.ipynb
day 01 - hanoi tower.ipynb		day 01 - hanoi tower.ipynb
day 02 - matrix chain multiplication.ipynb		day 02 - matrix chain multiplication.ipynb
day 03 - next permutation.ipynb		day 03 - next permutation.ipynb
day 04 - counting 1-bits.ipynb		day 04 - counting 1-bits.ipynb
day 05 - eratosthenes sieve.ipynb		day 05 - eratosthenes sieve.ipynb
day 06 - postfix notation.ipynb		day 06 - postfix notation.ipynb
day 07 - binary addition FSA.ipynb		day 07 - binary addition FSA.ipynb
day 08 - binary search.ipynb		day 08 - binary search.ipynb
day 09 - monte carlo - pi.ipynb		day 09 - monte carlo - pi.ipynb
day 10 - karatsuba multiplication.ipynb		day 10 - karatsuba multiplication.ipynb
day 11 - McCarthy 91.ipynb		day 11 - McCarthy 91.ipynb
day 12 - roots of polynomial.ipynb		day 12 - roots of polynomial.ipynb
day 13 - extended euclidean algorithm.ipynb		day 13 - extended euclidean algorithm.ipynb
day 14 - huffman codes.ipynb		day 14 - huffman codes.ipynb
day 15 - breaking OTP.ipynb		day 15 - breaking OTP.ipynb
day 16 - no-condition swap.ipynb		day 16 - no-condition swap.ipynb
day 17 - perceptron.ipynb		day 17 - perceptron.ipynb
day 18 - monopoly.ipynb		day 18 - monopoly.ipynb
day 19 - counting inversions.ipynb		day 19 - counting inversions.ipynb
day 20 - linearithmic multiplication.ipynb		day 20 - linearithmic multiplication.ipynb
day 21 - k-means.ipynb		day 21 - k-means.ipynb
day 22 - determinant.ipynb		day 22 - determinant.ipynb
day 23 - sudoku.ipynb		day 23 - sudoku.ipynb
day 24 - closest pair.ipynb		day 24 - closest pair.ipynb
day 25 - conjugate gradients.ipynb		day 25 - conjugate gradients.ipynb
day 26 - karger's mincut.ipynb		day 26 - karger's mincut.ipynb
day 27 - spiral matrix.ipynb		day 27 - spiral matrix.ipynb
day 28 - convex hull.ipynb		day 28 - convex hull.ipynb
day 29 - string searching.ipynb		day 29 - string searching.ipynb
day 30 - strassen multiplication.ipynb		day 30 - strassen multiplication.ipynb
day 31 - timeit.ipynb		day 31 - timeit.ipynb
day 32 - pagerank.ipynb		day 32 - pagerank.ipynb
day 33 - reservoir sampling.ipynb		day 33 - reservoir sampling.ipynb
day 34 - aho-corasick.ipynb		day 34 - aho-corasick.ipynb
day 35 - median.ipynb		day 35 - median.ipynb
day 36 - bulls and cows.ipynb		day 36 - bulls and cows.ipynb
day 37 - longest common subsequence.ipynb		day 37 - longest common subsequence.ipynb
day 38 - burrows-wheeler.ipynb		day 38 - burrows-wheeler.ipynb
day 39 - 4sum.ipynb		day 39 - 4sum.ipynb
day 40 - counting ones.ipynb		day 40 - counting ones.ipynb
day 41 - union-find.ipynb		day 41 - union-find.ipynb
day 42 - hamming codes.ipynb		day 42 - hamming codes.ipynb
day 43 - shuffle.ipynb		day 43 - shuffle.ipynb
day 44 - gradient approximation.ipynb		day 44 - gradient approximation.ipynb
day 45 - binary search tree.ipynb		day 45 - binary search tree.ipynb
day 46 - bézier curve.ipynb		day 46 - bézier curve.ipynb
day 47 - factoradic.ipynb		day 47 - factoradic.ipynb
day 48 - dijkstra.ipynb		day 48 - dijkstra.ipynb
day 49 - ford-fulkerson.ipynb		day 49 - ford-fulkerson.ipynb
day 50 - game of life.ipynb		day 50 - game of life.ipynb
day 51 - rabin-miller.ipynb		day 51 - rabin-miller.ipynb
day 52 - RSA.ipynb		day 52 - RSA.ipynb
day 53 - RSA encryption scheme.ipynb		day 53 - RSA encryption scheme.ipynb
day 54 - longest unique sequence.ipynb		day 54 - longest unique sequence.ipynb
day 55 - quincunx.ipynb		day 55 - quincunx.ipynb
day 56 - lzw.ipynb		day 56 - lzw.ipynb
day 57 - quicksort.ipynb		day 57 - quicksort.ipynb
day 58 - integer exponentation.ipynb		day 58 - integer exponentation.ipynb
day 59 - colored tiling.ipynb		day 59 - colored tiling.ipynb
day 60 - bloom filter.ipynb		day 60 - bloom filter.ipynb
day 61 - hanoi tower II.ipynb		day 61 - hanoi tower II.ipynb
day 62 - linked-list cycle.ipynb		day 62 - linked-list cycle.ipynb
day 63 - zig-zag.ipynb		day 63 - zig-zag.ipynb
day 64 - k-clique.ipynb		day 64 - k-clique.ipynb
day 65 - floyd-warshall.ipynb		day 65 - floyd-warshall.ipynb
day 66 - gram-schmidt.ipynb		day 66 - gram-schmidt.ipynb
day 67 - linked-list mergesort.ipynb		day 67 - linked-list mergesort.ipynb
day 68 - gale-shapley.ipynb		day 68 - gale-shapley.ipynb
day 69 - rmsprop.ipynb		day 69 - rmsprop.ipynb
day 70 - deadlock.ipynb		day 70 - deadlock.ipynb
day 71 - hashtable - chaining.ipynb		day 71 - hashtable - chaining.ipynb
day 72 - hashtable - open addressing.ipynb		day 72 - hashtable - open addressing.ipynb
day 73 - bresenhams line.ipynb		day 73 - bresenhams line.ipynb
day 74 - google interview question.ipynb		day 74 - google interview question.ipynb
day 75 - merkles puzzles.ipynb		day 75 - merkles puzzles.ipynb
day 76 - 2-3 tree.ipynb		day 76 - 2-3 tree.ipynb
day 77 - unification.ipynb		day 77 - unification.ipynb
day 78 - horn-satifiability.ipynb		day 78 - horn-satifiability.ipynb
day 79 - logistic regression.ipynb		day 79 - logistic regression.ipynb
day 80 - hopfield net.ipynb		day 80 - hopfield net.ipynb
day 81 - topological sort.ipynb		day 81 - topological sort.ipynb
day 82 - flood fill.ipynb		day 82 - flood fill.ipynb
day 83 - breaking AES.ipynb		day 83 - breaking AES.ipynb
day 84 - maze generation.ipynb		day 84 - maze generation.ipynb
day 85 - coin success runs.ipynb		day 85 - coin success runs.ipynb
day 86 - binary heap.ipynb		day 86 - binary heap.ipynb
day 87 - gray code.ipynb		day 87 - gray code.ipynb
day 88 - perlin noise.ipynb		day 88 - perlin noise.ipynb
day 89 - bipartiteness.ipynb		day 89 - bipartiteness.ipynb
day 90 - simple nim - AI.ipynb		day 90 - simple nim - AI.ipynb
day 91 - variations.ipynb		day 91 - variations.ipynb
day 92 - PCA.ipynb		day 92 - PCA.ipynb
day 93 - first and follow.ipynb		day 93 - first and follow.ipynb
day 94 - earley parser.ipynb		day 94 - earley parser.ipynb
day 95 - strongly connected components.ipynb		day 95 - strongly connected components.ipynb

Repository files navigation

100 days of algorithms

This repository contains notebooks with live code to accompany 100 days of algorithms challenge.

I set the challenge for myself to implement algorithm by algorithm, day by day, until the number reaches 100.

If you are interested, here's the intro to the series and all the articles sorted by date from the latest.

The challenge was quite fun and rough, as well. Do not expect the implementations to be the best, nor fastest, nor nicest, nor bug-free. Do expect to see code written in haste. A code that contains the same amount of enthusiasm and love to algorithms as many it contains bugs.

Feel free to (re)use my code in any way you wish, but bare in mind that the source code is provided "as-is". It is on your own risk and you are solely responsible for whatever happens then.

local machine

download and install the latest version of Anaconda distribution
clone the repo: git clone https://github.com/coells/100days.git
open terminal and run Jupyter notebook: jupyter notebook
open localhost:8888 in your browser

notes

the codebase was developed using Python 3.6 and Anaconda 4.3.1
notebooks containing Bokeh plots are not directly supported by Github; you better clone the repo a run notebooks locally

alternate repository

Microsoft Azure Notebooks with Python 3.5 support

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

100 days of algorithms

local machine

notes

alternate repository

About

Releases

Packages

Languages

NguyenHai-LETI/100days

Folders and files

Latest commit

History

Repository files navigation

100 days of algorithms

local machine

notes

alternate repository

About

Resources

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages