## Extendible Hashing (Dynamic approach to DBMS)

Extendible Hashing is a dynamic hashing method wherein directories, and buckets are used to hash data. It is an aggressively flexible method in which the… Read More »

- Print characters and their frequencies in order of occurrence using a LinkedHashMap in Java
- Minimum Bitwise XOR operations to make any two array elements equal
- Extendible Hashing (Dynamic approach to DBMS)
- Count number of pairs in array having sum divisible by K | SET 2
- What are Hash Functions and How to choose a good Hash Function?
- Minimum deletions required to make frequency of each letter unique
- Sum of nodes in the left view of the given binary tree
- Check duplicates in a stream of strings
- Find missing elements from an Array
- Find the difference of count of equal elements on the right and the left for each element
- Print characters having even frequencies in order of occurrence
- Program to parse the Molecules and get the Atoms count
- XOR of elements in an array having prime frequency
- Sum of nodes in the right view of the given binary tree
- Triangle of numbers arising from Gilbreath's conjecture
- XOR of K smallest prime and composite numbers from the given array
- Bitwise AND of the sum of prime numbers and the sum of composite numbers in an array
- Absolute difference between the XOR of Non-Prime numbers and Prime numbers of an Array
- Print characters having prime frequencies in order of occurrence
- Number of distinct pair of edges such that it partitions both trees into same subsets of nodes
- Count equal element pairs in the given array
- Product of elements in an array having prime frequency
- GCD of elements which occur prime number of times
- Print the season name of the year based on the month number
- Area of the largest square that can be formed from the given length sticks using Hashing
- Check if two Integer are anagrams of each other
- XOR of K largest prime and composite numbers from the given array

Extendible Hashing is a dynamic hashing method wherein directories, and buckets are used to hash data. It is an aggressively flexible method in which the… Read More »

Given a chemical formula as a string, the task is to get the count of atoms in this chemical formula. Examples: Input: str = “Fe2H3OH”… Read More »

The task is to find the triangle of numbers arising from Gilbreath’s conjecture. Gilbreath’s conjecture: It is observed that given a sequence of prime numbers,… Read More »

Given an array arr[] of integers of size N and an integer K. One can perform the Bitwise XOR operation between any array element and… Read More »

Given an array arr[] of size N. The task is to find X – Y for each of the element where X is the count… Read More »

Given a string array arr[], the task is to find the longest sub-sequence of the array with at least one character appearing in all the… Read More »

Given two string arrays s1[] and s2[]. The task is to find the count of pairs (s1[i], s2[j]) such that s1[i] = s2[j]. Note that… Read More »

Given a sorted array of N integers. The task is to find the longest subsequence such that every element in the subsequence is reachable by… Read More »

Given an infinitely long binary tree having a pattern as below: 1 / \ 2 3 / \ / \ 4 5 6 7 /… Read More »

Given two arrays a[] and b[], the task is to find the count of all pairs (a[i], b[j]) such that a[i] + b[j] is unique… Read More »

Given an array of strings arr[], the task is to find the largest string in the array which is made up of the other strings… Read More »

Given a string of lowercase English alphabets and an integer 0 < K <= 26. The task is to divide the string into two parts… Read More »

Given an array of positive elements, you have to flip the sign of some of its elements such that the resultant sum of the elements… Read More »

Given a string str with repeated characters, the task is to rearrange the characters in a string such that no two adjacent characters are same.… Read More »

Given N elements and the task is to implement a stack which removes and returns the maximum frequency element on every pop operation. If there’s… Read More »