This is where the tie breaking rule finally becomes gradeable. Returning the VALUE of the largest element hides whether you kept the first or the last one; returning its INDEX does not. A strict greater-than keeps the earlier index and a greater-or-equal keeps the later one, and the exam always says which it wants.
What you are given
The driver builds an int array and passes it to your methods. Every array has at least one element. Write a class named Find. Do not write a main method.
The question
(a) public static int indexOfMax(int[] data) returns the index of the largest value, and the SMALLEST such index when it appears more than once.
(b) public static int indexOfLastMax(int[] data) returns the LARGEST index at which the largest value appears.
(c) public static int indexOf(int[] data, int target) returns the first index holding target, or -1 when it is absent.
(d) public static boolean isSorted(int[] data) returns whether the values never decrease from left to right.
What the reader is looking for
Write class Find with the four static methods described. No main method.
Parts (a) and (b) differ ONLY in their tie breaking. One uses a strict comparison and the other does not.
A one element array is sorted, and so is an array whose values are all equal.
Worked examples
These show what a correct answer prints. There are more cases you cannot see, and they use different values, so an answer built around just these numbers will fail.
Example 1 input
5
3 9 4 9 1
4
Example 1 output
1
3
2
false
Example 2 input
4
1 2 2 5
2
Example 2 output
3
3
1
true
Your answer
Main.java
Input for the Run button
How this is scored: your answer runs against every test case, and the fraction it passes becomes your score out of 4. That is not how a human AP reader marks a rubric, so treat the score as a check on whether your code works, and the rubric above as the thing you are actually practising.
Stuck?
Hint 1
Track the INDEX of the best element rather than its value. Comparing data[i] to data[best] keeps both facts in one variable.
Hint 2
A strict > never replaces on a tie, so the earliest winner survives. A >= replaces every time, so the latest one does.
Hint 3
Part (d) compares each element to the one before it. Values that are equal do not break the ordering, so the test is < and not <=.
Before you submit
4 mistake(s) that lose points on this question
Each of these is a real error the grader catches. Check your answer against them before you submit, not instead of trying.
part (a) replaces on a tie, so it reports the LAST maximum
part (b) does not replace on a tie, so it reports the FIRST maximum
part (c) returns the LAST match instead of the first
Whether you're a student, parent, or teacher — I'd love to hear from you.
Just want free AP CS resources?
Enter your email below and check the subscribe box — no message needed.
Students get daily practice questions and study tips. Teachers get curriculum resources and teaching strategies.
Typically responds within 24 hours
✓
Message Sent!
Thanks for reaching out. I'll get back to you within 24 hours.
34.8% of Tanner’s CSP students score 5s. The national average is 9.6%.
I’m a Student
I’m a Teacher
✓Free AP CSP Big Ideas cheat sheet (PDF)
✓Daily practice questions covering all 5 Big Ideas
✓Create Task tips that actually work — from a real AP teacher
✓Free class codes with student progress tracking
✓3 full practice exams + Top 100 questions for your class
✓Create Task guidance and pseudocode reference sheets
Which AP CS exams are you prepping for?
✓
You’re in!
Your Big Ideas cheat sheet is on its way.
No thanks, I’ll figure it out myself
Avg student improvement: 2+ score levels | Real AP teacher, not just a tutor
AP Cybersecurity — National Launch 2026–27
Get Early Access to AP Cyber
AP Cyber launches nationally fall 2026. Get in early to help shape the course — start free with Unit 1 and the free teacher gradebook.
✓
You’re in — you’re on the AP Cyber early-access list!
Tanner will follow up personally within 48 hours. Your feedback will directly shape what gets built.
Step 1 of 4
Early Access — Limited Spots
Who are you?
Are you a teacher or a student?
I’m a Teacher
I’m a Student
Free to start — Unit 1 and the teacher gradebook are always free, no credit card.
Founding teachers unlock all 5 units and get direct input on what we build.
Not interested right now
Step 2 of 4
Your School
Tell us about your class
Other AP CS courses you teach
Your Situation
Tell us about yourself
Step 3 of 4
Classroom Needs
What does your classroom need? (select all that apply)
How You Study
What would help you most? (select all that apply)
Step 4 of 4
Almost Done
Where should we send your early-access details?
Free gradebook + Unit 1 | Your feedback shapes the course | Built by a real AP teacher