The Algorithms logo
The Algorithms

Dynamic Programming

Min Distance up Bottom

Max Sum Contiguous Subsequence

Subset Generation

Integer Partition

Minimum Cost Path

Longest Sub Array

Palindrome Partitioning

Longest Increasing Subsequence

Longest Common Subsequence

Floyd Warshall

Iterating Through Submasks

Combination Sum Iv

Minimum Coin Change

Minimum Squares to Represent a Number

Optimal Binary Search Tree

Matrix Chain Order

Minimum Steps to One

Minimum Tickets Cost

Minimum Partition

Longest Increasing Subsequence O(nlogn)

Longest Common Substring

Max Non Adjacent Sum

Longest Palindromic Subsequence

Longest Substring Without Repeating Characters

Tribonacci Number

Zero One Knapsack

Max Product Of Three

Number Of Subset Equal To Given Sum

Find Month Calendar

Fast Fibonacci Number

Longest Valid Parentheses

Trapping Rain Water

Fibonacci Bottom Up

Partition Problem

Shortest Common Supersequence

Minimum Edit Distance

Coin Change Topdown

Longest Common String

Searching of Element in Dynamic Array

Matrix Chain Multiplication

Longest Increasing Subsequence (Nlogn)

Egg Dropping Puzzle

Memoization Technique Knapsack

Matrix Chain Recursive Top Down Memoisation

Palindromic Partitioning

Minimum Sum Partition

Longest Palindromic Substring

Dyanamic Programming Knapsack

Shortest Common Supersequence Length

Knapsack Memoization

Brute Force Knapsack

Longest Alternating Subsequence

Kadane Algorithm

New Man Shanks Prime

Count Friends Pairing

Longest Continuous Increasing Subsequence

Min Number of Jumps

01knapsack Recursive

Kadanes Algorithm

Assembly Line Scheduling

Rod Cutting Problem

Weighted Job Scheduling

Unbounded Knapsack

Zero One Knapsack Problem