## Count of indices in an array that satisfy the given condition

Given an array arr[] of N positive integers, the task is to find the count of indices i such that all the elements from arr[0]… Read More »

- Count substrings that contain all vowels | SET 2
- Minimum number of adjacent swaps to convert a string into its given anagram
- Count pairs in an array such that the absolute difference between them is ≥ K
- Swap characters in a String
- Sort the Queue using Recursion
- Find number of triplets in array such that a[i]>a[j]>a[k] and i<j<k
- Convert an unbalanced bracket sequence to a balanced sequence
- Maximum length sub-array which satisfies the given conditions
- Number of balanced parenthesis substrings
- Minimum cost to make all array elements equal
- 21 Matchsticks Problem
- Find if a binary matrix exists with given row and column sums
- Find a sequence of N prime numbers whose sum is a composite number
- Remove Minimum coins such that absolute difference between any two piles is less than K
- Count the number of elements which are greater than any of element on right side of an array
- Find the number of cells in the table contains X
- First N terms whose sum of digits is a multiple of 10
- Arrange N elements in circular fashion such that all elements are strictly less than sum of adjacent elements
- Find missing elements from an Array
- Number of sub arrays with negative product
- Queries for number of distinct elements from a given index till last index in an array
- Sentence Case of a given Camel cased string
- Longest alternative parity subsequence
- Choose X elements from A[] and Y elements from B[] which satisfy the given condition
- Minimum cost to convert str1 to str2 with the given operations
- Subtraction of the alternate nodes of Linked List
- Concatenate strings in any order to get Maximum Number of "AB"
- Find three element from given three arrays such that their sum is X | Set 2
- Maximum sum of the array after dividing it into three segments
- Find the maximum elements in the first and the second halves of the Array

Given an array arr[] of N positive integers, the task is to find the count of indices i such that all the elements from arr[0]… Read More »

Given a binary array arr[] of size N. The task is to find the minimum number of inversions required so that no two adjacent elements… Read More »

Given two strings A and B of length N, the task is to check whether the two strings can be made equal by swapping any… Read More »

Given a number N, the task is to form N (from 0) by adding 1 or 2 in the minimum number of operations X such… Read More »

Given a string str, the task is to make the string start and end at the same character with the minimum number of given operations.… Read More »

Given an array arr[] of N integers with total element sum equal to zero. The task is to reduce every element to it’s half such… Read More »

Given two string S1 and S2, the task is to check whether both the strings can be made equal by performing the given operation on… Read More »

Given two numbers X and Y of the same length, the task is to find the minimum number d that needs to be added to… Read More »

Given two integers N and M, where N is the number of friends sitting in a clockwise manner in a circle and M is the… Read More »

Given a stack of integers and an integer K, the task is to sort the elements of the given stack using another stack in the… Read More »

Given an array arr[] of size N, the task is to check if it is possible to make the array non-decreasing by applying the given… Read More »

Given an array arr[] of size N. The task is to find maximum element among N – 1 elements other than arr[i] for each i… Read More »

Given two integers N and K, the task is to find the element at the Kth position if all odd numbers from 1 to N… Read More »

Given an array arr[] of N integers where N is even, the task is to group the array elements in the pairs (X1, Y1), (X2,… Read More »

Given an integer N where 1 ≤ N ≤ 105, the task is to find the number of positive integers less than or equal to… Read More »