## Number of ways to sum up a total of N from limited denominations

Given a number N and two arrays arr1[] and arr2[] of length 4. The array arr1[] denotes the denomination of 1, 5, 10, and 20… Read More »

- Minimize the maximum difference between adjacent elements in an array
- Number of pairs in an array with the sum greater than 0
- Minimum salary hike for each employee such that no employee feels unfair
- Extended Knapsack Problem
- Huffman Coding using Priority Queue
- Maximum profit by buying and selling a share at most K times | Greedy Approach
- Find lexicographically smallest string in at most one swaps
- Why Prim’s and Kruskal's MST algorithm fails for Directed Graph?
- Shortest path in a directed graph by Dijkstra’s algorithm
- Find the Mth element of the Array after K left rotations
- Sum of all subarrays of size K
- Count subarrays having sum of elements at even and odd positions equal
- Maximum size of square such that all submatrices of that size have sum less than K
- Longest increasing sub-sequence formed by concatenating array to itself N times
- Count the elements having frequency equals to its value
- Maximum Possible Rating of a Coding Contest
- Count number of triangles possible for the given sides range
- Minimum cost to make an Array a permutation of first N natural numbers
- Find the maximum sum (a+b) for a given input integer N satisfying the given condition
- Number of containers that can be filled in the given time
- Proof that traveling salesman problem is NP Hard
- Queries to check if any non-repeating element exists within range [L, R] of an Array
- Lexicographical smallest number after at most K consecutive swaps
- Count of N digit Numbers whose sum of every K consecutive digits is equal
- Find the largest number smaller than integer N with maximum number of set bits
- Length of the Smallest Subarray that must be removed in order to Maximise the GCD
- Find subarray of Length K with Maximum Peak
- Minimum number of colors required to color a Circular Array
- Maximum sum subarray of size range [L, R]
- Replace each element of Array with it's corresponding rank

Given a number N and two arrays arr1[] and arr2[] of length 4. The array arr1[] denotes the denomination of 1, 5, 10, and 20… Read More »

Given an array arr[] containing distinct elements, the task is to check if all array elements can be removed by the selecting any two adjacent… Read More »

Given an array A[] consisting of integers [1, N], the task is to count the total number of subarrays of all possible lengths x (1… Read More »

Given a binary string S and an integer K, the task is to find the minimum number of flips required to convert the given string… Read More »

Given an integer N, the task is to find the smallest N digit number divisible by all possible prime digits, i.e, 2, 3, 5 and… Read More »

Given an array arr[], the task is to find the minimum cost to remove all elements from the array where cost of removing an element… Read More »

Pre-requisite: Fractional Knapsack Problem Given two arrays weight[] and profit[] the weights and profit of N items, we need to put these items in a… Read More »

Given a binary string S, the task is to find the minimum number of Powers of 2 required to express a S.Examples: Input: S =… Read More »

Given a numeric string S representing a large number, the task is to form a Fibonacci Sequence of at least length 3 from the given… Read More »

Given an array arr[] of N integers and an inetger K, the task is to find the length of the smallest subarray whose product when… Read More »

Given an array arr of positive integers, the task is to find the smallest length subarray of length more than 1 having an element occurring… Read More »

Given an initial array, A[] and a final array B[] both of size N containing integers from the range [1, N], where A[] represent the… Read More »

Given a sorted array arr[], the task is to calculate the number of missing numbers between the first and last element of the sorted array.… Read More »

Given an integer N, the task is to construct a matrix of size N2 using positive and negative integers and excluding 0, such that the… Read More »

Given a number N, we need to find the Fibonacci Series up to the N term. The Fibonacci series is a series of elements where,… Read More »