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
Labels:

Comments

Post a Comment

Popular posts from this blog

Home Page

List of All Programs The Following is the List of all the programs on my Blog Math Programs Square Root of a number using Babylonian Method Finding The Next Smallest Palindrome Finding the Armstrong Numbers Factorial of a number GCD using Euclid's Algorithm Check if a number is Fibonacci Number or not LCM of 2 numbers Trailing Zeros in factorial of a number Sorting Algorithms Bubble Sort Algorithm Selection Sort Algorithm Insertion Sort Algorithm Shell Sort Algorithm Counting Sort Algorithm Linked List Programs Simple Singly Linked List Linked List in C++ Linked List in Python Linked List in Java Doubly Linked List Finding Kth element from the end of Linked List Delete a node from Linked List Delete Kth element from the end of Linked List Rotate Linked List in an Anti-clockwise direction Reversing first K nodes of a Linked List Binary Search Tree Left View of Binary Tree Righ...
4 comments
Read more

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. -+56 7 , +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)...
Post a Comment
Read more

Linked List in python

Linked list is a simple linear data structure formed by collection of data elements called nodes. Each node consists of a data element and link field. There is a head node that points to the starting of the linked list. this diagram shows a simple representation of the linked list. Linked list can be used to implement stacks, queues, list, associative arrays, etc.  Unlike arrays linked lists are not stored in contagious memory locations rather the are stored at any empty place in memory and the address of the next node is stored in the link field. Also you don't need to declare the size of the linked list at the time of initialization you can dynamically keep adding elements to the linked list. Click for complete information on Linked List  The following implementation of the linked list has the following methods implemented : isEmpty() : Returns true if the Linked List is empty. addToStart() : Adds elements at the start of the linked Li...
1 comment
Read more