Greedy

2k+ posts

Last Updated: 07 April 2025

Greedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solutio ...read more

Greedy

Algorithms-Greedy Algorithms

DSA

Shortest Remaining Time First (Preemptive SJF) Scheduling Algorithm

Last Updated: 03 February 2025

In this post, we will talk about the pre-emptive version of Shortest Job First (SJF) scheduling, called Shortest Remaining Time First (SRTF)...read more

Program for Shortest Job First (or SJF) CPU Scheduling | Set 1 (Non- preemptive)

Last Updated: 24 March 2023

The shortest job first (SJF) or shortest job next, is a scheduling policy that selects the waiting process with the smallest execution time ...read more

Similar Topics

DSA

22.3k+ articles

Mathematical

7.7k+ articles

Arrays

6.4k+ articles

Strings

3.2k+ articles

Competitive Programming

2.3k+ articles

Algorithms

1.9k+ articles

Sorting

1.7k+ articles

Searching

1.7k+ articles

frequency-counting

730+ articles

array-rearrange

460+ articles

Fractional Knapsack Problem

Last Updated: 20 April 2025

Given two arrays,val[]andwt[], representing the values and weights of items, and an integercapacityrepresenting the maximum weight a knapsac ...read more

Job Sequencing Problem

Last Updated: 28 March 2025

Given two arrays: deadline[] and profit[], where the index of deadline[] represents a job ID, and deadline[i] denotes the deadline for that ...read more

Minimum Platforms Required for Given Arrival and Departure Times

Last Updated: 26 March 2025

Given two arrays, arr[] and dep[], that represent the arrival and departure times of trains respectively, the task is to find the minimum nu ...read more

two-pointer-algorithm

Airtel

DSA

Dijkstra’s Algorithm for Adjacency List Representation | Greedy Algo-8

Last Updated: 29 March 2025

The Dijkstra's Algorithm, we can either use the matrix representation or the adjacency list representation to represent the graph, while the...read more

Dijkstra's Algorithm to find Shortest Paths from a Source to all

Last Updated: 27 April 2025

Given a weighted undirected graph represented as an edge list and a source vertex src, find the shortest path distances from the source vert...read more

Vizury Interactive Solutions

Greedy

Shortest Path

DSA

Prim’s Algorithm for Minimum Spanning Tree (MST)

Last Updated: 26 February 2025

Prim’s algorithm is aGreedy algorithm like Kruskal's algorithm. This algorithm always starts with a single node and moves through several ...read more

Amazon

Minimum Spanning Tree

Huffman Coding | Greedy Algo-3

Last Updated: 22 April 2025

Huffman coding is a lossless data compression algorithm. The idea is to assign variable-length codes to input characters, lengths of the ass...read more

Kruskal’s Minimum Spanning Tree (MST) Algorithm

Last Updated: 05 March 2025

A minimum spanning tree (MST) or minimum weight spanning tree for a weighted, connected, and undirected graph is a spanning tree (no cycles ...read more

Activity Selection Problem | Greedy Algo-1

Last Updated: 27 March 2025

Given n activities with their start and finish times given in arraystart[]andfinish[]. Select the maximum number of activities that can be p...read more

Amazon

Activity Selection Problem

Coin Change - Count Ways to Make Sum

Last Updated: 27 April 2025

Given an integerarray of coins[] of size nrepresenting different types of denominations and an integer sum, the task is to count all combina...read more

Rotate an Array by d - Counterclockwise or Left

Last Updated: 03 October 2024

Given an array of integers arr[] of size n, the task is to rotate the array elements to the left by d positions.Examples:Input:arr[] = {1, 2...read more

Permutations of given String

Last Updated: 10 April 2025

Given a string s, the task is to return all permutations of a given string in lexicographically sorted order.Note: A permutation is the rear...read more

1 2 3 4 5 6 7 8 >>

1 2 3 4 5 6 >>

1 2 3 4 >>

Log in

Create Account