# Algorithms

## Floodfill

Floodfill (Recursive)

## Sorting and Custom Comparators

Sorting with C++ Struct

Tree Algorithms

Binary Search

## Bitwise Operations and Subset Algorithms

Bitwise Operations and Subset Algorithms

Graph Algorithms

Grid Paths

## An Impassioned Circulation of Affection

C. An Impassed Circulation of Affection

## Binary Search Examples

Binary Search Examples

## Maximum Subarray Sum

Maximum Subarray Sum

Prefix Sum

Monotonous Stack

Subsets

Permutations

## Palindrome Partitioning

Palindrome Partitioning

Combination Sum

Unique Paths II

## Longest Increasing Subsequence

Longest Increasing Subsequence

House Robber

Climbing Stairs

## Best Time to Buy and Sell Stock

Best Time to Buy and Sell Stock

BFS Distance

## Greedy: Boyer-Moore’s Majority Vote

Boyer-Moore’s Majority Vote Algorithm

## Tree Traversal

Tree Traversal Algorithm

## Greedy: Dijkstra’s Shortest Path

Dijkstra’s Shortest Path

## Backtracking: Knights Tour Algorithm

Knights Tour Algorithm

## Backtracking: Hamiltonean Cycles Algorithm

Hamiltonean Cycles

## Recursion vs. Dynamic Programming Using a Question from AMC8

Recursion vs. Dynamic Programming Using a Question from AMC8

Flood Fill

## Basic Math in Programming

Basic Math in Programming

## Function Argument Passing in Python

Function Argument Passing in Python

Merge Sort

## Prime Numbers with Sieve of Eratosthenes

Generating Prime Numbers using Sieve of Eratosthenes algorithm

Selection Sort