. Day 4 - Challenge 3 - Anagram Checker Skip to main content

Day 4 - Challenge 3 - Anagram Checker

Solving the Anagram Puzzle: An Anagram Checker in JavaScript

Are you familiar with the term "anagram"? An anagram is a word or phrase formed by rearranging the letters of another word or phrase, using all the original letters exactly once. For instance, the word "listen" can be rearranged to form "silent," making them anagrams of each other. Anagrams are not only an intriguing linguistic phenomenon but also a popular puzzle in the realm of wordplay. In this blog post, we'll delve into the concept of anagrams, understand the problem they pose, and craft a simple yet effective JavaScript program to check whether two strings are anagrams.

Understanding the Anagram Problem

Anagrams are like word puzzles that challenge us to find creative ways of rearranging letters to form new words. This process involves maintaining the same set of characters but altering their arrangement to unveil hidden meanings or relationships between words. The challenge here is to determine if two given strings are anagrams of each other.

The Anagram Checker Algorithm

Before we jump into the JavaScript code, let's outline the algorithm we'll be using to check if two strings are anagrams:

  1. Remove any non-alphabetic characters and convert both strings to lowercase for a consistent comparison.
  2. Count the frequency of each character in both strings.
  3. Compare the character frequencies in both strings. If they match for all characters, the strings are anagrams.

Let's Code!

Below is a simple JavaScript program that implements the anagram checker algorithm:


function cleanString(str) {
    return str.replace(/[^a-zA-Z]/g, '').toLowerCase();
}

function buildCharFrequencyMap(str) {
    const charFrequencyMap = {};

    for (let char of str) {
        charFrequencyMap[char] = (charFrequencyMap[char] || 0) + 1;
    }

    return charFrequencyMap;
}

function areAnagrams(str1, str2) {
    const cleanedStr1 = cleanString(str1);
    const cleanedStr2 = cleanString(str2);

    if (cleanedStr1.length !== cleanedStr2.length) {
        return false;
    }

    const charFrequencyMap1 = buildCharFrequencyMap(cleanedStr1);
    const charFrequencyMap2 = buildCharFrequencyMap(cleanedStr2);

    for (let char in charFrequencyMap1) {
        if (charFrequencyMap1[char] !== charFrequencyMap2[char]) {
            return false;
        }
    }

    return true;
}

// Test cases
console.log(areAnagrams("listen", "silent")); // true
console.log(areAnagrams("hello", "world"));   // false

Explaining the Code

  1. cleanString: This function takes a string as input, removes all non-alphabetic characters, and converts it to lowercase.

  2. buildCharFrequencyMap: This function builds a frequency map of characters in a given string.

  3. areAnagrams: This function checks if two input strings are anagrams. It first cleans and prepares the strings, then compares their character frequency maps.

Demo

Anagram Checker


Conclusion

Anagrams are intriguing linguistic puzzles that challenge us to think creatively about word arrangements. By breaking down the problem into steps and leveraging the power of programming, we can easily determine whether two strings are anagrams or not. The JavaScript program we've crafted demonstrates the process of solving the anagram puzzle using a simple and efficient algorithm.

Next time you encounter a collection of letters, consider the possibility that they might form an anagram waiting to be unraveled!

Now write the same program in your favorite language in comment section. 

Other Challenges:

  1. Day 2 Challenges
  2. Day 3 Challenges
  3. Day 4 Challenges

 

Labels:

Comments

Post a Comment

Popular posts from this blog

Day 9 - Challenge 1 - Product of Array Except Self

Solving the "Product of Array Except Self" Problem in JavaScript Are you ready to dive into a common coding challenge that not only tests your programming skills but also sharpens your problem-solving mindset? If you're up for the challenge, let's tackle the "Product of Array Except Self" problem together using JavaScript. This problem requires us to return an array where each element at index i is the product of all the elements in the original array except the one at index i . Understanding the Problem:   Imagine you're given an array of integers, let's call it nums . Your task is to create a new array where the value at index i in this new array is the product of all the elements in nums , except the one at index i . In other words, you're calculating the product of all the elements to the left of nums[i] and the product of all the elements to the right of nums[i] , and then multiplying these two products to get the final value at index i ...
Post a Comment
Read more

Day 9 - Challenge 2 - Reverse Linked List

Reversing a Singly Linked List in JavaScript: An In-Place Approach Introduction:   Singly linked lists are fundamental data structures in computer science that consist of a sequence of nodes, each containing data and a reference to the next node in the list. Reversing a singly linked list is a classic problem that challenges programmers to manipulate pointers effectively to achieve the desired outcome. In this blog post, we'll explore the problem of reversing a singly linked list using an in-place approach and provide a step-by-step solution in JavaScript. Problem Statement:   Given the head of a singly linked list, our task is to reverse the list in-place and return its new head. In other words, we need to modify the pointers of the nodes in such a way that the direction of the linked list is reversed. Solution Approach:   To solve this problem, we will iterate through the linked list while maintaining three pointers: previous , current , and next . The previous pointer...
Post a Comment
Read more

Day 8 - Challenge 2 - Move Zeroes to the End

Moving Zeroes to the End: A JavaScript Solution Introduction:   When working with arrays, there are often times when we need to manipulate their elements to achieve a specific goal. One common problem is moving all zeroes to the end of an array while keeping the order of non-zero elements unchanged. In this blog post, we will explore an elegant solution to this problem using JavaScript. We'll discuss the problem statement, the approach we'll take, and provide a step-by-step guide to implementing the solution. The Problem:   Given an array of integers, the task is to move all zeroes to the end of the array while maintaining the relative order of the non-zero elements. This means that after rearranging the array, all the zeroes should be at the end, and the order of the non-zero elements should remain the same. The Approach:   To solve this problem, we can utilize a two-pointer approach. We'll maintain two pointers, one for iterating through the array and another for keepin...
Post a Comment
Read more