First, check if the lengths of both strings are equal. If not, they can't be anagrams and return false immediately.
If the lengths match, sort both strings using a built-in sorting algorithm.
Once sorted, iterate through each character of both strings and compare them one by one.
If any character mismatch is found, return false.
If all characters match, return true, confirming that the strings are anagrams.

Code

#include <bits/stdc++.h>
using namespace std;

// Function to check if two strings are anagrams
bool CheckAnagrams(string str1, string str2) {
    // Case 1: when both of the strings have different lengths
    if (str1.length() != str2.length()) {
        return false;  // Strings can't be anagrams if lengths are different
    }

    // Sort both strings
    sort(str1.begin(), str1.end());
    sort(str2.begin(), str2.end());

    // Case 2: check if every character of str1 and str2 matches with each other
    for (int i = 0; i < str1.length(); i++) {
        if (str1[i] != str2[i]) {
            return false;  // If any character doesn't match, they aren't anagrams
        }
    }

    return true;  // Strings 