# coells/100days **Attribution required: if you use, quote, or summarise this content, you must credit and link back to [awesome-repositories.com](https://awesome-repositories.com/repository/coells-100days).** 7,488 stars · 1,162 forks · Jupyter Notebook ## Links - GitHub: https://github.com/coells/100days - awesome-repositories: https://awesome-repositories.com/repository/coells-100days.md ## Description This project is a comprehensive collection of computer science implementations and an algorithm tutorial repository. It serves as a study guide and reference for competitive programming, providing executable code examples that demonstrate fundamental algorithmic problem solving and mathematical computation. The library covers a wide range of specialized domains, including cryptography and security primitives, lossless data compression techniques, and computational geometry for spatial analysis. It also features implementations of machine learning models, linear algebra operations, and formal language parsing. The collection includes extensive resources on graph algorithms, fundamental data structures, numerical methods, and logic-based algorithm simulations. It also provides utilities for measuring code execution time to analyze performance. The implementations are provided as Jupyter Notebooks. ## Tags ### Education & Learning Resources - [Algorithm Collections](https://awesome-repositories.com/f/education-learning-resources/algorithm-collections.md) — Offers a comprehensive collection of fundamental data structures and algorithms for educational and reference purposes. - [Algorithm Tutorials](https://awesome-repositories.com/f/education-learning-resources/algorithm-tutorials.md) — Provides step-by-step implementations and tutorials covering graph theory, cryptography, and numerical analysis. - [Computer Science Study Guides](https://awesome-repositories.com/f/education-learning-resources/educational-resources/algorithms-theory-academics/academic-curricula-resources/comprehensive-curricula-guides/computer-science-study-guides.md) — Acts as a structured study guide for learning algorithmic problem solving and mathematical computation. - [Divide And Conquer Algorithms](https://awesome-repositories.com/f/education-learning-resources/educational-resources/algorithms-theory-academics/cs-theory-foundations/algorithms/algorithmic-paradigms/divide-and-conquer-algorithms.md) — Implements the divide-and-conquer paradigm to optimize complex computational problems. - [Multiway Search Trees](https://awesome-repositories.com/f/education-learning-resources/educational-resources/algorithms-theory-academics/cs-theory-foundations/data-structure-implementations/data-structures/balanced-search-trees/multiway-search-trees.md) — Implements 2-3 trees as a specific type of balanced multiway search tree for efficient data retrieval. ([source](https://github.com/coells/100days/blob/master/day%2076%20-%202-3%20tree.ipynb)) - [Zig-Zag Traversals](https://awesome-repositories.com/f/education-learning-resources/educational-resources/algorithms-theory-academics/algorithm-data-structure-guides/binary-trees/zig-zag-traversals.md) — Implements a zig-zag traversal that processes elements by oscillating between the extremes of a dataset. ([source](https://github.com/coells/100days/blob/master/day%2063%20-%20zig-zag.ipynb)) - [Gray Code Sequences](https://awesome-repositories.com/f/education-learning-resources/educational-resources/algorithms-theory-academics/cs-theory-foundations/algorithms/cryptography-and-coding-theory/error-correction-codes/gray-code-sequences.md) — Implements algorithms to generate binary sequences where consecutive values differ by only one bit. ([source](https://github.com/coells/100days/blob/master/day%2087%20-%20gray%20code.ipynb)) - [Maximum Flow Calculation](https://awesome-repositories.com/f/education-learning-resources/educational-resources/algorithms-theory-academics/cs-theory-foundations/algorithms/data-ordering-and-retrieval/network-flow-algorithms/network-flow-algorithms/maximum-flow-calculation.md) — Implements the Ford-Fulkerson algorithm to determine the maximum flow from a source to a sink in a network. ([source](https://github.com/coells/100days/blob/master/day%2049%20-%20ford-fulkerson.ipynb)) - [Cellular Automata](https://awesome-repositories.com/f/education-learning-resources/educational-resources/algorithms-theory-academics/cs-theory-foundations/computer-science-foundations/cellular-automata.md) — Provides an implementation of grid-based cellular automata simulations. ([source](https://github.com/coells/100days/blob/master/day%2050%20-%20game%20of%20life.ipynb)) - [Dijkstra Implementations](https://awesome-repositories.com/f/education-learning-resources/path-optimization-algorithms/weighted-graph-path-optimizations/dijkstra-implementations.md) — Implements Dijkstra's algorithm to find the most efficient path between nodes in a weighted graph. ([source](https://github.com/coells/100days/blob/master/day%2048%20-%20dijkstra.ipynb)) ### Part of an Awesome List - [Open Addressing Implementations](https://awesome-repositories.com/f/awesome-lists/data/data-structures/open-addressing-implementations.md) — Implements a hash table that uses open addressing to resolve collisions within a flat array. ([source](https://github.com/coells/100days/blob/master/day%2072%20-%20hashtable%20-%20open%20addressing.ipynb)) - [Logical Unification](https://awesome-repositories.com/f/awesome-lists/ai/logic-programming/logical-unification.md) — Implements the logical unification algorithm to find substitutions that make two terms identical. ([source](https://github.com/coells/100days/blob/master/day%2077%20-%20unification.ipynb)) - [Hopfield Networks](https://awesome-repositories.com/f/awesome-lists/ai/neural-network-architectures/hopfield-networks.md) — Implements a Hopfield network for associative memory and pattern retrieval. ([source](https://github.com/coells/100days/blob/master/day%2080%20-%20hopfield%20net.ipynb)) - [First and Follow Set Computation](https://awesome-repositories.com/f/awesome-lists/devtools/parsing-and-grammars/first-and-follow-set-computation.md) — Calculates First and Follow sets for grammar productions to enable predictive parsing. ([source](https://github.com/coells/100days/blob/master/day%2093%20-%20first%20and%20follow.ipynb)) ### Data & Databases - [Hash Tables](https://awesome-repositories.com/f/data-databases/hash-tables.md) — Implements a hash table that resolves collisions using a chaining strategy with linked lists. ([source](https://github.com/coells/100days/blob/master/day%2071%20-%20hashtable%20-%20chaining.ipynb)) - [Adjacency Lists](https://awesome-repositories.com/f/data-databases/list-data-structures/adjacency-lists.md) — Implements adjacency lists for representing graph relationships and computing connectivity. - [Probabilistic Data Structures](https://awesome-repositories.com/f/data-databases/probabilistic-data-structures.md) — Implements a Bloom filter for space-efficient probabilistic membership testing. ([source](https://github.com/coells/100days/blob/master/day%2060%20-%20bloom%20filter.ipynb)) - [Reservoir Samplers](https://awesome-repositories.com/f/data-databases/data-management/sample-data-loaders/statistical-sampling/reservoir-samplers.md) — Implements reservoir sampling to select a random subset of items from a data stream in one pass. ([source](https://github.com/coells/100days/blob/master/day%2033%20-%20reservoir%20sampling.ipynb)) - [Dictionary-Based Compression](https://awesome-repositories.com/f/data-databases/dictionary-based-compression.md) — Implements Lempel-Ziv-Welch (LZW) compression using a dynamic dictionary to reduce data size. ([source](https://github.com/coells/100days/blob/master/day%2056%20-%20lzw.ipynb)) ### Development Tools & Productivity - [Competitive Programming Repositories](https://awesome-repositories.com/f/development-tools-productivity/competitive-programming-repositories.md) — Serves as a reference library of optimized patterns and techniques specifically for competitive programming. ### Programming Languages & Runtimes - [Heaps](https://awesome-repositories.com/f/programming-languages-runtimes/programming-utilities/data-structure-type-helpers/data-structures/hierarchical-tree-structures/heaps.md) — Implements a binary heap data structure for efficient priority-based element access. ([source](https://github.com/coells/100days/blob/master/day%2086%20-%20binary%20heap.ipynb)) - [Longest Common](https://awesome-repositories.com/f/programming-languages-runtimes/programming-utilities/data-structure-type-helpers/data-type-utilities/subsequence-algorithms/longest-common.md) — Implements an algorithm to identify the longest sequence of elements appearing in the same relative order across two datasets. ([source](https://github.com/coells/100days/blob/master/day%2037%20-%20longest%20common%20subsequence.ipynb)) ### Scientific & Mathematical Computing - [Discrete Algorithm Implementations](https://awesome-repositories.com/f/scientific-mathematical-computing/discrete-algorithm-implementations.md) — Provides independent functional units that execute specific discrete mathematical and computational procedures. - [Inversion Counting Algorithms](https://awesome-repositories.com/f/scientific-mathematical-computing/numerical-mathematical-foundations/arithmetic-number-types/multiplication-algorithms/number-theory-algorithms/inversion-counting-algorithms.md) — Implements algorithms to count inversions in a sequence to measure its degree of unsortedness. ([source](https://github.com/coells/100days/blob/master/day%2019%20-%20counting%20inversions.ipynb)) - [Bipartite Graph Detection](https://awesome-repositories.com/f/scientific-mathematical-computing/bipartite-graph-detection.md) — Implements a graph algorithm to detect if vertices can be split into two independent sets. ([source](https://github.com/coells/100days/blob/master/day%2089%20-%20bipartiteness.ipynb)) - [Burrows-Wheeler Transforms](https://awesome-repositories.com/f/scientific-mathematical-computing/burrows-wheeler-transforms.md) — Implements the Burrows-Wheeler Transform to reorganize data sequences for improved lossless compression. ([source](https://github.com/coells/100days/blob/master/day%2038%20-%20burrows-wheeler.ipynb)) - [Closest Pair of Points Algorithms](https://awesome-repositories.com/f/scientific-mathematical-computing/closest-pair-of-points-algorithms.md) — Implements an efficient search algorithm to find the closest pair of points in a set. ([source](https://github.com/coells/100days/blob/master/day%2024%20-%20closest%20pair.ipynb)) - [Finite State Automata](https://awesome-repositories.com/f/scientific-mathematical-computing/finite-state-automata.md) — Implements a Finite State Automaton to calculate the sum of two binary numbers. ([source](https://github.com/coells/100days/blob/master/day%2007%20-%20binary%20addition%20FSA.ipynb)) - [Divide-and-Conquer Matrix Multiplication](https://awesome-repositories.com/f/scientific-mathematical-computing/generalized-matrix-multiplications/divide-and-conquer-matrix-multiplication.md) — Implements Strassen's algorithm for efficient matrix multiplication using divide-and-conquer. ([source](https://github.com/coells/100days/blob/master/day%2030%20-%20strassen%20multiplication.ipynb)) - [Global Minimum Cut Algorithms](https://awesome-repositories.com/f/scientific-mathematical-computing/global-minimum-cut-algorithms.md) — Implements Karger's algorithm to identify the minimum cut of a weighted graph by randomly contracting edges. ([source](https://github.com/coells/100days/blob/master/day%2026%20-%20karger's%20mincut.ipynb)) - [Huffman Coding Implementations](https://awesome-repositories.com/f/scientific-mathematical-computing/huffman-coding-implementations.md) — Implements Huffman coding for lossless data compression using variable-length prefix codes. ([source](https://github.com/coells/100days/blob/master/day%2014%20-%20huffman%20codes.ipynb)) - [K-Clique Identification](https://awesome-repositories.com/f/scientific-mathematical-computing/k-clique-identification.md) — Implements an algorithm to identify complete subgraphs of a specific size k within a graph. ([source](https://github.com/coells/100days/blob/master/day%2064%20-%20k-clique.ipynb)) - [Principal Component Analysis](https://awesome-repositories.com/f/scientific-mathematical-computing/linear-algebra-routines/principal-component-analysis.md) — Provides an implementation of Principal Component Analysis for dimensionality reduction. ([source](https://github.com/coells/100days/blob/master/day%2092%20-%20PCA.ipynb)) - [Conjugate Gradient Solvers](https://awesome-repositories.com/f/scientific-mathematical-computing/linear-system-solvers/conjugate-gradient-solvers.md) — Implements a conjugate gradient solver for sparse systems of linear equations. ([source](https://github.com/coells/100days/blob/master/day%2025%20-%20conjugate%20gradients.ipynb)) - [Tower of Hanoi Solvers](https://awesome-repositories.com/f/scientific-mathematical-computing/mathematical-algorithms/mathematical-sequences/tower-of-hanoi-solvers.md) — Implements a solver for the Tower of Hanoi puzzle using recursive logic. ([source](https://github.com/coells/100days/blob/master/day%2061%20-%20hanoi%20tower%20II.ipynb)) - [Matrix Calculation Utilities](https://awesome-repositories.com/f/scientific-mathematical-computing/matrix-calculation-utilities.md) — Provides utilities for calculating the determinant of square matrices. ([source](https://github.com/coells/100days/blob/master/day%2022%20-%20determinant.ipynb)) - [Matrix Pattern Traversal Algorithms](https://awesome-repositories.com/f/scientific-mathematical-computing/matrix-pattern-traversal-algorithms.md) — Implements an iterative routine for extracting elements from a two-dimensional array using a clockwise spiral path. ([source](https://github.com/coells/100days/blob/master/day%2027%20-%20spiral%20matrix.ipynb)) - [Monte Carlo Sampling](https://awesome-repositories.com/f/scientific-mathematical-computing/monte-carlo-sampling.md) — Approximates the value of pi using randomized point sampling within a geometric boundary. ([source](https://github.com/coells/100days/blob/master/day%2009%20-%20monte%20carlo%20-%20pi.ipynb)) - [Number Theory Algorithms](https://awesome-repositories.com/f/scientific-mathematical-computing/number-theory-algorithms.md) — Implements the Extended Euclidean Algorithm for calculating the greatest common divisor. ([source](https://github.com/coells/100days/blob/master/day%2013%20-%20extended%20euclidean%20algorithm.ipynb)) - [Numerical Approximation Methods](https://awesome-repositories.com/f/scientific-mathematical-computing/numerical-approximation-methods.md) — Implements iterative numerical methods for approximating mathematical values and roots. - [Set Bit Counting](https://awesome-repositories.com/f/scientific-mathematical-computing/numerical-mathematical-foundations/algorithms-and-complexity/algorithms/bit-manipulation-techniques/bit-range-manipulators/set-bit-counting.md) — Implements a bit counting algorithm to determine the number of set bits in an integer. ([source](https://github.com/coells/100days/blob/master/day%2004%20-%20counting%201-bits.ipynb)) - [Error Correction Codes](https://awesome-repositories.com/f/scientific-mathematical-computing/numerical-mathematical-foundations/algorithms-and-complexity/algorithms/bit-manipulation-techniques/error-correction-codes.md) — Implements Hamming codes for the detection and correction of single-bit errors in data streams. ([source](https://github.com/coells/100days/blob/master/day%2042%20-%20hamming%20codes.ipynb)) - [Shortest Path Algorithms](https://awesome-repositories.com/f/scientific-mathematical-computing/numerical-mathematical-foundations/algorithms-and-complexity/algorithms/graph-processing/shortest-path-algorithms.md) — Implements the Floyd-Warshall algorithm to calculate the shortest distance between all pairs of vertices in a weighted graph. ([source](https://github.com/coells/100days/blob/master/day%2065%20-%20floyd-warshall.ipynb)) - [Karatsuba Multiplication](https://awesome-repositories.com/f/scientific-mathematical-computing/numerical-mathematical-foundations/arithmetic-number-types/multiplication-algorithms/karatsuba-multiplication.md) — Implements the Karatsuba algorithm to reduce the complexity of multiplying large integers. ([source](https://github.com/coells/100days/blob/master/day%2010%20-%20karatsuba%20multiplication.ipynb)) - [Exponentiation Algorithms](https://awesome-repositories.com/f/scientific-mathematical-computing/numerical-mathematical-foundations/arithmetic-number-types/multiplication-algorithms/number-theory-algorithms/exponentiation-algorithms.md) — Provides efficient programmatic implementations for calculating the power of an integer. ([source](https://github.com/coells/100days/blob/master/day%2058%20-%20integer%20exponentation.ipynb)) - [Lexicographical Sequence Generators](https://awesome-repositories.com/f/scientific-mathematical-computing/numerical-mathematical-foundations/arithmetic-number-types/multiplication-algorithms/number-theory-algorithms/lexicographical-sequence-generators.md) — Computes the lexicographically next permutation of a sequence of elements. ([source](https://github.com/coells/100days/blob/master/day%2003%20-%20next%20permutation.ipynb)) - [Prime Generation Algorithms](https://awesome-repositories.com/f/scientific-mathematical-computing/numerical-mathematical-foundations/arithmetic-number-types/multiplication-algorithms/number-theory-algorithms/prime-generation-algorithms.md) — Implements the Sieve of Eratosthenes to find all prime numbers up to a specified limit. ([source](https://github.com/coells/100days/blob/master/day%2005%20-%20eratosthenes%20sieve.ipynb)) - [Primality Testing](https://awesome-repositories.com/f/scientific-mathematical-computing/numerical-mathematical-foundations/arithmetic-number-types/multiplication-algorithms/number-theory-algorithms/prime-generation-algorithms/primality-testing.md) — Implements the probabilistic Rabin-Miller test for verifying the primality of large integers. ([source](https://github.com/coells/100days/blob/master/day%2051%20-%20rabin-miller.ipynb)) - [Convex Hull Computation](https://awesome-repositories.com/f/scientific-mathematical-computing/numerical-mathematical-foundations/computational-geometry/geometric-algorithms/convex-hull-computation.md) — Provides algorithms for computing the smallest convex hull enclosing a set of points. ([source](https://github.com/coells/100days/blob/master/bonus%20-%20fast%20convex%20hull.ipynb)) - [PageRank Algorithms](https://awesome-repositories.com/f/scientific-mathematical-computing/pagerank-algorithms.md) — Implements a PageRank calculation to rank the importance of nodes in a network via link analysis. ([source](https://github.com/coells/100days/blob/master/day%2032%20-%20pagerank.ipynb)) - [Root Finding Algorithms](https://awesome-repositories.com/f/scientific-mathematical-computing/polynomial-arithmetic/root-finding-algorithms.md) — Provides algorithms to calculate the roots of polynomial functions. ([source](https://github.com/coells/100days/blob/master/day%2012%20-%20roots%20of%20polynomial.ipynb)) - [Stable Matching Algorithms](https://awesome-repositories.com/f/scientific-mathematical-computing/stable-matching-algorithms.md) — Implements the Gale-Shapley algorithm for pairing members of two groups based on mutual preferences. ([source](https://github.com/coells/100days/blob/master/day%2068%20-%20gale-shapley.ipynb)) - [Strongly Connected Components Algorithms](https://awesome-repositories.com/f/scientific-mathematical-computing/strongly-connected-components-algorithms.md) — Implements algorithms to identify strongly connected components within directed graphs. ([source](https://github.com/coells/100days/blob/master/day%2095%20-%20strongly%20connected%20components.ipynb)) - [Topological Sorting](https://awesome-repositories.com/f/scientific-mathematical-computing/topological-sorting.md) — Provides an implementation of the topological sorting algorithm for directed acyclic graphs. ([source](https://github.com/coells/100days/blob/master/day%2081%20-%20topological%20sort.ipynb)) - [Vector Orthogonalization Algorithms](https://awesome-repositories.com/f/scientific-mathematical-computing/vector-orthogonalization-algorithms.md) — Implements the Gram-Schmidt process for transforming vectors into an orthogonal basis. ([source](https://github.com/coells/100days/blob/master/day%2066%20-%20gram-schmidt.ipynb)) ### Software Engineering & Architecture - [Backtracking Algorithms](https://awesome-repositories.com/f/software-engineering-architecture/backtracking-algorithms.md) — Implements state-space exploration using backtracking algorithms to find valid solutions. - [Cycle Detection Algorithms](https://awesome-repositories.com/f/software-engineering-architecture/cycle-detection-algorithms.md) — Implements algorithms for detecting cycles and loops within linked list data structures. ([source](https://github.com/coells/100days/blob/master/day%2062%20-%20linked-list%20cycle.ipynb)) - [Priority Queues](https://awesome-repositories.com/f/software-engineering-architecture/queue-implementations/priority-queues.md) — Provides a priority queue implementation for efficient element retrieval in pathfinding. - [Standard Binary Searches](https://awesome-repositories.com/f/software-engineering-architecture/sorting-algorithms/sorted-array-searchers/standard-binary-searches.md) — Implements the standard binary search algorithm to locate values in sorted arrays. ([source](https://github.com/coells/100days/blob/master/day%2008%20-%20binary%20search.ipynb)) - [Puzzle Solvers](https://awesome-repositories.com/f/software-engineering-architecture/algorithmic-problem-solving/puzzle-solvers.md) — Provides a backtracking-based algorithmic solver for Sudoku puzzles. ([source](https://github.com/coells/100days/blob/master/day%2023%20-%20sudoku.ipynb)) - [Cryptographic Puzzles](https://awesome-repositories.com/f/software-engineering-architecture/algorithmic-problem-solving/puzzle-solvers/cryptographic-puzzles.md) — Implements the logic to solve Merkle's puzzles for recovering secret keys through iterative bit guessing. ([source](https://github.com/coells/100days/blob/master/day%2075%20-%20merkles%20puzzles.ipynb)) - [SAT Solvers](https://awesome-repositories.com/f/software-engineering-architecture/backtracking-algorithms/sat-solvers.md) — Provides a solver for Horn clauses using unit propagation to determine satisfiability. ([source](https://github.com/coells/100days/blob/master/day%2078%20-%20horn-satifiability.ipynb)) - [Four-Sum Solvers](https://awesome-repositories.com/f/software-engineering-architecture/combination-sum-algorithms/four-sum-solvers.md) — Implements an algorithm to locate all unique quadruplets in an array that sum to a specific target value. ([source](https://github.com/coells/100days/blob/master/day%2039%20-%204sum.ipynb)) - [Disjoint Set Union](https://awesome-repositories.com/f/software-engineering-architecture/disjoint-set-union.md) — Implements Union-Find data structures for tracking connected components and managing disjoint sets. ([source](https://github.com/coells/100days/blob/master/day%2041%20-%20union-find.ipynb)) - [Postfix Expression Evaluators](https://awesome-repositories.com/f/software-engineering-architecture/expression-transformers/notation-converters/postfix-expression-evaluators.md) — Evaluates mathematical expressions in reverse polish notation using a stack-based approach. ([source](https://github.com/coells/100days/blob/master/day%2006%20-%20postfix%20notation.ipynb)) - [Finite State Machine Engines](https://awesome-repositories.com/f/software-engineering-architecture/finite-state-machine-engines.md) — Provides a finite-state machine engine to process sequences of symbols and transitions. - [Collection Shuffling](https://awesome-repositories.com/f/software-engineering-architecture/in-place-array-manipulations/collection-shuffling.md) — Implements algorithms for randomly rearranging elements within a list to create a non-deterministic ordering. ([source](https://github.com/coells/100days/blob/master/day%2043%20-%20shuffle.ipynb)) - [Linked List Sorting Algorithms](https://awesome-repositories.com/f/software-engineering-architecture/linked-lists/linked-list-sorting-algorithms.md) — Implements a mergesort algorithm specifically for organizing elements within a linked list. ([source](https://github.com/coells/100days/blob/master/day%2067%20-%20linked-list%20mergesort.ipynb)) - [Permutation Generation Algorithms](https://awesome-repositories.com/f/software-engineering-architecture/permutation-generation-algorithms.md) — Implements factoradic permutation generation for unique sequence ordering. ([source](https://github.com/coells/100days/blob/master/day%2047%20-%20factoradic.ipynb)) - [Linear-Time Multiplication](https://awesome-repositories.com/f/software-engineering-architecture/sorting-algorithms/linear-time-integer-sorts/linear-time-multiplication.md) — Implements high-performance integer multiplication algorithms with linearithmic time complexity. ([source](https://github.com/coells/100days/blob/master/day%2020%20-%20linearithmic%20multiplication.ipynb)) - [Quicksorts](https://awesome-repositories.com/f/software-engineering-architecture/sorting-algorithms/quicksorts.md) — Implements the Quicksort algorithm using recursive partitioning around a pivot to organize arrays. ([source](https://github.com/coells/100days/blob/master/day%2057%20-%20quicksort.ipynb)) - [String Matching Algorithms](https://awesome-repositories.com/f/software-engineering-architecture/string-matching-algorithms.md) — Implements various pattern-matching techniques to locate substrings within text. ([source](https://github.com/coells/100days/blob/master/day%2029%20-%20string%20searching.ipynb)) - [Multi-Pattern Matching Algorithms](https://awesome-repositories.com/f/software-engineering-architecture/string-matching-algorithms/multi-pattern-matching-algorithms.md) — Implements the Aho-Corasick algorithm to find multiple patterns in text simultaneously. ([source](https://github.com/coells/100days/blob/master/day%2034%20-%20aho-corasick.ipynb)) - [Longest Substring Identification](https://awesome-repositories.com/f/software-engineering-architecture/string-processing-algorithms/substring-counting/longest-substring-identification.md) — Implements a technique to identify the length of the longest contiguous substring containing no repeating characters. ([source](https://github.com/coells/100days/blob/master/day%2054%20-%20longest%20unique%20sequence.ipynb)) - [Earley Parser Implementations](https://awesome-repositories.com/f/software-engineering-architecture/trees/syntax-tree-construction/grammar-based-parsers/earley-parser-implementations.md) — Implements the Earley parsing algorithm to handle context-free grammars and recursive syntax. ([source](https://github.com/coells/100days/blob/master/day%2094%20-%20earley%20parser.ipynb)) ### Artificial Intelligence & ML - [Numerical Gradient Approximations](https://awesome-repositories.com/f/artificial-intelligence-ml/gradient-computation/numerical-gradient-approximations.md) — Provides numerical gradient approximations using finite difference methods. ([source](https://github.com/coells/100days/blob/master/day%2044%20-%20gradient%20approximation.ipynb)) - [K-Means Clustering](https://awesome-repositories.com/f/artificial-intelligence-ml/k-means-clustering.md) — Provides an implementation of the K-Means clustering algorithm for unlabeled data. ([source](https://github.com/coells/100days/blob/master/day%2021%20-%20k-means.ipynb)) - [Linear and Logistic Regression](https://awesome-repositories.com/f/artificial-intelligence-ml/linear-and-logistic-regression.md) — Implements logistic regression for binary classification tasks. ([source](https://github.com/coells/100days/blob/master/day%2079%20-%20logistic%20regression.ipynb)) - [Perceptrons](https://awesome-repositories.com/f/artificial-intelligence-ml/perceptrons.md) — Implements the Perceptron model for linear binary classification. ([source](https://github.com/coells/100days/blob/master/day%2017%20-%20perceptron.ipynb)) - [RMSProp Optimizers](https://awesome-repositories.com/f/artificial-intelligence-ml/rmsprop-optimizers.md) — Implements the RMSprop optimizer for adaptive learning rate management in neural networks. ([source](https://github.com/coells/100days/blob/master/day%2069%20-%20rmsprop.ipynb)) ### Game Development - [Board Game Simulations](https://awesome-repositories.com/f/game-development/board-game-simulations.md) — Implements a logic-based simulation of the Bulls and Cows game. ([source](https://github.com/coells/100days/blob/master/day%2036%20-%20bulls%20and%20cows.ipynb)) - [Maze Simulations](https://awesome-repositories.com/f/game-development/maze-simulations.md) — Implements procedural generation of randomized maze structures for pathfinding exercises. ([source](https://github.com/coells/100days/blob/master/day%2084%20-%20maze%20generation.ipynb)) - [Nim Game Strategies](https://awesome-repositories.com/f/game-development/online-multiplayer/game-chat-bots/turn-based-game-bots/nim-game-strategies.md) — Implements the optimal mathematical winning strategy for the game of Nim. ([source](https://github.com/coells/100days/blob/master/day%2090%20-%20simple%20nim%20-%20AI.ipynb)) ### Graphics & Multimedia - [Bézier Curve Interpolations](https://awesome-repositories.com/f/graphics-multimedia/bezier-curve-interpolations.md) — Implements Bézier curve interpolation to generate smooth parametric curves. ([source](https://github.com/coells/100days/blob/master/day%2046%20-%20b%C3%A9zier%20curve.ipynb)) - [Flood Fill Algorithms](https://awesome-repositories.com/f/graphics-multimedia/flood-fill-algorithms.md) — Implements a recursive flood fill algorithm for image processing and area filling. ([source](https://github.com/coells/100days/blob/master/day%2082%20-%20flood%20fill.ipynb)) - [Probability Distributions](https://awesome-repositories.com/f/graphics-multimedia/particle-physics-simulations/probability-distributions.md) — Simulates a Quincunx board to demonstrate the central limit theorem through particle distribution. ([source](https://github.com/coells/100days/blob/master/day%2055%20-%20quincunx.ipynb)) - [Procedural Noise Textures](https://awesome-repositories.com/f/graphics-multimedia/procedural-noise-textures.md) — Implements Perlin noise algorithms to generate organic procedural textures and terrain patterns. ([source](https://github.com/coells/100days/blob/master/day%2088%20-%20perlin%20noise.ipynb)) - [Raster Line Algorithms](https://awesome-repositories.com/f/graphics-multimedia/raster-line-algorithms.md) — Implements an integer-based incremental algorithm for rendering digital straight lines. ([source](https://github.com/coells/100days/blob/master/day%2073%20-%20bresenhams%20line.ipynb)) - [Tiling Pattern Generators](https://awesome-repositories.com/f/graphics-multimedia/tiling-pattern-generators.md) — Provides algorithmic implementations for generating visually structured tiling arrangements and patterns. ([source](https://github.com/coells/100days/blob/master/day%2059%20-%20colored%20tiling.ipynb)) ### Security & Cryptography - [AES Cryptanalysis](https://awesome-repositories.com/f/security-cryptography/aes-cryptanalysis.md) — Implements cryptanalysis techniques to recover secret keys or plaintext from AES encrypted data. ([source](https://github.com/coells/100days/blob/master/day%2083%20-%20breaking%20AES.ipynb)) - [Asymmetric Encryption Libraries](https://awesome-repositories.com/f/security-cryptography/asymmetric-encryption-libraries.md) — Implements the RSA public-key cryptosystem for secure data encryption and decryption. ([source](https://github.com/coells/100days/blob/master/day%2052%20-%20RSA.ipynb)) - [Cryptanalysis Techniques](https://awesome-repositories.com/f/security-cryptography/cryptanalysis-techniques.md) — Recovers plaintexts from One-Time Pad encryption by analyzing patterns and known weaknesses. ([source](https://github.com/coells/100days/blob/master/day%2015%20-%20breaking%20OTP.ipynb)) ### Testing & Quality Assurance - [Deadlock and Starvation Detection](https://awesome-repositories.com/f/testing-quality-assurance/deadlock-and-starvation-detection.md) — Implements logic to identify circular wait conditions in resource allocation graphs to detect system deadlocks. ([source](https://github.com/coells/100days/blob/master/day%2070%20-%20deadlock.ipynb))