Skip to main content

Check is given strings are Anagrams

Checking if 2 given strings are anagrams or not is one of the most common and easiest interview questions which is often asked in interview coding rounds. In this post we discuss method to identify if 2 strings are anagrams or not.

2 strings or words or phrases are said to be Anagrams if they are formed by rearrangement of same letters.
For example we consider "HOST" and "SHOT" they are formed by rearrangement of letters H,O,S,T.
We can find a lot of such examples.

Let us now discuss the method to check if 2 strings are anagrams.

  1. First we remove all the white spaces from the given strings.
  2. For strings to be anagrams the length of the strings after removing white spaces must be same, so we compare lengths.
    • if the lengths are equal then we move forward.
    • else we stop as the length of the strings must be same.
  3. The next step is to convert the string to lowercase, this step is optional and you can choose not to do it depending on your requirement.
  4. Then we need to sort all the characters of the string.
  5. Finally we compare the sorted string
    • if the strings are equal then they are anagrams.
    • else they are not anagrams.

Below is the implementation code in cpp, java, python.

C++ Program

For the c++ program I have used standard methods from algorithms and cctype to remove whitespaces and convert string to lower case,
If you don't want to use them then you can use the below code to do the same

Removing white spaces

Converting to lowercase

Sample input and output to check the program

You might also be interested in 

Double Linked List
Finding Middle node in a Linked List
Infix to Prefix Conversion
Infix to Postfix Conversion
Binary Search Tree
4 Different methods to swap values


Popular posts from this blog

Infix to Prefix conversion using Stack

This post is about conversion of Infix expression to Prefix conversion. For this conversion we take help of stack data structure, we need to push and pop the operators in and out of the stack.

Infix expressions are the expressions that we normally use,eg. 5+6-7; a+b*c etc. Prefix expressions are the expressions in which the 2 operands are preceded by the operator eg. -+567 , +a*bc etc.

This method is very similar to the method that we used to convert Infix to Postfix but the only difference is that here we need to reverse the input string before conversion and then reverse the final output string before displaying it.

NOTE: This changes one thing that is instead of encountering the opening bracket we now first encounter the closing bracket and we make changes accordingly in our code.

So, to convert an infix expression to a prefix expression we follow the below steps
(we have 2 string, 1st is the input infix expression string 2nd is the output string which is empty initially)

We first revers…

Hashing with Quadratic Probing

Hashing is a technique used for storing , searching and removing elements in almost constant time. Hashing is done with help of a hash function that generates index for a given input, then this index can be used to search the elements, store an element, or remove that element from that index.

A hash function is a function that is used to map the data elements to their position in the data structure used. For example if we use an array to store the integer elements then the hash function will generate position for each element so that searching, storing and removing operation on the array can be done in constant time that is independent of the number of elements in the array. For better look at the example below.

now we face a problem if for 2 numbers same position is generated example consider elements 1 and 14

1 % 13 = 1

14 % 13 = 1

so when we get 1 we store it at the first position, but when we get 14 we see that the position 1 is already taken, this is a case of collision.


Home Page