## Minimum cost to reach a point N from 0 with two different operations allowed

Given integers N, P and Q where N denotes the destination position. The task is to move from position 0 to position N with minimum… Read More »

- Dijkstra's shortest path algorithm | Greedy Algo-7
- Program for array rotation
- Coin Change | DP-7
- Write a program to print all permutations of a given string
- Prim’s Minimum Spanning Tree (MST) | Greedy Algo-5
- Kruskal’s Minimum Spanning Tree Algorithm | Greedy Algo-2
- Activity Selection Problem | Greedy Algo-1
- Minimum Number of Platforms Required for a Railway/Bus Station
- Huffman Coding | Greedy Algo-3
- Job Sequencing Problem | Set 1 (Greedy Algorithm)
- Dijkstra’s Algorithm for Adjacency List Representation | Greedy Algo-8
- Rearrange characters in a string such that no two adjacent are same
- Connect n ropes with minimum cost
- Minimize the maximum difference between the heights
- Fractional Knapsack Problem
- Applications of Minimum Spanning Tree Problem
- Minimum Cost Path with Left, Right, Bottom and Up moves allowed
- Minimum increment/decrement to make array non-Increasing
- Graph Coloring | Set 2 (Greedy Algorithm)
- Prim’s MST for Adjacency List Representation | Greedy Algo-6
- Greedy Algorithm to find Minimum number of Coins
- Program for Shortest Job First (or SJF) scheduling | Set 1 (Non- preemptive)
- Maximum Length Chain of Pairs | DP-20
- Huffman Decoding
- Job Sequencing Problem | Set 2 (Using Disjoint Set)
- Top 20 Greedy Algorithms Interview Questions
- Program for Page Replacement Algorithms | Set 1 ( LRU)
- Program for Shortest Job First (SJF) scheduling | Set 2 (Preemptive)
- Minimum cost to connect all cities
- Minimum product subset of an array

Given integers N, P and Q where N denotes the destination position. The task is to move from position 0 to position N with minimum… Read More »

Given an integer element ‘N’, the task is to find the minimum number of operations that need to be performed to make ‘N’ equal to… Read More »

Given two sequences of integers ‘A’ and ‘B’, and an integer ‘k’. The task is to check if we can make both sequences equal by… Read More »

Given an integer . The task is to find another interger which is permutation of n, divisible by 3 but not divisible by 6. Given… Read More »

Given a two dimensional matrix A of zero’s and one’s and an integer K. In each move, you can choose any row or column and… Read More »

Given a list of prices of ‘N’ items. A person can buy only one item of any price and he can get other items for… Read More »

Given an array of n integers, we can remove one element of the array by the following operation. Operation:We select any two numbers of the… Read More »

Given an array of N integers, you have to select all of these integers in any order. For every integer you select, you get points… Read More »

Given an array of N integers, rearrange the array elements such that the next array element is greater than the previous element ( > ).… Read More »

Given a list of items and their values. The task is to find k items with the lowest value. It is possible that two items… Read More »

Given an array of integers, find the k smallest numbers after deleting given elements. In case of repeating elements delete only one instance in the… Read More »

Given an array containing weights of gifts, and an integer K representing maximum weight a box can contain (All boxes are uniform). Each box carries… Read More »

Given an array of integers, find the largest number after deleting the given elements. In case of repeating elements, delete one instance for every instance… Read More »

Given a number represented in the form of an array such that each element of the array stores a single digit of the number. That… Read More »

Given a strictly increasing array A of positive integers where, . The task is to find the length of the longest Fibonacci-like subsequence of A.… Read More »