## Minimum number of elements that should be removed to make the array good

Given an array arr[], the task is to find the minimum number of elements that must be removed to make the array good. A sequence… Read More »

- How can one become good at Data structures and Algorithms easily?
- Make all numbers of an array equal
- Reach the numbers by making jumps of two given lengths
- Some useful C++ tricks for beginners in Competitive Programming
- Check if a number is perfect square without finding square root
- Sum of XOR of all subarrays
- Sort the array of strings according to alphabetical order defined by another string
- Make Binary Search Tree
- Check if it is possible to reach a number by making jumps of two given length
- Sum of similarities of string with all of its suffixes
- Smallest Pair Sum in an array
- Find the number in a range having maximum product of the digits
- Maximum of all Subarrays of size k using set in C++ STL
- Print matrix in snake pattern from the last column
- Count distinct substrings that contain some characters at most k times
- Number of array elements derivable from D after performing certain operations
- Count common characters in two strings
- Operations required to make the string empty
- Program to find the kth character after decrypting a string
- Color N boxes using M colors such that K boxes have different color from the box on its left
- Minimum number of sets with numbers less than Y
- Find two numbers whose divisors are given in a random order
- Given two arrays count all pairs whose sum is an odd number
- Number of subarrays have bitwise OR >= K
- Use of FLAG in programming
- Sum of the multiples of two numbers below N
- Merge K sorted arrays of different sizes | ( Divide and Conquer Approach )
- Sum of bitwise AND of all subarrays
- Interactive Problems in Competitive Programming
- Maximum length substring with highest frequency in a string

Given an array arr[], the task is to find the minimum number of elements that must be removed to make the array good. A sequence… Read More »

Given a range [L, R] and two positive integers N and M. The task is to count the numbers in the range containing only non-zero… Read More »

Given three positive integers N, L and R. The task is to find the number of ways to form an array of size N where… Read More »

Given a number N(1 ≤ N ≤ 1018) without leading zeros. The task is to find the minimum number of moves required to make N… Read More »

Given two binary strings A and B of length N and M (up to 105). The task is to repeat the below process and find… Read More »

Given an array consisting of N positive integers, find the sum of bit-wise and of all possible sub-arrays of the array. Examples: Input : arr[]… Read More »

Given an array containing N positive integers, the task is to find the sum of XOR of all sub-arrays of the array. Examples: Input :… Read More »

Given an array arr[] of integers and an integer pos, the task is to find the minimum index i such that all the elements from… Read More »

Given the source point and the destination point of the path and two integers x and y. The task is to check whether it is… Read More »

Given an array arr[], the task is to find the maximum length of a subsequence such that the adjacent elements in the subsequence have a… Read More »

Given N strings of equal lengths. The strings contain only digits (1 to 9). The task is to count the number of strings that have… Read More »

A useful application of Pascal’s triangle is the calculation of combinations. The formula to find nCr is n! / r! * (n – r)! which… Read More »

Given an integer N, the task is to count all possible N digit numbers such that A + reverse(A) = 10N – 1 where A… Read More »

Given an array arr[] and an integer k, we can cut this array at k different positions where k[] stores the positions of all the… Read More »

Given the position of a Bishop on an 8 * 8 chessboard, the task is to count the total number of squares that can be… Read More »