Hide Index

Hash Table

0% completed

Introduction to hash tables

Understanding the problem

Exploring a possible solution

Defining a hash function

Properties of a good hash function

Examples of hash functions

Internal mechanics of a hash table

Overview of supported operations

Separate chaining

Introduction to separate chaining

Key components of separate chaining

Implementing the hash table class

Search operation in separate chaining

Insert operation in separate chaining

Delete operation in separate chaining

newDesign a hash table with separate chaining

Linear probing

Introduction to linear probing

Key components of linear probing

Implementing the hash table class

Search operation in linear probing

Insert operation in linear probing

Delete operation in linear probing

newDesign a hash table with linear probing

Quadratic probing

Introduction to quadratic probing

Key components of quadratic probing

Implementing the hash table class

Search operation in quadratic probing

Insert operation in quadratic probing

Delete operation in quadratic probing

newDesign a hash table with quadratic probing

Double hashing

Introduction to double hashing

Key components of double hashing

Implementing the hash table class

Search operation in double hashing

Insert operation in double hashing

Delete operation in double hashing

newDesign a hash table with double hashing

Pattern: Counting

Understanding the counting pattern

Identifying the counting pattern

First non repeating character

Constructibility check

Anagram checker

Build palindrome

Cluster anagrams

Pattern: Pattern generation

Understanding the pattern generation pattern

Identifying the pattern generation pattern

Row specific words

Homomorphic strings

Pattern matching

Cluster displaced strings

Pattern: Fixed sized sliding Window

Understanding the fixed sized sliding window pattern

Identifying the fixed sized sliding window pattern

Duplicate detection

Subarray distinctness

Contains variation

Pattern: Variable sized sliding window

Understanding the variable sized sliding window pattern

Identifying the variable sized sliding window pattern

Unique character span

Two characters span

K characters span

Maximal character swap

Subarray sum equals k

Twin in proximity

Pattern: Prefix Sum

Understanding the prefix sum pattern

Identifying the prefix sum pattern

First equilibrium point

Self excluded array product

Balanced binary subarray

Zero sum subarrays

Design

Design a LRU cache

Design a randomised set

Assessment

Certificate

404

;