Hello Friends, How are you? Today I am going to share the solution of Hackerrank Java Anagrams Problems. This is a very important problem of the Hackerrank java domain. In this post, I’ll give two approaches to solve HackerRank Java Anagrams Problem. If you want only the solution then jump directly to the code and learn. {tocify} $title={Table of Contents} An anagram of a string is another string that contains the same characters, only the order of characters can be different. For example, “abcd” and “dabc” are an anagram of each other. Two strings, a and b, are called anagrams if they contain all the same characters in the same frequencies. For this challenge, the test is not case-sensitive. For example, the anagrams of CAT are CAT, ACT, tac, TCA, aTC, and CtA. Complete the isAnagram function in the editor. isAnagram has the following parameters:
- string a: the first string
- string b: the second string
- boolean: If a and b are case-insensitive anagrams, return true. Otherwise, return false.
The first line contains a string a. The second line contains a string b.
- 1
