Notice: This page requires JavaScript to function properly.
Please enable JavaScript in your browser settings or update your browser.Challenge: Creating Hash Table with String Keys | Advanced Data Structures
Algorithms and Data Structures Overview
course content

Course Content

Algorithms and Data Structures Overview

Algorithms and Data Structures Overview

1. Introduction to ADS
Why Do We Need Algorithms and Data StructuresWhy Do We Need Data Structures?Algorithm AnalysisBig-O NotationChallenge: How to Determine Algorithm Complexity
2. List and Array
Array Data StructureBasic Array Operations Time ComplexityChallenge: Inserting Elements into the ArrayLinked List Data StructureBasic List Operations Time ComplexityChallenge: Inversing the Order of Elements in the ListDoubly Linked List
3. Advanced Data Structures
StacksQueuesChallenge: Using Stack to Find PalindromeHash TableChallenge: Creating Hash Table with String Keys
4. Graphs
What is GraphGraph ImplementationChallenge: Graph Traversal AlgorithmsBSTBST TraversalChallenge: Balanced Trees

bookChallenge: Creating Hash Table with String Keys

Task

In the previous chapter, we created a hash table with a function that can work with numerical keys. Now you will implement a hash function that will work with keys of type string.

This particular hash function must calculate the hash value by summing the ASCII values of the characters in the key string. Doing so transforms variable-length input (keys of different lengths) into a fixed-size hash value. This hash value is then modulo with the size of the hash table to determine the index where the key-value pair should be stored.

Your task is to implement this hash function by filling the gaps in the ._hash_function() method of the HashTable class.

Switch to desktopSwitch to desktop for real-world practiceContinue from where you are using one of the options below
Everything was clear?

How can we improve it?

Thanks for your feedback!

Section 3. Chapter 5
toggle bottom row

bookChallenge: Creating Hash Table with String Keys

Task

In the previous chapter, we created a hash table with a function that can work with numerical keys. Now you will implement a hash function that will work with keys of type string.

This particular hash function must calculate the hash value by summing the ASCII values of the characters in the key string. Doing so transforms variable-length input (keys of different lengths) into a fixed-size hash value. This hash value is then modulo with the size of the hash table to determine the index where the key-value pair should be stored.

Your task is to implement this hash function by filling the gaps in the ._hash_function() method of the HashTable class.

Switch to desktopSwitch to desktop for real-world practiceContinue from where you are using one of the options below
Everything was clear?

How can we improve it?

Thanks for your feedback!

Section 3. Chapter 5
toggle bottom row

bookChallenge: Creating Hash Table with String Keys

Task

In the previous chapter, we created a hash table with a function that can work with numerical keys. Now you will implement a hash function that will work with keys of type string.

This particular hash function must calculate the hash value by summing the ASCII values of the characters in the key string. Doing so transforms variable-length input (keys of different lengths) into a fixed-size hash value. This hash value is then modulo with the size of the hash table to determine the index where the key-value pair should be stored.

Your task is to implement this hash function by filling the gaps in the ._hash_function() method of the HashTable class.

Switch to desktopSwitch to desktop for real-world practiceContinue from where you are using one of the options below
Everything was clear?

How can we improve it?

Thanks for your feedback!

Task

In the previous chapter, we created a hash table with a function that can work with numerical keys. Now you will implement a hash function that will work with keys of type string.

This particular hash function must calculate the hash value by summing the ASCII values of the characters in the key string. Doing so transforms variable-length input (keys of different lengths) into a fixed-size hash value. This hash value is then modulo with the size of the hash table to determine the index where the key-value pair should be stored.

Your task is to implement this hash function by filling the gaps in the ._hash_function() method of the HashTable class.

Switch to desktopSwitch to desktop for real-world practiceContinue from where you are using one of the options below
Section 3. Chapter 5
Switch to desktopSwitch to desktop for real-world practiceContinue from where you are using one of the options below
some-alt