## Largest number made up of X and Y with count of X divisible by Y and of Y by X

Given three integers X, Y and N, the task is to find the largest number possible of length N consisting only of X and Y… 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
- Huffman Coding using Priority Queue
- Find lexicographically smallest string in at most one swaps
- Maximum profit by buying and selling a share at most K times | Greedy Approach
- Why Prim’s and Kruskal's MST algorithm fails for Directed Graph?
- Sum of all subarrays of size K
- Extended Knapsack Problem
- 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
- Find the maximum sum (a+b) for a given input integer N satisfying the given condition
- Minimum cost to make an Array a permutation of first N natural numbers
- Maximum Possible Rating of a Coding Contest
- Length of the Smallest Subarray that must be removed in order to Maximise the GCD
- Count number of triangles possible for the given sides range
- Shortest path in a directed graph by Dijkstra’s algorithm
- Find the largest number smaller than integer N with maximum number of set bits
- Find subarray of Length K with Maximum Peak
- Minimum number of colors required to color a Circular Array
- Find the String having each substring with exactly K distinct characters
- Smallest Palindromic Subsequence of Even Length in Range [L, R]
- Find the Number of Permutations that satisfy the given condition in an array
- Count of subarrays having exactly K prime numbers
- Largest lexicographical string with at most K consecutive elements
- XOR of pairwise sum of every unordered pairs in an array
- Count elements in first Array with absolute difference greater than K with an element in second Array
- Count of subarrays of size K which is a permutation of numbers from 1 to K
- Count of elements in an Array whose set bits are in a multiple of K

Given three integers X, Y and N, the task is to find the largest number possible of length N consisting only of X and Y… Read More »

Given two integers N and X, the task is to find the minimum count of integers with sum N and having unit digit X. If… Read More »

Given an array arr[] of N positive integers and a number K, the task is to find the maximum value of bitwise OR of the… Read More »

Given an undirected graph having N vertices and M edges and each vertex is associated with a cost and a source vertex S is given.… Read More »

Given an array arr[] of positive integers. The task is to reverse a subarray to minimize the sum of elements at even places and print… Read More »

Given an array arr[] of size N, the task is to find the minimum possible sum by extracting the smallest element from any K subsequences… Read More »

Given two arrays A[] and B[] consisting of N positive integers and a integer M, the task is to find the minimum value of X… Read More »

Given a string S of length N, consisting of only opening ‘(‘ and closing ‘)‘ parenthesis. The task is to find all indices ‘K‘ such… Read More »

Given a binary string s and a number K, the task is to find the maximum number of 0s that can be replaced by 1s… Read More »

Given a string S and integer M. The task is to perform exactly M operations to get lexicographical smallest string. In each operation, select one… Read More »

Given an undirected graph, the task is to count the maximum number of Bridges between any two vertices of the given graph. Examples: Input: Graph… Read More »

Given an integer N denoting number of jobs and a matrix ranges[] consisting of a range [start day, end day] for each job within which… Read More »

Given a string S, the task is to find the number of ways to split the given string S into two non-empty palindromic strings. Examples:… Read More »

Given two integers N and M. The task is to find the minimum number of points required to cover an N * M grid. A… Read More »

Given an array size[] of box sizes, our task is to find the number of boxes left at the end, after putting the smaller sized… Read More »