The Algorithms logo
The Algorithms

Dynamic Programming

Max Sum Contiguous Subsequence

Subset Generation

Minimum Cost Path

Minimum Steps to One

Optimal Binary Search Tree

Minimum Squares to Represent a Number

Palindrome Partitioning

Longest Increasing Subsequence O(nlogn)

Longest Common Subsequence

Integer Partition

Max Non Adjacent Sum

Minimum Partition

Matrix Chain Order

Floyd Warshall

Min Distance up Bottom

Fibonacci Numbers



Combination Sum Iv

Longest Common Substring

Minimum Coin Change

Longest Increasing Subsequence

Iterating Through Submasks

Minimum Tickets Cost

Longest Sub Array

Trapping Rain Water

Max Product Of Three

Find Month Calendar

Tribonacci Number

Number Of Subset Equal To Given Sum

Fast Fibonacci Number

Longest Palindromic Subsequence

Longest Valid Parentheses

Longest Substring Without Repeating Characters

Zero One Knapsack

Egg Dropping Puzzle

Minimum Edit Distance

Shortest Common Supersequence

Longest Common String

Matrix Chain Multiplication

Partition Problem

Searching of Element in Dynamic Array

Coin Change Topdown

Fibonacci Bottom Up

Maximum Circular Subarray

Longest Increasing Subsequence (Nlogn)

Shortest Common Supersequence Length

Palindromic Partitioning

New Man Shanks Prime

Matrix Chain Recursive Top Down Memoisation

Minimum Sum Partition

Longest Alternating Subsequence

Knapsack Memoization

Kadane Algorithm

Brute Force Knapsack

Dyanamic Programming Knapsack

Longest Palindromic Substring

Count Friends Pairing

Longest Continuous Increasing Subsequence

Kadanes Algorithm

Min Number of Jumps

01knapsack Recursive

Count Sorted Vowel Strings

Pascal Triangle Ii

Weighted Job Scheduling

Zero One Knapsack Problem

Rod Cutting Problem

Unbounded Knapsack

Assembly Line Scheduling