Basic Examples involving Hash Tables

In this section we will go through programming problems/scenarios which can be solved using hash tables. These problems are designed to teach the fundamentals of using hash tables which can then be used for solving more complicated problems. Below are the articles:

Word Frequency Counter using Hash Tables

When dealing with text analysis or natural language processing tasks, one fundamental operation is counting the frequency of words within a given text. This process involves determining how often each word appears in the text. One efficient and commonly used approach to accomplish this task is by using a hash table (also known as dictionary in python, unordered_map in C++). Read More

Find Duplicates Using Hash Table

Finding out duplicate entries in a list and analyzing or fixing them is one of the most common requirements in data analysis or cleansing. In this article we will look at how hash tables can be used to quickly get the list of all elements which are repeated more than once in a list. Read More

Group Anagrams Together

Anagrams are words or phrases that are formed by rearranging the letters of another word or phrase. In other words, an anagram is a word or phrase that contains the same letters with same frequency as another word or phrase, but in a different order. Read More

Finding Common Elements (intersection) between two arrays

Intersection of two arrays, or finding common elements between two arrays involves identifying all unique elements that are present in both the given arrays. This operation is relevant because it allows you to identify similarities and intersections between datasets. Read More