Kruskal’s Algorithm (Simple Implementation for Adjacency Matrix)
Below are the steps for finding MST using Kruskal’s algorithm 1. Sort all the edges in non-decreasing order of their weight. 2. Pick the smallest… Read More »
Below are the steps for finding MST using Kruskal’s algorithm 1. Sort all the edges in non-decreasing order of their weight. 2. Pick the smallest… Read More »
We have discussed Prim’s algorithm and its implementation for adjacency matrix representation of graphs. As discussed in the previous post, in Prim’s algorithm, two sets… Read More »
Given a pile of chocolates and an integer ‘k’ i.e. the number of iterations, the task is to find the number of chocolates left after… Read More »
Given an array of n elements and an integer K, the task is to find the subarray with minimum value of ||a[i] + a[i +… Read More »
Given an array of positive integers. The task is to choose a pair of elements from the given array such that they represent the length… Read More »
Given an array of N positive integers and Q queries consisting of an integer K, the task is to print the length of the longest… Read More »
Given an array containing N integers. The task is to find the sum of the elements of the contiguous subarray having the smallest(minimum) sum. Examples:… Read More »
Given two arrays of size N, and two numbers X and Y, the task is to maximize the sum by considering the below points: Pick… Read More »
Given an array of pairs where each pair represents a range, the task is to find the sum of the minimum difference between the consecutive… Read More »
Given a number N, place numbers from the range [1, N2] in an NxN matrix such that sum in every row is equal. Examples: Input:… Read More »
Consider a pipe of length L. The pipe has N water droplets at N different positions within it. Each water droplet is moving towards the… Read More »
Given two arrays arr1[] and arr2[] sorted in ascending order and an integer K. The task is to find k pairs with smallest sums such… Read More »
Given an array of N elements. The task is to print the maximum number by concatenating every element in each rotation. In every rotation, the… Read More »
Given a sequence of N elements, only three operations can be performed on any element at most one time. The operations are: Add one to… Read More »
Given an array of 2 * N positive integers where each array element lies between 1 to N and appears exactly twice in the array.… Read More »