Web Technologies37.4K+ articles

DSA22.8K+ articles

Misc8.8K+ articles

Mathematical7.8K+ articles

Arrays6.5K+ articles

Competitive Programming3.3K+ articles

Greedy2.1K+ articles

Algorithms2.0K+ articles

Data Structures1.1K+ articles

Greedy Algorithms111+ articles

Given an array arr[] of size N, the task is to find the maximum possible sum of the array elements such that the element can be chosen as per the below conditions:For each...read more

Greedy

Sorting

Mathematical

DSA

Arrays

Algorithms-Greedy Algorithms

Greedy Algorithms

Given an array arr[] of size N, the task is to find the minimum number of increment or decrement operations required at any index i such that for each i (1 ? i N) if the ...read more

Greedy

Mathematical

DSA

Arrays

Algorithms-Greedy Algorithms

Greedy Algorithms

Greedy is an algorithmic paradigm that builds up a solution piece by piece, always choosing the next piece that offers the most obvious and immediate benefit. Greedy algor...read more

GBlog

Greedy

DSA

Algorithms-Greedy Algorithms

Greedy Algorithms

Tutorials

DSA Tutorials

GBlog 2024

Given an array arr[] of integers and an integer K, the task is to find the minimum number of operations required to make every Kth element in the array equal. While perfor...read more

Dynamic Programming

Greedy

DSA

Arrays

Analytical Mathematical Puzzles

cpp-vector

Algorithms-Dynamic Programming

Algorithms-Greedy Algorithms

Given a binary array X[] of size N. Two players A and B are playing games having the following rules, then the task is to determine the winner if B starts first and both p...read more

Greedy

Competitive Programming

DSA

Arrays

Algorithms-Greedy Algorithms

Greedy Algorithms

Java-Competitive-Programming

Given an array arr[] consisting of positive integers of size N. the task is to minimize the overall sum of arr[] by toggling the unset bit (0 bit) of any element of the ar...read more

Bit Magic

Geeks Premier League

DSA

Algorithms-Greedy Algorithms

Geeks Premier League 2023

Given an array X[] of length N along with A and B. You can apply below type of operations:Operation 1: Choose two different indices, delete elements at both indices and in...read more

Java

Greedy

Sorting

Geeks Premier League

DSA

Arrays

array-range-queries

Algorithms-Greedy Algorithms

Greedy Algorithms

Java-Arrays

DSA-Blogs

Geeks Premier League 2023

Consider a matrix of N rows and M columns. Initially, there is a cell at co-ordinate (X, Y), which is blue. Then the task is to place the Yellow color in an optimal cell s...read more

Matrix

Geeks Premier League

DSA

Algorithms-Greedy Algorithms

Greedy Algorithms

Geeks Premier League 2023

Given an integer N, the task is to represent N as the sum of numbers such that the numbers can only be formed using the digits 0 and 1 and the total numbers used should be...read more

Competitive Programming

Picked

Geeks Premier League

DSA

Algorithms-Dynamic Programming

Algorithms-Greedy Algorithms

Geeks Premier League 2023

Given an array b. The array b is obtained initially by array a, by doing the following operations.Choose a fixed point x from array a.Cyclically rotate the array a to the ...read more

Geeks Premier League

DSA

Arrays

Arrays

Algorithms-Greedy Algorithms

QA - Placement Quizzes-Data Interpretation

python-dict

Scala-Arrays

Volkswagen IT Services

Geeks Premier League 2023

Given a string S of length N (1 = N = 105) consisting of lower case alphabets. The task is to find the number of strictly increasing sequences P1,P2, …, Pk such that:For e...read more

Strings

Competitive Programming

Picked

Geeks Premier League

DSA

Algorithms-Greedy Algorithms

Geeks Premier League 2023

Given an array arr[] of length N, the task is to create an array res[] of length N where each element res[i] represents the count of distinct arrays obtained by applying ...read more

Competitive Programming

Geeks Premier League

DSA

Arrays

Data Structures-Stack

Algorithms-Greedy Algorithms

Geeks Premier League 2023

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 algorit...read more

Greedy

DSA

Algorithms-Greedy Algorithms

Given an array arr[] of size N, find the maximum value of adjacent sum by rearranging array in any order.Examples:Input: arr[] = {1, 2, 3, 4}Output: 17Explanation: The arr...read more

DSA

Arrays

Algorithms-Greedy Algorithms

The 0/1 Knapsack algorithm is a dynamic programming approach where items are either completely included or not at all. It considers all combinations to find the maximum to...read more

Algorithms

Dynamic Programming

Greedy

DSA

knapsack

Algorithms-Greedy Algorithms

We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy PolicyGot It !