Developing Algorithms Using Strings

AP Computer Science A· difficulty 2/5

public static boolean isAna(String a, String b) {
  if (a.length() != b.length()) return false;
  char[] ca = a.toCharArray();
  char[] cb = b.toCharArray();
  java.util.Arrays.sort(ca);
  java.util.Arrays.sort(cb);
  return java.util.Arrays.equals(ca, cb);
}
// call: isAna("ab", "abc")

What does it return?

A
$null$
B
$false$
check_circle
C
$true$
D
$compile error$

Explanation

Different lengths can't be anagrams; returns false immediately.

Want 10 more like this — adaptive to your weak spots?

Practice 10 like thisarrow_forward Predict my AP score

Related questions