"Finally, you're done. I'm tired of trying to keep your tasks in my head. Here's a couple more to keep you in shape:"

10
Java Syntax, level 7, lesson 9
Locked
Playing Javarella
Javarella 1.0: Dealing numbers into three lists. Here are the rules: Javarella receives a list of 20 numbers. You need to check which of them is divisible by 3, which by 2, and which are divisible by neither. Then the program needs to save them to separate lists. Numbers divisible by both 3 and 2 (for example 6) go into both lists. Let's dive in!
2
Java Syntax, level 7, lesson 9
Locked
Words in reverse
If half or more of your actions seem to be meaningless, don't worry: you probably clearly understand the fragility of existence, and can therefore become a great programmer. Then again, sometimes it just seems that way. Here's some meaning for your life: enter 5 words and put them in a list. Remove the third element of the list, and display the remaining elements in reverse order.
5
Java Syntax, level 7, lesson 9
Locked
More Sam-I-Am
From now on, green eggs and ham will be overshadowed by lists. Or would the opposite be better? Here's our task: add some of Dr. Suess's famous words to a list: "Sam", "I", "Am". After each word, we'll insert "Ham" into the list. And display the result on the screen. Each list element on a new line.
10
Java Syntax, level 7, lesson 9
Locked
R or L
Our friends from Planet Chi-Knees have an unusual problem: they have a really hard time distinguishing between the letters "r" and "l". We decided to help them with this task. The experimental fix method will remove from a string list all words containing the letter "r", and it will duplicate all words containing the letter "l".
5