We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
staticbooleanisAnagram(Stringa,Stringb){// Complete the functiona=a.toLowerCase();b=b.toLowerCase();if(a.length()!=b.length())returnfalse;char[]ch1=a.toCharArray();char[]ch2=b.toCharArray();int[]freq1=newint[26];int[]freq2=newint[26];for(inti=0;i<ch1.length;i++){freq1[ch1[i]-'a']++;}for(inti=0;i<ch2.length;i++){freq2[ch2[i]-'a']++;}for(inti=0;i<freq1.length;i++){if(freq1[i]!=freq2[i]){returnfalse;}}returntrue;}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Join us
Create a HackerRank account
Be part of a 26 million-strong community of developers
Please signup or login in order to view this challenge
Java Anagrams
You are viewing a single comment's thread. Return to all comments →
Simple Solution