## Length of the longest subsequence such that xor of adjacent elements is non-decreasing

Given a sequence arr of N positive integers, the task is to find the length of the longest subsequence such that xor of adjacent integers… Read More »

- Split the given array into K sub-arrays such that maximum sum of all sub arrays is minimum
- Find maximum meetings in one room
- Greedy approach vs Dynamic programming
- Largest substring with same Characters
- Find minimum changes required in an array for it to contain k distinct elements
- Maximum Length Chain of Pairs | Set-2
- Minimum number of pairs required to make two strings same
- Unbounded Fractional Knapsack
- Check whether a subsequence exists with sum equal to k if arr[i]> 2*arr[i-1]
- Count of integers that divide all the elements of the given array
- Create a Sorted Array Using Binary Search
- Find minimum length sub-array which has given sub-sequence in it
- Count common elements in two arrays containing multiples of N and M
- Maximum distance between two unequal elements
- Maximum String Partition
- Minimum deletions required to make GCD of the array equal to 1
- Minimum operations required to make every element greater than or equal to K
- Number of balanced parenthesis substrings
- Find the Kth smallest element in the sorted generated array
- Minimum deletions required such that any number X will occur exactly X times
- Longest Subarray having strictly positive XOR
- Maximum possible sub-array sum after at most X swaps
- Count ways to divide circle using N non-intersecting chord | Set-2
- Fractional Knapsack Queries
- Find if a binary matrix exists with given row and column sums
- Minimum deletions required to make frequency of each letter unique
- Lexicographically smallest string of length N and sum K
- Length of longest sub-array with maximum arithmetic mean.
- Minimum increment operations to make K elements equal
- Find Nth smallest number that is divisible by 100 exactly K times

Given a sequence arr of N positive integers, the task is to find the length of the longest subsequence such that xor of adjacent integers… Read More »

Given an integer array arr1 and a binary array arr2 of same size, the task is to find the maximum possible sum of products of… Read More »

Given an array arr[] of N integers and two players A and B are playing a game where the players pick the element with the… 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 an array arr[] of N positive integers, the task is to find an arrangement such that Bitwise AND of the first N – 1… Read More »

Given two integers X and Y, the task is to convert X to Y using the following operations: Add any prime number to X. Subtract… Read More »

Given an array arr[] of length N, the task is to find the overall sum of subsets of all the subsets of the array. Examples:… Read More »

Given an array arr[] of length N, the task is to find the length of the largest sub-sequence with non-negative sum. Examples: Input: arr[] =… Read More »

In graph theory, vertex colouring is a way of labelling each individual vertex such that no two adjacent vertex have same colour. But we need… Read More »

Given a range [L, R], the task is to find the maximum bitwise OR of some pair (a, b) from the given range. Examples: Input:… Read More »

Given an array arr[] of N integers and a positive integer K, the task is to minimize the sum of the array elements after performing… Read More »

Given two integers L and R, the task is to calculate the value of the expression: Examples: Input: L = 6, R =… Read More »

Given an array arr[]. The task is t find the value of X such that the result of the expression (A[1] – X)^2 + (A[2]… Read More »

Given an integer N, the task is to find the minimum length string whose sum of each character (As a = 1, b = 2,… Read More »

Given N lecture timings, with their start time and end time (both inclusive), the task is to find the minimum number of halls required to… Read More »