📄️ Greedy Algorithms
Greedy algorithms are a class of algorithms that make the optimal choice at each step with the hope of finding the global optimum
📄️ Practice Problems
Practice problems for Greedy Algorithms, categorized by difficulty and topic. These problems help in understanding the practical application of greedy strategies in solving algorithmic challenges.
📄️ Fractional Knapsack
In this post, we'll explore the Fractional Knapsack Problem, a greedy algorithm used to maximize the value of items that can be fit into a knapsack with a weight limit.
📄️ Huffman Coding
In this blog post, we'll explore Huffman Coding, a popular lossless data compression algorithm that assigns variable-length codes to input characters based on their frequencies.
📄️ Job Sequencing
In this blog post, we'll explore the Job Sequencing problem, a classical greedy algorithm that schedules jobs within their deadlines to maximize profit.
📄️ Prim's MST
In this blog post, we'll explore Prim's Algorithm, a greedy algorithm used to find the Minimum Spanning Tree (MST) of a weighted undirected graph.
📄️ Activity Selection
In this blog post, we'll explore the Activity Selection Problem, a classic greedy algorithm used to select the maximum number of activities that don't overlap.
📄️ Commonly asked Greedy questions
This document explores various commonly greedy algorithm patterns, highlighting their definitions, characteristics, and common applications.
📄️ Fractional Knapsack
In this blog post, we'll explore the Fractional Knapsack Problem, a greedy algorithm used to maximize the value of items that can be carried in a knapsack with a weight limit.