## Find the largest number that can be formed with the given digits

Given an array of integers arr[] representing digits of a number. The task is to write a program to generate the largest number possible using… Read More »

- Count pairs in array whose sum is divisible by K
- Count pairs in an array that hold i+j= arr[i]+arr[j]
- Count sub-arrays whose product is divisible by k
- Introduction to Merkle Tree
- Sum of elements whose square root is present in the array
- Count pairs of parentheses sequences such that parantheses are balanced
- Count of pairs of strings which differ in exactly one position
- Count all elements in the array which appears at least K times after their first occurrence
- Maximize the number of sum pairs which are divisible by K
- Number of subarrays having sum of the form k^m, m >= 0
- Number of pairs from the first N natural numbers whose sum is divisible by K
- Number of ways in which the substring in range [L, R] can be formed using characters out of the range
- Maximum count of pairs which generate the same sum
- Total distinct pairs of ugly numbers from two arrays
- Minimum cost to modify a string
- Total character pairs from two strings, with equal number of set bits in their ascii value
- Count pairs with average present in the same array
- Check if a given number divides the sum of the factorials of its digits
- Number of times the given string occurs in the array in the range [l, r]
- Print all the sum pairs which occur maximum number of times
- Sum of all odd frequency nodes of the Linked List
- Total distinct pairs from two arrays such that second number can be obtained by inverting bits of first
- Distinct pairs from given arrays (a[i], b[j]) such that (a[i] + b[j]) is a Fibonacci number

Given an array of integers arr[] representing digits of a number. The task is to write a program to generate the largest number possible using… 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, print… Read More »

Given a list of sentences and a list of phrases. The task is to find which sentence(s) contain all the words in a phrase and… Read More »

Given a string containing only two characters i.e. R and K (like RRKRRKKKKK). The task is to find the maximum value of N for a… Read More »

Given N strings. Find the longest possible subsequence from each of these N strings such that they are anagram to each other. The task is… Read More »

The java.lang.reflect.Method.hashCode() method returns the hash code for the Method class object. The hashcode returned is computed by exclusive-or operation on the hashcodes for the… Read More »

Given an array of distinct integers, print all the pairs having a positive value and negative value of a number that exists in the array.… Read More »

Given two strings str1 and str2, the task is to print the number of times str2 can be formed using characters of str1. However, a… Read More »

Prerequisite – Hashing A distributed system is a network that consists of autonomous computers that are connected using a distribution middleware. They help in sharing… Read More »

Given a binary search tree of n nodes with distinct values. Also given are Q queries. Each query consists of a node value that has… Read More »

Given a string containing lowercase characters. The task is to print the maximum occurring character in the input string. If 2 or more characters appear… Read More »

Given a N x N binary matrix. The problem is finding the maximum area sub-matrix having a count of 1’s one more than count of… Read More »

Given a string of lowercase English alphabets, find the number of counterclockwise shifts of characters required to make the string palindrome. It is given that… Read More »

Given N rows with M elements each and an array arr[] of L numbers, the task is to print the count of elements of that… Read More »

Mid-Square hashing is a hashing technique in which unique keys are generated. In this technique, a seed value is taken and it is squared. Then,… Read More »