Find the minimum spanning tree with alternating colored edges
Given a graph with N nodes and M edges where each edge has a color (either black or green) and a cost associated with it.… Read More »
Given a graph with N nodes and M edges where each edge has a color (either black or green) and a cost associated with it.… Read More »
Given an array of positive distinct integers arr[], the task is to find the final number obtained by performing the following operation on the elements… Read More »
Given an odd number N, the task is to find if the number can be represented as the sum of 3 prime numbers. Examples: Input:… Read More »
Given a large integer N, the task is to find all the possible remainders when N is divided by all the positive integers from 1… Read More »
Given N vertices of the polygon, the task is to find the centroid of the polygon Examples: Input: ar = {{0, 0}, {0, 8}, {8,… Read More »
Remember the memories of your childhood when you accepted the challenge to solve some Jigsaw Puzzle, Complex Mathematics Problems, Tic-Tac-Toe, Sudoku or Rubik’s cube kinda… Read More »
A permutation is a rearrangement of members of a sequence into a new sequence. For example, there are 24 permutations of [a, b, c, d].… Read More »
Given two integers L and R where L ≤ R, the task is to find an integer K such that: L ≤ K ≤ R.… Read More »
Given an array of size N containing numbers only from 0 to 63, and you are asked Q queries regarding it. Queries are as follows:… Read More »
Given an integer N and an array seats[] where N is the number of people standing in a line to buy a movie ticket and… Read More »
Given a matrix of N rows and M columns. It is given that M is a multiple of 3. The columns are divided into 3… Read More »
Given an array of integers, the task is to calculate the sum of GCD of all the subarrays of an array. GCD of an array… Read More »
Given a K-increasing-decreasing array arr[], the task is to sort the given array. An array is said to be K-increasing-decreasing if elements repeatedly increase upto… Read More »
Given a Complete Binary Tree rooted at node 1, the task is to print the elements in the following defined order. First, print all elements… Read More »
Given an array arr, the task is to find the length of Longest Increasing Sequence using Binary Indexed Tree (BIT) Examples: Input: arr = {6,… Read More »