- Job Sequencing Problem
- Huffman Coding
- Activity Selection Problem
- Egyptian Fraction
- Water Connection Problem
- Policemen catch thieves
- Minimum Swaps for Bracket Balancing
- Fitting Shelves Problem
- Assign Mice to Holes
- Kruskal’s Minimum Spanning Tree
- Prim’s Minimum Spanning Tree
- Boruvka’s Minimum Spanning Tree
- Reverse delete algorithm for MST
- Dijkastra’s Shortest Path Algorithm
- Dial’s Algorithm
- Minimum cost to connect all cities
- Max Flow Problem Introduction
- Minimum product subset of an array
- Maximum product subset of an array
- Maximize array sum after k-negations
- First Fit algorithm in Memory Management
- Best Fit algorithm in Memory Management
- Worst Fit algorithm in Memory Management
- Next Fit algorithm in Memory Management
- Shortest Job First Scheduling
- Program for Shortest Job First (SJF) scheduling
- Program for Optimal Page Replacement Algorithm
- Program for LRU Page Replacement Algorithms
- Program for FIFO Page Replacement Algorithms
- Set cover problem
- Bin Packing Problem
- Graph Coloring
- K-centers problem
- Shortest superstring problem
- Travelling Salesman Problem
- Minimum number of coins required
Greedy Algorithms
Mithlesh Upadhyay is a Computer Science and AI expert from Madhya Pradesh with strong academic background (BE in CSE and M.Tech in AI) and over six years of experience in technical content development. He has contributed tech articles, led teams, and worked in Full Stack Development and Data Science. He founded the w3colleges.org portal for learning resources.