Each student has earned practice badges. Given badge counts, print the largest count.

For a project URL preview, convert a project title to lowercase letters.

A student earns points for each completed module. Given `n` point values, compute the total.

Count how many vowels appear in a line of text. Treat uppercase and lowercase vowels the same.

Given a numeric score, print the matching letter grade.

Read a student name and print a Caribbean Code welcome message.

A student practiced for `h` full hours. Convert that time to minutes.

Find the largest integer in a list.

Before a demo, a mentor counts down from `n` to 1. Print each number on its own line.

Given a secret number and a guess, print whether the guess is low, high, or correct.

A student practiced for `h` hours and `m` additional minutes. Compute the total number of minutes practiced.

A student is ready for certification review if their practice score is at least 70.

Given two integers, output their sum.

Given a number n and a list A of size n provide the count of all pairs that add up to every number in list B of size n.

Count how many times a target word appears in a sentence.

A string contains `P` for present and `A` for absent across several sessions. Find the longest consecutive run of `P`.

Given a list of route stop names and a school name, print `YES` if the school appears in the route and `NO` otherwise.

Track passengers on a bus after a sequence of stops.

Find the longest streak of days with temperature at least 30.

Given item cost and cash paid in Jamaican dollars, output the minimum number of bills/coins for the change using denominations 5000, 1000, 500, 100, 50, 20, 10, 5, and 1.

Given skill scores for students, sort them and print the difference between the highest and lowest score.

Each mentor group can hold `k` students. Given `n` students, print the minimum number of groups needed.

Answer range sum queries on a list using 1-based inclusive indexes.

Given `n` project tags and one target tag, count how many times the target appears.

Given attendance counts for sessions and a range `l` to `r`, print the total attendance in that inclusive range.

Given an undirected graph of rooms and paths, count how many rooms can be reached from room 1.

Given module study times and readiness values, choose modules whose total time is at most `T` and maximize total readiness.

Given start and end times for workshops, determine the maximum number happening at the same time. End times are exclusive.

Given daily practice minutes and a window size `k`, find the maximum total practice minutes over any consecutive `k` days.

Given scores and a threshold `t`, count how many scores are at least `t`.