Table of Content ​

Guide :

        Getting Started

        Contribute Guidelines

        Table of Content

Sort :

        Merge Sort

        Quick Sort

        Topological Sort

String Manipulations :

        Roman to Integer

        Number of Matching Subsequences

        KMP Problem

Hash Table :

        Subarray Sum Equals K

        Split Array into Consecutive Subsequences

        Number of Submatrices That Sum to Target

Depth-First Search (DFS) :

        Max Area of Island

        Amount of Time for Binary Tree to Be Infected

Dynamic Programming :

        Introduction

        Fibonacci Numbers

        Wiggle Subsequence

        Longest Palindromic Substring

        Out of Boundary Paths

        Decode Ways

        Longest Increasing Subsequence

        Maximal Rectangle

        LCS

Stack :

        Shortest Impossible Sequence of Rolls

Tree :

        Invert Binary Tree

        Construct Binary Tree from Preorder and Inorder Traversal

        Binary Search Tree to Greater Sum Tree

        Trie (Prefix Tree)

        Minimum Spanning Tree

        Binary Tree Interative Traversal

Bit Manipulation :

        Introduction

        Sum of Two Integers

Advanced Algorithms :

        Binary Indexed Tree

        Union Find