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

- Median of an unsorted array using Quick Select Algorithm
- Count of smaller elements on right side of each element in an Array using Merge sort
- Check if a given number is a Perfect square using Binary Search
- Sorting Algorithm Visualization : Merge Sort
- Minimum window size containing atleast P primes in every window of given range
- Check if a string is a scrambled form of another string
- Largest Square in a Binary Matrix with at most K 1s for multiple Queries
- Range Queries for number of Armstrong numbers in an array with updates
- Minimum capacity of small arrays needed to contain all element of the given array
- Array Range Queries to find the Maximum Armstrong number with updates
- Count number of pairs with the given Comparator
- Find the element having maximum set bits in the given range for Q queries
- Floyd-Rivest Algorithm
- Array range queries to find the number of perfect square elements with updates
- Frequency of an integer in the given array using Divide and Conquer
- Minimum value of K such that sum of cubes of first K natural number is greater than equal to N
- Range Queries to count the number of even parity values with updates
- Array range queries to find the maximum Fibonacci number with updates
- Find minimum y coordinates from set of N lines in a plane
- Range Update Queries to XOR with 1 in a Binary Array.
- Reduce the array by deleting elements which are greater than all elements to its left
- Sum of all array elements less than X and greater than Y for Q queries
- Minimum cost of reducing Array by merging any adjacent elements repetitively
- Count of unordered pairs (x, y) of Array which satisfy given equation
- Split a given array into K subarrays minimizing the difference between their maximum and minimum
- Longest subarray having sum K | Set 2
- Least root of given quadratic equation for value greater than equal to K
- Count of groups among N people having only one leader in each group
- Number Guessing Game in Python using Binary Search
- Quick Sort using Multi-threading

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 »

Given two arrays arr1[] and arr2[]. The array arr1[] is sorted. The task is to print the change in median after removing each element from… 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)… Read More »

Given an array arr[] of size N containing integers. The task is to find the length of the longest sub-array having sum equal to the… 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 »

Given a sorted array arr[] of N integers and an integer K, the task is to split the array into K subarrays such that the… Read More »

Given a sorted array arr[], and a set Q having M queries, where each query has values X and Y, the task is to find… Read More »

Given an array arr[] of N integers, the task is to delete the element from the given array if element to it’s left is smaller… Read More »