## Find d to maximize the number of zeros in array c[] created as c[i] = d*a[i] + b[i]

Given two arrays of N integers. Consider an array C, where the i-th integer will be d*a[i] + b[i] where d is any arbitrary real… Read More »

- k-th missing element in an unsorted array
- Number of unique pairs in an array
- Choose atleast two elements from array such that their GCD is 1 and cost is minimum
- Count of words that are present in all the given sentences
- Minimum length substring with exactly K distinct characters
- Find the longest string that can be made up of other strings from the array
- Count occurrences of a string that can be constructed from another given string
- Sum of nodes in bottom view of Binary Tree
- Rearrange characters in a string such that no two adjacent are same using hashing
- Split the array elements into strictly increasing and decreasing sequence
- Sum of nodes in top view of binary tree
- Maximum length of the sub-array whose first and last elements are same
- Count duplicates in a given linked list
- Remove all occurrences of any element for maximum array sum
- Find uncommon characters of the two strings | Set 2
- Count of unique pairs (arr[i], arr[j]) such that i < j
- Minimum number of given operations required to convert a permutation into an identity permutation
- Number of subarrays such that XOR of one half is equal to the other
- Print the first shortest root to leaf path in a Binary Tree
- Design a stack which can give maximum frequency element
- Count of pairs of strings which differ in exactly one position
- Flip minimum signs of array elements to get minimum sum of positive elements possible
- Two equal sum segment range queries
- Count equal pairs from given string arrays
- Count all elements in the array which appears at least K times after their first occurrence
- Minimum changes required to make a Catalan Sequence
- Find d to maximize the number of zeros in array c[] created as c[i] = d*a[i] + b[i]
- Maximum product from array such that frequency sum of all repeating elements in product is less than or equal to 2 * k
- Longest sub-sequence of array containing Lucas numbers
- Count of pairs between two arrays such that the sums are distinct

Given two arrays of N integers. Consider an array C, where the i-th integer will be d*a[i] + b[i] where d is any arbitrary real… Read More »

Top view of a binary tree is the set of nodes visible when the tree is viewed from the top. Given a binary tree, the… Read More »

Given a string S and a number K. The task is to find the minimum length substring having exactly K distinct characters. Note: The string… Read More »

Given an array arr[] of N distinct integers. The task is to find the sum of two array integers a[i] + a[j] which occurs maximum… Read More »

Given an array arr[] of N integers. The task is to find the number of index quadruples (i, j, k, l) such that a[i], a[j]… Read More »

Given an array arr[] of N integer elements and an integer K. The task is to count all distinct arr[i] such that arr[i] appears at… Read More »

Given an array arr[] consisting of N positive integers, and some queries consisting of a range [L, R], the task is to find whether the… Read More »

Given an array arr[] of N integer elements, the task is to change the minimum number of elements of this array such that it contains… Read More »

Given an array arr[], the task is to count unordered pairs of positive integers (p, q) such that p occurs in the array at least… Read More »

Given an unsorted sequence a[], the task is to find the K-th missing contiguous element in the increasing sequence of the array elements i.e. consider… Read More »

Given a character array arr[] containing only lowercase English alphabets, the task is to print the maximum length of the subarray such that the first… Read More »

Given an array of N numbers, the task is to find the number of sub-arrays (size of the sub-array should be an even number) of… Read More »

Given an array arr[] and an integer k, the task is to find the maximum product from the array such that the frequency sum of… Read More »

Given an array arr[] of N elements, the task is to find the length of the longest sub-sequence in arr[] such that all the elements… Read More »

Given a Binary Tree with distinct values, the task is to print the first smallest root to leaf path. We basically need to print the… Read More »