## 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 »

- Largest Square in a Binary Matrix with at most K 1s for multiple Queries
- Check if a string is a scrambled form of another string
- Median of an unsorted array using Quick Select Algorithm
- Minimum cost of reducing Array by merging any adjacent elements repetitively
- Check if a given number is a Perfect square using Binary Search
- Minimum window size containing atleast P primes in every window of given range
- Find Second largest element in an array | Set 2
- Longest subarray having sum K | Set 2
- Queries to check if any non-repeating element exists within range [L, R] of an Array
- Range Queries for number of Armstrong numbers in an array with updates
- Queries to find the Minimum Weight from a Subtree of atmost D-distant Nodes from Node X
- Array Range Queries to find the Maximum Armstrong number with updates
- Minimum capacity of small arrays needed to contain all element of the given array
- Count number of pairs with the given Comparator
- Split a Numeric String into Fibonacci Sequence
- Frequency of an integer in the given array using Divide and Conquer
- Find the element having maximum set bits in the given range for Q queries
- Array range queries to find the number of perfect square elements with updates
- Split a given array into K subarrays minimizing the difference between their maximum and minimum
- Fast Doubling method to find the Nth Fibonacci number
- Largest substring where all characters appear at least K times | Set 2
- Check if given Binary string follows then given condition or not
- How to implement text Auto-complete feature using Ternary Search Tree
- Minimum value of K such that sum of cubes of first K natural number is greater than equal to N
- Calculate weight of parenthesis based on the given conditions
- Range Queries to count the number of even parity values with updates
- Least root of given quadratic equation for value greater than equal to K
- Quick Sort using Multi-threading
- Array range queries to find the maximum Fibonacci number with updates
- Reduce the array by deleting elements which are greater than all elements to its left

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 »

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 »

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 »

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 »

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 »

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 »

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 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 »

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 parenthesis based on the following conditions: Weight of “( )” is… 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,… Read More »