## Count of strings that can be formed from another string using each character at-most once

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 »

## Hashing in Distributed Systems

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 »

## Sudo Placement[1.4] | Jumping the Subtree

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 »

## Maximum occurring character in an input string | Set-2

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 »

## Maximum sub-matrix area having count of 1’s one more than count of 0’s

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 »

## Number of Counterclockwise shifts to make a string palindrome

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 »

## Count of elements of an array present in every row of NxM matrix

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

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 »

## 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 »

## Data Structures | Hash | Question 5

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 »

## Data Structures | Hash | Question 4

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 »

## Data Structures | Hash | Question 3

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 »

## Data Structures | Hash | Question 2

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 »

## Data Structures | Hash | Question 1

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 »