This code has better time and space complexity staticbooleanisAnagram(Stringa,Stringb){if(a.length()!=b.length())returnfalse;int[]arr=newint[26];Stringf=a.toLowerCase();Strings=b.toLowerCase();for(inti=0;i<a.length();i++){arr[f.charAt(i)-'a']++;arr[s.charAt(i)-'a']++;...
And then in another OA expected people to find the Articulation Points in a graph too?Like seriously if you ask those questions on a OA, where a person can't get any hints, you should expect nearly everyone to cheat and look up the answers. ...