🗃️ DSA Cheatsheets
25 items
📄️ 0-1 BFS Algorithm
0-1 BFS Algorithm
📄️ 2D Matrix Graph Algorithms
A comprehensive guide to 2D DFS, 2D BFS, and 2D Dijkstra algorithms with code examples in JavaScript.
📄️ AVL Tree
The implementation maintains the AVL tree properties:
📄️ Advanced Algorithm Techniques
Euler Tour Technique (ETT)
📄️ Breadth-First Search (BFS) for Trees
Breadth-First Search (BFS) for Trees
📄️ Backtracking Algorithm
Backtracking Algorithm
📄️ Binary Heap
A Binary Heap is a complete binary tree that satisfies the heap property. It is a data structure commonly used to implement priority queues. There are two main types of binary heaps: the min-heap and the max-heap.
📄️ Binary Lifting
Binary lifting (also known as binary jumping or jump pointers) is an advanced algorithmic technique primarily used to solve problems involving tree traversal and finding ancestors in a tree data structure. It's particularly efficient for queries like "find the kth ancestor of a node" or "find the lowest common ancestor (LCA) of two nodes.
📄️ Binary Search and Its Variants
Binary Search
📄️ Binary Search Tree
Binary Search Tree (BST)
📄️ Binary Search Tree (BST)
Basic Structure
📄️ Bit Manipulation Basics
Bit Manipulation Basics
📄️ Boyer–Moore Majority Vote Algorithm
Boyer–Moore Majority Vote Algorithm
📄️ Bucket Sort
A detailed guide to understanding and implementing Bucket Sort.
📄️ Cantor's Diagonalization and Knuth's Algorithms Guide
Cantor's Diagonalization
📄️ Circular Buffer
A circular buffer, also known as a ring buffer, is a fixed-size data structure that operates in a circular manner, meaning that once the buffer reaches the end, it wraps around to the beginning. It is commonly used in situations where data is produced and consumed at different rates, such as in streaming data or buffering in IO operations.
📄️ Combinations and Modular Inverse
1. Combinations
📄️ Graham's Scan Algorithm & Convex Hull
Theory
📄️ Counting Sort
A detailed guide to understanding and implementing Counting Sort.
📄️ Cycle Detection in Graphs
Cycle detection is an essential aspect of graph theory, used to identify whether a graph contains cycles. This document outlines methods for detecting cycles in both directed and undirected graphs.
📄️ Cyclic Sort Algorithm
Cyclic Sort is an efficient algorithm for solving problems involving numbers that are in a range from 1 to n or 0 to n. The key idea is to place each number at its correct index.
📄️ DFS & BFS on Graphs
A comprehensive guide to implementing Depth-First Search (DFS) & BFS (Breadth-First Search) on graphs.
📄️ Depth-First Search (DFS) for Trees
Depth-First Search (DFS) for Trees
📄️ Dequeue (Double-Ended Queue) Implementation Cheatsheet
Basic Implementation
📄️ Difference Array Technique
The difference array technique (also called prefix sum of differences) is an efficient method for handling multiple range updates on arrays.
📄️ Dijkstra's Algorithm
Dijkstra's Algorithm
📄️ Euclidean and Manhattan Distance
Euclidean Distance
📄️ Divide and Conquer Technique
Overview
📄️ Dutch National Flag Algorithm
Dutch National Flag Algorithm
📄️ Dynamic Programming
Dynamic Programming (DP) is a technique used for solving complex problems by breaking them down into simpler overlapping subproblems. It involves storing the results of these subproblems to avoid redundant computations. There are two main approaches to implementing DP: Top-Down and Bottom-Up.
📄️ Euclid's Algorithm for Greatest Common Divisor (GCD)
Euclid's Algorithm for Greatest Common Divisor (GCD)
📄️ Euler Path, Hamilton Cycle, and Hierholzer's Algorithm
Table of Contents
📄️ Fenwick Tree Tutorial
A comprehensive guide to Fenwick Trees with code examples in JavaScript.
📄️ Fisher-Yates Shuffle Algorithm
The Fisher-Yates Shuffle algorithm is an efficient method for randomly shuffling a finite sequence of items. It ensures that each permutation of the sequence is equally likely.
📄️ Flood Fill Algorithm
Flood Fill Algorithm
📄️ Floyd-Warshall Algorithm
Floyd-Warshall algorithm is a classic algorithm for finding the shortest paths in a weighted graph with positive or negative edge weights (but no negative cycles). It can be used to find the shortest paths between all pairs of vertices in a graph.
📄️ Floyd's Cycle Detection Algorithm
Normal Way of Detecting a cycle
📄️ Frequency Counter Technique
Frequency Counter Technique
📄️ Gaussian Elimination
Introduction
📄️ Bipartite Graphs
A bipartite graph is a graph where the vertices can be divided into two sets such that no two vertices in the same set are adjacent.
📄️ Heap’s Algorithm
Heap’s Algorithm is a classic algorithm used to generate all possible permutations of a finite sequence. It is particularly efficient for generating permutations and is widely used in combinatorial algorithms.
📄️ Interval Problems
Interval Problems
📄️ K-Way Merge Pattern
The k-way merge pattern is a technique used to merge k sorted arrays (or linked lists) into a single sorted array. It's commonly used in problems like merging multiple sorted arrays, finding the smallest range covering elements from k lists, and more.
📄️ Kadane's Algorithm Tutorial
A comprehensive guide to Kadane's Algorithm with code examples in JavaScript.
📄️ 0/1 Knapsack and Unbounded Knapsack
0/1 Knapsack Problems
📄️ Kruskal's Algorithm
Kruskal's algorithm is a popular algorithm in graph theory for finding the Minimum Spanning Tree (MST) of a connected, weighted, undirected graph. The MST connects all vertices with the minimum total edge weight and without any cycles.
📄️ LRU Cache Design
An LRU (Least Recently Used) Cache is a data structure that stores a limited number of items and automatically removes the least recently used item when the cache reaches its capacity. It's commonly used in scenarios where you need to manage memory by caching results of expensive operations.
📄️ Line Sweep Algorithm
The Line Sweep algorithm is a computational geometry technique used to solve various problems involving intervals or segments. The basic idea is to "sweep" a line across the plane and process events as the line intersects with points of interest (typically the endpoints of segments).
📄️ Linked List
Basic Structure
📄️ Median of Two Sorted Arrays
Core Concepts
📄️ Merge Sort
A comprehensive guide to understanding and implementing Merge Sort.
📄️ Morris Traversal for Binary Trees
Morris Traversal
📄️ Multiset in JavaScript
A Multiset (also known as a bag) is a data structure similar to a set, but it allows duplicate elements. In a multiset, each element can appear multiple times, and you can efficiently track the number of occurrences of each element.
📄️ Multi-source BFS Algorithm
Multi-source BFS Algorithm
📄️ N-ary Tree
An N-ary Tree is a tree data structure where each node can have up to N children. This is a generalization of a binary tree where each node can have more than two children. N-ary trees are useful in scenarios where a hierarchical structure is required, but nodes can have more than two children.
📄️ Number of Islands Pattern
The Number of Islands problem is a classic grid-based problem that involves finding the number of distinct islands in a 2D grid. An island is formed by connected groups of 1s (land), and they are surrounded by 0s (water). The land cells can be connected either vertically or horizontally, but not diagonally.
📄️ Parenthesis Pattern
Below is a list of common parenthesis-related problems.
📄️ Path Sum (Binary Tree)
Path Sum (Binary Tree)
📄️ Prefix Sum
A comprehensive guide to understanding and implementing Prefix Sum.
📄️ Prim's Algorithm
Prim's algorithm is a greedy algorithm that finds a Minimum Spanning Tree (MST) for a connected, weighted, undirected graph. Unlike Kruskal's algorithm, which considers edges, Prim's algorithm grows the MST by adding vertices.
📄️ Queue
A queue is a data structure that follows the First-In-First-Out (FIFO) principle. Elements are added at the rear and removed from the front. Queues are commonly used in scenarios where processing order needs to be maintained.
📄️ Quick Select Algorithm
Quick Select Algorithm
📄️ Quick Sort
A comprehensive guide to understanding and implementing Quick Sort.
📄️ Recursion Patterns Cheatsheet
Core Concepts
📄️ 10. Regular Expression Matching
https://leetcode.com/problems/regular-expression-matching/description/
📄️ Reservoir Sampling
Reservoir Sampling is an algorithm used for randomly selecting a fixed number of items from a stream or a large dataset when the total number of items is not known in advance. It ensures that each item in the stream has an equal probability of being included in the sample.
📄️ In-Place Reversal of a Linked List
In-Place Reversal of a Linked List
📄️ Segment Tree Tutorial
A comprehensive guide to Segment Trees with code examples in JavaScript.
📄️ Shortest Paths Problems
Problem: Shortest Path with Maximum Distance from Fire
📄️ Sieve of Eratosthenes
The Sieve of Eratosthenes is an ancient algorithm used to find all prime numbers up to a given limit. It works by iteratively marking the multiples of each prime number starting from 2.
📄️ Sliding Window Technique
Sliding Window Technique
📄️ Fast and Slow Pointers Technique
The Fast and Slow Pointers technique, also known as the Tortoise and Hare algorithm, is a powerful method for solving problems involving linked lists and cyclic structures. It uses two pointers that move at different speeds to detect cycles, find the middle of a list, and solve other related problems efficiently.
📄️ SortedList
An array-based implementation that maintains elements in sorted order.
📄️ Stack
Introduction
📄️ String Matching
Brute-Force String Matching
📄️ Suffix Automaton
A Suffix Automaton is a state machine that represents all substrings of a given string efficiently. It's used primarily in string processing problems, such as substring matching, pattern matching, and finding repeated substrings, among others. It builds a minimal deterministic finite automaton (DFA) to recognize all the suffixes of a string.
📄️ Topological Sort Tutorial
A comprehensive guide to Topological Sort with code examples in JavaScript.
📄️ TreeMap
A self-balancing binary search tree implementation that stores key-value pairs in sorted order by keys.
📄️ TreeSet
A self-balancing binary search tree implementation that stores unique values in sorted order.
📄️ Trie Data Structure
Trie Data Structure
📄️ Two Pointers Technique
The Two Pointers technique is a popular algorithmic approach used to solve problems involving arrays or lists. It involves using two pointers to traverse the data structure and solve problems efficiently.
📄️ Union-Find (Disjoint Set Union) Tutorial
A comprehensive guide to Union-Find data structure with code examples in JavaScript.
📄️ Unix File System
📄️ Minimum Enclosing Circle - Welzl's Algorithm
Learn how to find the smallest enclosing circle for a set of points using Welzl’s Algorithm.