GET MY CODE LIBRARY

• Stack
• Queue
• Linked List
• Circular Linked List

Advance

• Queue with stack (Using 2 stack, Time efficient)
• Queue with stack (Using 1 stack, Time in-efficient)
• Binary Search Tree
• Disjoint Set Unit
• SQRT Decomposition
• Segment Tree
• Lazy Propagation
• Trie Tree
• Binary Index Tree

• Vector
• Stack
• Queue
• Deque
• Map
• Set
• Unordered Set
• Pair
• Struct

Advance

• Ordered Set

• Linear Search
• Binary Search
• Bisection method
• Ternary Search

• GCD
• LCM
• Prime Generator (Sieve of Erathosthenos)
• Goldbach Conjecture
• Find All Divisor
• Modular Arithmetic
• Big Mod
• Number of Digit
• Euler Totient Function
• Number of Divisor
• Sum of Divisor
• All Possible Subset

Primality Test

• School Method
• Fermat's Method
• Miller Rabin

Advance

• Bitwise-Sieve
• Segmented Sieve
• Extended Euclidean Algorithm
• Modular Multiplicative Inverse
• Fermat's Little Theorem
• Chinese Remainder Theorem

• Graph Representation
• BFS
• BFS on Grid
• DFS
• Top Sort
• Topological Sort
• Strongly Connected Component
• Flood Fill Algorithm

Shortest Path Problem

• Dijkstra Algorithm
• Floyd-Warshall Algorithm
• Bellman Ford Algorithm

Minimum Spanning Tree (MST)

• Prim's Algorithm
• Kruskal Algorithm

• Fibonacci Number
• Binomial Coefficient
• Coin Change 1
• Coin Change 2
• 0/1 Knapsack 1
• 0/1 Knapsack 2
• 0/1 Knapsack 3
• 0/1 Knapsack 4
• Fractional Knapsack
• Gold Mine Problem
• Longest Common Subsequence
• Longest Palindromic Subsequence
• Largest Palindromic Substring
• Maximum Subarray Sum
• Subset Sum

• Bubble Sort
• Selection Sort
• Merge Sort
• Quick Sort
• Heap Sort
• Insertion Sort

• Two Pointer

• Meet in the middle

• Permutation Generator
• Tower of Hanoi

© 𝗔𝗺𝗶𝗿𝘂𝗹 𝗜𝘀𝗹𝗮𝗺, 𝐏𝐚𝐬𝐬𝐢𝐨𝐧𝐚𝐭𝐞 𝐏𝐫𝐨𝐛𝐥𝐞𝐦 𝐒𝐨𝐥𝐯𝐞𝐫 & 𝐁𝐚𝐜𝐤𝐞𝐧𝐝 𝐄𝐧𝐠𝐢𝐧𝐞𝐞𝐫