Greedy Algorithms Last Updated : 07 Apr, 2025 Comments Improve Suggest changes Like Article Like Report Greedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get the next optimal choice quickly. We sometimes also use a priority queue to get the next optimal item.After making a choice, we check for constraints (if there are any) and keep picking until we find the solution.Greedy algorithms do not always give the best solution. For example, in coin change and 0/1 knapsack problems, we get the best solution using Dynamic Programming.Examples of popular algorithms where Greedy gives the best solution are Fractional Knapsack, Dijkstra's algorithm, Kruskal's algorithm, Huffman coding and Prim's AlgorithmBasics of Greedy AlgorithmIntroduction to Greedy Algorithm Greedy Algorithms General StructureEasy Problems on Greedy AlgorithmFractional KnapsackMin Cost to Make Array Size 1Min Rotations for Circular LockMax Composite Numbers to Make nSmallest Subset Greater SumAssign CookiesBuy Maximum Stocks Max Consecutive Diff SumMin and Max Costs to buy allMin Notes with Given SumMax Equal Sum of Three StacksMedium Problems on Greedy AlgorithmActivity Selection ProblemJump Game Job Sequencing ProblemEgyptian FractionMerge Overlapping IntervalsMin Fibonacci Terms with Sum KMinimum PlatformsMin Cost to Connect n ropes Max trains Partition 1 to n into two min diff groupsPaper cut into min squaresMin diff groups of size twoMax Satisfied Customers Min initial vertices to traverse matrix with constraintsLargest palindromic number by permuting digitsSmallest with n digits and digits sumLexicographically largest subsequence with every char at least k timesHard Problems on Greedy AlgorithmMinimize the Max Height DiffMaking max equal with k updatesMinimize cash flow among friendsMinimum Cost to cut a board into squaresMinimum cost to process m tasks where switching costsMinimum time to finish all jobs with given constraintsMinimize the maximum difference between the heights of towersMinimum edges to reverse to make path from a source to a destinationFind the Largest Cube formed by Deleting minimum Digits from a numberRearrange characters in a string such that no two adjacent are sameRearrange a string so that all same characters become d distance awayStandard Greedy AlgorithmsActivity Selection ProblemJob Sequencing ProblemHuffman CodingHuffman DecodingWater Connection ProblemMinimum Swaps for Bracket BalancingEgyptian FractionPolicemen catch thievesFitting Shelves ProblemAssign Mice to HolesGreedy Problems on ArrayMinimum product subset of an arrayMaximize array sum after K negations using SortingMinimum sum of product of two arraysMinimum sum of absolute difference of pairs of two arraysMinimum increment/decrement to make array non-IncreasingSorting array with reverse around middleSum of Areas of Rectangles possible for an arrayLargest lexicographic array with at-most K consecutive swapsPartition into two subarrays of lengths k and (N – k) such that the difference of sums is maximumGreedy Problems in Operating SystemFirst Fit algorithm in Memory ManagementBest Fit algorithm in Memory ManagementWorst Fit algorithm in Memory ManagementShortest Job First SchedulingJob Scheduling with two jobs allowed at a timeProgram for Optimal Page Replacement AlgorithmGreedy Problems on GraphKruskal’s Minimum Spanning TreePrim’s Minimum Spanning TreeBoruvka’s Minimum Spanning TreeDijkastra’s Shortest Path AlgorithmDial’s AlgorithmMinimum cost to connect all citiesMax Flow Problem IntroductionNumber of single cycle components in an undirected graphApproximate Greedy Algorithm for NP CompleteSet cover problemBin Packing ProblemGraph ColoringK-centers problemShortest superstring problemApproximate solution for Travelling Salesman Problem using MSTGreedy for Special cases of DPFractional Knapsack ProblemMinimum number of coins requiredQuick LinksLearn Data Structure and Algorithms | DSA TutorialTop 20 Greedy Algorithms Interview Questions‘Practice Problems’ on Greedy Algorithms‘Quiz’ on Greedy Algorithms Comment More infoAdvertise with us Next Article Greedy Algorithms H harendrakumar123 Follow Improve Article Tags : Greedy DSA Algorithms-Greedy Algorithms Practice Tags : Greedy Similar Reads DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on 7 min read Array Data Structure Guide In this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous 4 min read String in Data Structure A string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut 3 min read Matrix Data Structure Matrix Data Structure is a two-dimensional array arranged in rows and columns. It is commonly used to represent mathematical matrices and is fundamental in various fields like mathematics, computer graphics, and data processing. Matrices allow for efficient storage and manipulation of data in a stru 2 min read Searching Algorithms Searching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input 3 min read Sorting Algorithms A Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ 3 min read Hashing in Data Structure Hashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The 3 min read Two Pointers Technique Two pointers is really an easy and effective technique that is typically used for Two Sum in Sorted Arrays, Closest Two Sum, Three Sum, Four Sum, Trapping Rain Water and many other popular interview questions. Given a sorted array arr (sorted in ascending order) and a target, find if there exists an 11 min read Sliding Window Technique Sliding Window Technique is a method used to solve problems that involve subarray or substring or window. The main idea is to use the results of previous window to do computations for the next window. This technique is commonly used in algorithms like finding subarrays with a specific sum, finding t 13 min read Prefix Sum Array - Implementation and Applications Given an array arr[] of size n, the task is to find the prefix sum of the array. A prefix sum array is another array prefixSum[] of the same size, such that prefixSum[i] is arr[0] + arr[1] + arr[2] . . . arr[i].Examples: Input: arr[] = [10, 20, 10, 5, 15]Output: 10 30 40 45 60Explanation: For each i 8 min read Like