## Total distinct pairs from two arrays such that second number can be obtained by inverting bits of first

Given two arrays arr1[] and arr2[], the task is to take an element from first array (say a) and one element from second array (say… 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
- Longest Subsequence with at least one common digit in every element
- 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
- Minimum deletions from string to reduce it to string with at most 2 unique characters
- Count occurrences of the average of array elements with a given number
- Find all good indices in the given Array
- Total distinct pairs of ugly numbers from two arrays
- Maximum count of pairs which generate the same sum
- Total character pairs from two strings, with equal number of set bits in their ascii value
- Check if a given number divides the sum of the factorials of its digits
- Minimum array elements to be changed to make it a Lucas Sequence
- Print all the sum pairs which occur maximum number of times
- Total distinct pairs from two arrays such that second number can be obtained by inverting bits of first
- PHP | hash_hmac_algos() Function
- PHP | hash_copy() Function
- PHP | hash_equals() Function

Given two arrays arr1[] and arr2[], the task is to take an element from first array (say a) and one element from second array (say… Read More »

Given an integer N, the task is to check whether N divides the sum of the factorials of its digits. Examples: Input: N = 19… Read More »

Given an array arr[] of strings of equal lengths. The task is to calculate the total number of pairs of strings which differ in exactly… Read More »

Given an integer k and an array arr[], the task is to count the number of sub-arrays which have the sum equal to some positive… Read More »

Given two arrays arr1[] and arr2[] of sizes N and M where 0 ≤ arr1[i], arr2[i] ≤ 1000 for all valid i, the task is… Read More »

Given a string S and a range [L, R]. The task is to find the number of ways in which the sub-string in the range… Read More »

Given an integer K and an array arr[], the task is to count all the sub-arrays whose product is divisible by K. Examples: Input: arr[]… Read More »

Given an array arr[], the task is to count maximum count of pairs which give the same sum. Examples: Input: arr[] = {1, 2, 3,… Read More »

Given the integer values of N and K. The task is to find the number of pairs from the set of natural numbers up to… Read More »

Given an array A[] and positive integer K, the task is to count total number of pairs in the array whose sum is divisible by… Read More »

Given an array of N integers and an integer K. The task is to print the maximum number of pairs(a[i]+a[j]) possible which are divisible by… 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 two strings s1 and s2. The task is to take one character from first string and one character from second string and check if… 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 N bracket sequences, the task is to find the number of pairs of bracket sequences by joining which can be obtained a balanced bracket… Read More »