AP Computer Science A Quiz
13 questions · no time limit
0:00
SELECTION AND ITERATION
Question 1 of 13
No time limit
Current
Answered
Flagged
Not seen
Problem: Determine if two strings are anagrams ignoring spaces and case. Input: s1 and s2 (each length 0–1000) containing letters and spaces. Output: true if they contain the same letters with the same counts; otherwise false. No external libraries. Function signature: public static boolean isAnagram(String s1, String s2). Given the problem description above, which function signature matches the problem requirements?
YOUR PROGRESS
13
QUESTIONS
Ready when you are
Answer in any order. Your progress shows here as you go.
QUESTIONS
KEYBOARD
Pick an answer ABCD
Next question ↵→
Previous ←
Flag for review F
Answers save as you go · flagged questions come back at the end