let's start Code

Index

DATA STRUCTURE:

1. Disjoint Set Union

2. ট্রাই ট্রি ( Trie Tree )

3. Fenwick (Binary Indexed) Trees  

4. Segment Tree

5. পলিসি বেইজড ডাটা স্ট্রাকচার (PBDS)

6. Binary Search Tree (BST)

DP:

1. Travelling Salesman Problem

2. Binomial Coefficient

GRAPH THEORY:

1. Breadth First Search

2. Dijkstra Algorithm

3. Topological Sorting

4. Articulation Points and Bridges

5. Kruskal’s Algorithm [ Minimum Spanning Tree ]

GREEDY:

1. Job Sequencing Problem

2. Activity Selection Problem

3. Egyptian Fraction

4. Fractional Knapsack Problem

5. Odd Sum SubSequence


Share:

No comments:

Post a Comment

About

let's start CODE

Popular Posts