## Count of numbers from range [L, R] that end with any of the given digits

Given a range [L, R], the task is to find the count of numbers from the range whose last digit is either 2, 3 or… Read More »

- Minimum number of times A has to be repeated such that B is a substring of it
- Pair with largest sum which is less than K in the array
- Square root of a number without using sqrt() function
- Find the winner of the match | Multiple Queries
- Implementation of BFS using adjacency matrix
- Length of longest subarray in which elements greater than K are more than elements not greater than K
- Check duplicates in a stream of strings
- m-WAY Search Trees | Set-1 ( Searching )
- Find the farthest smaller number in the right side
- Implementation of DFS using adjacency matrix
- Kth number from the set of multiples of numbers A, B and C
- QuickSelect (A Simple Iterative Implementation)
- Absolute difference between the XOR of Non-Prime numbers and Prime numbers of an Array
- Sentinel Linear Search
- Minimum sum of array elements based on given Criteria
- Find next greater element with no consecutive 1 in it's binary representation
- Check if the array has an element which is equal to XOR of remaining elements

Given a range [L, R], the task is to find the count of numbers from the range whose last digit is either 2, 3 or… Read More »

Given an array arr[] of N elements and an integer S. The task is to find the minimum number K such that the sum of… Read More »

Given a string str and an integer K, the task is to print the length of the longest possible substring that has exactly K unique… Read More »

Given an integer K and an array height[] where height[i] denotes the height of the ith tree in a forest. The task is to make… Read More »

Given a string str consisting of alphanumeric characters, the task is to check whether the string contains all the digits from 1 to 9. Examples:… Read More »

Given an array arr[] of N elements, the task is to check whether a symmetric plus is possible with the elements of the given array.… Read More »

Given an array arr[] of N elements and a number of queries where each query will contain three integers L, R and K. For each… Read More »

Given an array of integers, the task is to calculate the sum of GCD of all the subarrays of an array. GCD of an array… Read More »

Given four arrays containing integer elements and an integer sum, the task is to count the quadruplets such that each element is chosen from a… Read More »

Given an array arr[] of N integers where arr[i] is the height of the ith chocolate and all the chocolated are 1 unit wide, the… Read More »

Given a bracket sequence as a string str, the task is to find whether the given string can be balanced by moving at most one… Read More »

Given an array arr[] of N elements, the task is to find the count of triplets (arr[i], arr[j], arr[k]) such that (arr[i] + arr[j] +… Read More »

Given N ranges [L, R] and an integer K, the task is to check if there are any K ranges which overlap at any point.… Read More »

Given four integers A, B, C and K. Assume that all the multiples of A, B and C are stored in a set in sorted… Read More »

Given Q queries where each query consists of an integer N and the task is to find the smallest integer greater than N such that… Read More »