Stars
A simple Tic-Tac-Toe implemented in primitive HTML, CSS, and JavaScript.
An easy-to-use class that implements Knuth-Morris-Pratt algorithm.
A simple, reusable implementation of Disjoint Set Union algorithm.
Standard Binary Indexed Tree and its variants.
An algorithm to get the longest common subsequence of two arrays
Algorithm to find the lowest common ancestor of two nodes in a tree.
Find a minimum element within a specified range in O(log n).
Several implementations of Segment Tree data structure for different tasks.
Convex Hull Trick for Dynamic Programming
Proposal & Reject Algorithm Example
Maximum Cost Maximum Matching
Edmons Karp and Dinic's Algorithms for Maximum Flow
Bellman Ford Algorithm for Minimum Cost Maximum Flow
DFS Algorithms to find Connected Components