## Permutation of a string with maximum number of characters greater than its adjacent characters

Given a string str, the task is to print the maximum count of characters which are greater than both its left and right character in… 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 a string str, the task is to print the maximum count of characters which are greater than both its left and right character in… Read More »

Given the following input (4322, 1334, 1471, 9679, 1989, 6171, 6173, 4199) and the hash function x mod 10, which of the following statements are… Read More »

Consider a hash table of size seven, with starting index zero, and a hash function (3x + 4)mod7. Assuming the hash table is initially empty,… Read More »

The keys 12, 18, 13, 2, 3, 23, 5 and 15 are inserted into an initially empty hash table of length 10 using open addressing… Read More »

How many different insertion sequences of the key values using the hash function h(k) = k mod 10 and linear probing will result in the… Read More »

A hash table of length 10 uses open addressing with hash function h(k)=k mod 10, and linear probing. After inserting 6 values into an empty… Read More »