A central reference file containing reusable code snippets for common algorithms: binary search, KMP, tree traversals, backtracking, union-find, sliding window, monotonic stack, and more. Each snippet is self-contained with parameterized functions and can be directly extracted into a new project. The file demonstrates the pattern of consolidating algorithm templates for quick lookup and reuse.

Implements a complete linked list class with operations: get, addAtHead, addAtTail, addAtIndex, deleteAtIndex. Provides C++ and Python implementations with both singly and doubly linked list versions. The code is self-contained, follows a clear interface, and can serve as a template for any project requiring a custom linked list with all standard methods.

A standalone tutorial on the union-find data structure, including path compression and union by rank. Contains C++ implementation of a UnionFind class with find, isSame, and join methods. The code is well-structured, commented, and can be extracted as a reusable library for any graph connectivity problem.

Provides utility functions to construct a binary tree from an array input (level order) and print it in level order. The functions are self-contained, handle edge cases, and can be reused in ACM-style problems or any context where a binary tree needs to be built from a linear representation.