## Longest Increasing Subsequence using BIT

Given an array arr, the task is to find the length of Longest Increasing Sequence using Binary Indexed Tree (BIT) Examples: Input: arr = {6,… Read More »

## Minimum number of edges that need to be added to form a triangle

Given an undirected graph with N vertices and N edges. No two edges connect the same pair of vertices. A triangle is a set of… Read More »

## Queries to count integers in a range [L, R] such that their digit sum is prime and divisible by K

Given Q queries and an integer K where each query consists of a range [L, R] and the task is to find the count of… Read More »

## Find extra element in the second array

Given two arrays A[] and B[]. The second array B[] contains all the elements of A[] except for 1 extra element. The task is to… Read More »

## Maximum number of consecutive 1’s in binary representation of all the array elements

Given an array arr[] of N elements, the task is to find the maximum number of consecutive 1’s in the binary representation of an element… Read More »

## Maximum Bitwise OR pair from a range

Given a range [L, R], the task is to find a pair (X, Y) such that L ≤ X, Y ≤ R and (X |… Read More »

## Check whether all the substrings have number of vowels atleast as that of consonants

Given a string str, the task is to check whether all the substrings of length ≥ 2 have the number of vowels at least as… Read More »

## Best Way To Start With Competitive Programming – GeeksforGeeks CP Live Course

Remember the day of your childhood memories when first time your parents and friends handover some jigsaw puzzles games to you and you accepted the… Read More »

## Find closest integer with the same weight

Given a positive integer X the task is to find an integer Y such that: The count of set bits is Y is equal to… Read More »

## Minimum number of coins that can generate all the values in the given range

Given an integer N, the task is to find the minimum number of coins required to create all the values in the range [1, N].… Read More »

## Check whether the given decoded string is divisible by 6

Given a string str consisting of lowercase characters, the task is to check whether the string is divisible by 6 after changing it according to… Read More »

## Maximum count of elements divisible on the left for any element

Given an array arr[] of N elements. The good value of an element arr[i] is the number of valid indices j<i such that arr[j] is… Read More »

## Count of odd and even sum pairs in an array

Given an array arr[] of N positive integers, the task is to find the number of pairs with odd sum and the number of pairs… Read More »

## Maximum sum subarray of even length

Given an array arr[] of N elements, the task is to find the maximum sum of any subarray of length X such that X >… Read More »

## Check whether a node is leaf node or not for multiple queries

Given a tree with N vertices numbered from 0 to N – 1 where 0 is the root node. The task is to check if… Read More »