Check if given array can be rearranged such that mean is equal to median

Given sorted float array arr[]. Check if arr[] can be rearranged such that its mean is equal to its median. Examples: Input: arr[] = {1.0,… Read More The post Check if given array can be rearranged such that mean is equal to median appeared first on GeeksforGeeks.

3h

Sum of the shortest distance between all 0s to 1 in given binary string

Given a binary string S, the task is to find the sum of the shortest distance between all 0s to 1 in the given string… Read More The post Sum of the shortest distance between all 0s to 1 in given binary string appeared first on GeeksforGeeks.

3h

Print all ways to reach the Nth stair with the jump of 1 or 2 units at a time

Given a positive integer N representing N stairs and a person it at the first stair, the task is to print all ways to reach… Read More The post Print all ways to reach the Nth stair with the jump of 1 or 2 units at a time appeared first on GeeksforGeeks.

3h

Top 10 Website Design Trends That You Must Consider

Website Design Trends offer you a DIRECT COURSE-OF-ACTION for impressing the visitors directed to your websites. Most significantly, these trends teach you how long can… Read More The post Top 10 Website Design Trends That You Must Consider appeared first on GeeksforGeeks.

9h

Count of distinct integers belonging to first N terms of at least one of given GPs

Given two Geometric Progressions (a1, r1) and (a2, r2) where (x, y) represents GP with initial term x and common ratio y and an integer… Read More The post Count of distinct integers belonging to first N terms of at least one of given GPs appeared first on GeeksforGeeks.

9h

Maximum element in connected component of given node for Q queries

Given an array of pairs arr[][] of length N, and an array queries[] of length M, and an integer R, where queries[i] contain an integer… Read More The post Maximum element in connected component of given node for Q queries appeared first on GeeksforGeeks.

9h

Implementation of Johnson’s algorithm for all-pairs shortest paths

Johnson’s algorithm finds the shortest paths between all pairs of vertices in a weighted directed graph. It allows some of the edge weights to be… Read More The post Implementation of Johnson’s algorithm for all-pairs shortest paths appeared first on GeeksforGeeks.

9h

Form a Rectangle from boundary elements of Matrix using Linked List

Given a Matrix grid[][] of size NxM where N is number of rows and M is number of columns. The task is to form a… Read More The post Form a Rectangle from boundary elements of Matrix using Linked List appeared first on GeeksforGeeks.

9h

Queue Operations

Given N integers, the task is to insert those elements in the queue. Also, given M integers, the task is to find the frequency of… Read More The post Queue Operations appeared first on GeeksforGeeks.

9h

Minimize arithmetic operations to be performed on adjacent elements of given Array to reduce it

Given an array arr[], the task is to perform arithmetic operations (+, -, *, /) on arr[] in sequence. These operations are performed on adjacent… Read More The post Minimize arithmetic operations to be performed on adjacent elements of given Array to reduce it appeared first on GeeksforGeeks.

9h