## Minimum Swaps required to group all 1’s together

Given an array of 0’s and 1’s, we need to write a program to find the minimum number of swaps required to group all 1’s… Read More »

Given an array of 0’s and 1’s, we need to write a program to find the minimum number of swaps required to group all 1’s… Read More »

Given an array of N integers. We need to find an index such that Frequency of Even numbers on its left side is equal to… Read More »

Given a string s, count special substrings in it. A Substring of S is said to be special if either of the following properties is… Read More »

Given a range find total such numbers in the the given range such that they have no repeated digits. For example: 12 has no repeated… Read More »

Given an Array of Integers and an Integer value k, find out k sub-arrays(may be overlapping) which have k maximum sums. Examples: Input : arr… Read More »

Given an Array of Positive and Negative Integers, find out the Maximum Subarray Sum in that Array. Examples: Input1 : arr = {-2, -3, 4,… Read More »

Given an array of n non-negative integers. Choose three indices i.e. (0 <= index_1 <= index_ 2<= index_3 <= n) from the array to make… Read More »

Given a binary string containing only 0’s and 1’s. Write a program to find number of sub-strings of this string whose decimal representation is odd.… Read More »

Given a string of length n and a subsequence of length 3. Find the total number of occurrences of the subsequence in this string. Examples:… Read More »

Given N elements (both positive and negative). Find the maximum sum, provided that the first operation is to take some prefix of the sequence and… Read More »

Given a binary string, find the longest subsequence of the form (0)*(1)*(0)* in it. Basically we need to divide the string into 3 non overlapping… Read More »

Given a range [L, R], we need to find the count of total numbers of prime numbers in the the range [L, R] where 0

Given an array of n integers. You are given q queries. Write a program to print floor value of mean in range l to r… Read More »

Given an array of size ‘n’ and a given set of commands of size ‘m’. Every command consist of four integers q, l, r, k.… Read More »

Given a binary string of length N and an integer K, we need to find out how many substrings of this string are exist which… Read More »