Check if Two Strings are Anagram of Each Other

-
Given two strings, our task is to check whether these strings are an anagram of each other or not.
An Anagram of a string is a string that contains the same characters, the order of characters can be different.

For example:
Input: s1 = "hackyourcode" s2 = "codehackyour"
Output: True

Input: s1 = "pythoniseasy" s2 = "pythonisawesome"
Output: False

The most common method to solve this problem is to sort strings, then compare each character but this method takes O(NlogN) time to perform.
This problem can be solved efficiently O(N) using HashTable. Think about it!


Thank you so much for reading this article, if you like this question please share this with your friends who love programming. And if you have questions or feedback please drop a comment.

To solve more problems, please check out this article "Top 10 String Interview Questions".

All the Best!

Comments

Post a Comment

Popular posts from this blog

Four Sum Problem (4sum) Solution in Java, Python, C++

-
Given an array and K, your task is to find four elements in an array such that their sum is equal to K. You have to print all four elements in lexicographical order and make sure that no pair get repeated. (Level: Hard) For Example:  N = 9 and array = [3, 6, 8, 2, 3, 9, 5, 1, 7] and K = 18 so, one pair is 1+3+5+9 = 18 you have to find all pairs A SOLUTION IN C++: You can optimize it further! A SOLUTION IN PYTHON :  AN OPTIMIZED SOLUTION IN JAVA :  Thank you so much for reading this article, if you like this question please share this with your friends who love programming. And if you have questions or feedback please drop a comment. To solve more problems on Array and String, please check out these articles " Top 10 Array Interview Questions " and " Top 10 String Interview Questions ". All the Best!
Read more

Find the length of the longest substring without repeating character

-
Given a string, our task is to find the length of the longest substring without repeating any character. For example, the longest substring for "ABACDBFB" this string is "ACDBF" length of this string is 5. This problem can be solved with O(N) time complexity where N is the length of the string. Let's implement that: Thank you so much for reading this article, if you like this question please share this with your friends who love programming. And if you have questions or feedback please drop a comment. To solve more problems, please check out this article " Top 10 String Interview Questions ". All the Best!
Read more

Reverse Words in a Sentence Without using any Library

-
Given a sentence or a string, our task is to reverse an order of words and print them. For example: Input: "python is love" Output: "love is python" The idea is to solve this problem is using split() and join() methods. First, split the sentence into words than change the order of words, then join then as one sentence. Thank you so much for reading this article, if you like this question please share this with your friends who love programming. And if you have questions or feedback please drop a comment. To solve more problems, please check out this article " Top 10 String Interview Questions ". All the Best!
Read more