## Hashing | Maps | Time Complexity | Collisions | Division Rule of Hashing | Strivers A2Z DSA Course

Hashing: Let’s first try to understand the importance of hashing using an example: Given an array of integers: [1, 2,

## Find the highest/lowest frequency element

Problem Statement: Given an array of size N. Find the highest and lowest frequency element. Pre-requisite: Hashing Theory and  Counting

## Contains Duplicate : Check if a value appears atleast twice

Problem Statement: Given an integer array nums, return true if any value appears at least twice in the array, and return

## Count Distinct Elements In Every Window

Problem Statement: “Given an array of integers and a number K. Find the count of distinct elements in every window

## Longest common span with same sum in binary array

Problem Statement: Given two binary arrays arr1[] and arr2[] of same size N. Find length of the longest common span

## Two Odd Occurring

Problem Statement: Find the two numbers which occur an odd number of times in the given unsorted array. Examples: Example

## One Odd Occurring

Problem Statement: Given an array of positive integers, where all elements are occurring even a number of times except one

## More than n/k Occurences of element in array

“Given an array of N integers, and an integer K. Write a program to find all the elements in an