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
Category Archives: Divide and Conquer
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
Given binary string str, the task is to check whether the given string follows the below condition or not: String starts with a ‘1’. Each… Read More
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
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
Given a valid parenthesis string S, the task is to find the weight of the parenthesis based on the following conditions: Weight of “( )”… Read More
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
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
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
Given N number of people, the task is to count the number of ways to form groups of size? N where, in each group, the… Read More
Given two arrays arr1[] and arr2[]. The array arr1[] is sorted. The task is to print the change in the median after removing each element… Read More
Given a set of strings S and a string patt the task is to autocomplete the string patt to strings from S that have patt… Read More
Given an integer N, the task is to find the N-th Fibonacci numbers.Examples: Input: N = 3 Output: 2 Explanation: F(1) = 1, F(2) = 1 F(3) = F(1)… Read More
Given a string str and an integer K, the task is to find the length of the longest sub-string S such that every character in… Read More
