Basic Greedy Problems

To solve any basic greedy problem, identify an optimal subproblem or substructure in the problem and solve the subproblems in an optimal way. Create some sort of iterative way to go through all of the subproblems and find the global optimum solution. Any problem having optimal substructure and greedy property can be solved using a greedy algorithm. The greedy method is quite powerful and works well for a wide range of problems such as Activity selection problem, Job scheduling problem, Fractional Knapsack problem, etc.

Minimum count of Inversion Pairs possible by concatenating N binary strings in any order

By HET FADIA

● Published At Jan 2022

The blog aims to find the minimum count of Inversion Pairs possible by concatenating N binary strings in any order.... Keep reading ..

Minimum Count of Inversion Pairs Possible by Concatenating N Binary Strings in any Order

By Ujjawal Gupta

● Published At Jan 2022

In this blog, we will learn to solve a problem based on sorting. We will discuss the problem minimum count of inversion pairs possible by concatenating ‘N’ binary strings in any order.... Keep reading ..

Finding Kth Largest Number in a Given Array of Large Numbers

By Ujjawal Gupta

● Published At Jan 2022

In this blog, we will learn to solve a problem based on sorting. We will discuss the approach based on the overloading of the comparator function.... Keep reading ..

Count Strings that Do Not Contain Any Alphabet’s Both Uppercase and Lowercase

By Ishita Chawla

● Published At Dec 2021

This blog will discuss the problem to count strings that do not contain any alphabet’s both uppercase and lowercase.
... Keep reading ..

Find the smallest range containing at least 1 element from given N ranges.

By Urwashi Priya

● Published At Dec 2021

This article will brief you on how to Find the smallest range containing at least 1 element from given N ranges.
... Keep reading ..

Minimum Decrements to Make an Array at Most Zero Such That All Array Elements Are Cyclically Decremented After a Number is Reduced to Zero

By Ujjawal Gupta

● Published At Jan 2022

In this blog, we will learn to solve a problem, minimum decrements to make an array at most zero such that all array elements are cyclically decremented after a number is reduced to zero.... Keep reading ..

Lexicographically Incrementing or Decrementing Characters to Convert Characters of STRING1 to Characters Present in STRING2

By Sujal Modanwal

● Published At Jan 2022

The task is to find the minimum operations to convert the characters of string1 to the character present in string2.... Keep reading ..

Sum of beauty in the array

By Sandeep kamila

● Published At Jan 2022

This article discusses the different approaches to finding the sum of beauty in the array with examples and its implementation in C++.... Keep reading ..

## Top Problems related to Basic Greedy Problems

Connect N Ropes With Minimum Cost

Minimum operation needed to convert to the given string

Minimum Number of Platform Needed

Minimum Number of Platforms

Rearrange The Array

Minimum Number Of Lamps

Minimum Number Of Taps To Water Garden

Next Permutation

Jump Game

Candies

Compress the String

Overlapping ABBA

Add One to Linked List

Dijkstra's shortest path

Normal BST To Balanced BST

Shortest Path

Connect Ropes

Minimum days to complete work

Job Scheduling Problem

Fact Digit Sum

Count Number Of Ways To Cover A Distance