## Maximum profit by selling N items at two markets

Given two array A[] and B[] each of length N where A[i] and B[i] are the prices of the ith item when sold in market… Read More »

- Find maximum meetings in one room
- Largest substring with same Characters
- Find minimum changes required in an array for it to contain k distinct elements
- Count of integers that divide all the elements of the given array
- Maximum String Partition
- Fractional Knapsack Queries
- Minimum deletions required to make frequency of each letter unique
- Lexicographically smallest string of length N and sum K
- Minimum increment operations to make K elements equal
- Check if string can be rearranged so that every Odd length Substring is Palindrome
- Count total number of even sum sequences
- Minimum cost to convert str1 to str2 with the given operations
- Minimum halls required for class scheduling
- Count of numbers in the range [L, R] which satisfy the given conditions
- Minimum element left from the array after performing given operations
- Maximum number of elements without overlapping in a Line
- Find the minimum capacity of the train required to hold the passengers
- Minimum Possible sum of digits in a positive multiple of N
- Minimum number of Binary strings to represent a Number
- Find permutation with maximum remainder Sum
- Find numbers which are multiples of first array and factors of second array
- Find the minimum value of X for an expression
- Minimum steps required to reduce all the elements of the array to zero
- Minimum length String with Sum of the alphabetical values of the characters equal to N
- Random list of M non-negative integers whose sum is N

Given two array A[] and B[] each of length N where A[i] and B[i] are the prices of the ith item when sold in market… Read More »

Given three integers N, S and K, the task is to create an array of N positive integers such that the bitwise OR of any… Read More »

Given an array arr[] with N distinct numbers and another array arr1[] with N-1 operators (either < or >), the task is to organize the… Read More »

Given an integer array arr[], the task is to count the number of partitions possible such that in each partition the minimum element divides all… Read More »

Given an array arr[] consisting of even integers. At each move, you can select any even number X from the array and divide all the… Read More »

Given two binary strings of equal length, the task is to find the minimum number of swaps to make them equal. Swapping between two characters… Read More »

Given N binary strings b1, b2, b3…. bn. The task is to find the maximum number of binary strings that you can make palindromic by… Read More »

Given an array of length N, the task is to find minimum operation required to make all elements in the array equal. Operation is as… Read More »

Given a matrix of N rows and M columns, given two points on the matrix; the task is to count the number of cells that… Read More »

Given a sorted array of length ‘N’ and an integer ‘K'(K<N), the task is to remove exactly 'K' elements from the array such that sum… Read More »

Given two numbers n and m, the task is to find the minimum number of operations required to make them equal if the following operations… Read More »

Given an integer N, the task is to find the greatest number that can be obtained by flipping at most K bits in the binary… Read More »

There are N cities situated on a straight road and each is separated by a distance of 1 unit. You have to reach the (N… Read More »

Kruskal’s algorithm for MST Given a connected and undirected graph, a spanning tree of that graph is a subgraph that is a tree and connects… Read More »

Given a matrix of size M * N, the task is to find the count of the minimum number of cells that must be flipped… Read More »