Check if a number N can be expressed in base B
Given a number N and any base B. The task is to check if N can be expressed in the form a1*b0 + a2*b1 +… Read More »
Category Archives: Divide and Conquer
Queries to find the Minimum Weight from a Subtree of atmost D-distant Nodes from Node X
Given an N-ary Tree rooted at 1, and an array val[] consisting of weights assigned to every node, and a matrix Q[][], consisting of queries… Read More »
Minimum count of elements required to obtain the given Array by repeated mirror operations
Given an array arr[] consisting of N integers, the task is to find the array K[] of minimum possible length such that after performing multiple… Read More »
Count distinct elements after adding each element of First Array with Second Array
Given two arrays arr1[] and arr2[]. We can generate another array arr3[] by adding each element of the array arr1[] to each element arr2[]. The… Read More »
Queries to check if any non-repeating element exists within range [L, R] of an Array
Given an array arr[] consisting of integers and queries Q of the form (L, R), the task is to check whether any non-repeating element is… Read More »
Find Second largest element in an array | Set 2
Given an array arr[] consisting of N integers, the task is to find the second largest element in the given array using N+log2(N) – 2… Read More »
Split a Numeric String into Fibonacci Sequence
Given a numeric string S representing a large number, the task is to form a Fibonacci Sequence of at least length 3 from the given… Read More »
Check if given Binary string follows then given condition or not
Given a binary string str, the task is to check whether the given string follows the below condition or not: String starts with a ‘1’.… Read More »
Least root of given quadratic equation for value greater than equal to K
Given the constants of quadratic equation F(x) = Ax2 + Bx + C as A, B, and C and an integer K, the task is… Read More »
Quick Sort using Multi-threading
QuickSort is a popular sorting technique based on divide and conquer algorithm. In this technique, an element is chosen as a pivot and the array… Read More »
Calculate weight of parenthesis based on the given conditions
Given a valid parenthesis string S, the task is to find the weight of parenthesis based on the following conditions: Weight of “( )” is… Read More »
Minimum cost of reducing Array by merging any adjacent elements repetitively
Given an array arr[] of N numbers. We can merge two adjacent numbers into one and the cost of merging the two numbers is equal… Read More »
Count of unordered pairs (x, y) of Array which satisfy given equation
Given an array arr[] of N integers both positive and negative, our task is to find the number of unordered pairs (x, y) which satisfy… Read More »
Divide N into K parts in the form (X, 2X, … , KX) for some value of X
Given a positive integer N and K, the task is to divide N into K parts such that the first part has a value X,… Read More »
Count of groups among N people having only one leader in each group
Given N number of people, the task is to count the number of ways to form groups of size ? N where, in each group,… Read More »
