CodeGym /Courses /Java Collections /Tasks | Level 9 | Lesson 9

Tasks | Level 9 | Lesson 9

Java Collections
Level 9 , Lesson 9
Available

"Hi, Amigo. Here, take this interesting task:"

20
Task
Java Collections, level 9, lesson 9
Locked
Unique substrings
Unique substrings
10
Task
Java Collections, level 9, lesson 9
Locked
Bits were bits
Bits were bits
20
Task
Java Collections, level 9, lesson 9
Locked
Unequal exchange
Unequal exchange
20
Task
Java Collections, level 9, lesson 9
Locked
Stairs
Stairs
20
Task
Java Collections, level 9, lesson 9
Locked
Fill 'er up
Fill 'er up
20
Task
Java Collections, level 9, lesson 9
Locked
Interfaces will save us!
Interfaces will save us!
10
Task
Java Collections, level 9, lesson 9
Locked
ISP
ISP
20
Task
Java Collections, level 9, lesson 9
Locked
Is a palindrome possible?
Is a palindrome possible?
20
Task
Java Collections, level 9, lesson 9
Locked
One change
One change
10
Task
Java Collections, level 9, lesson 9
Locked
isPowerOfThree
isPowerOfThree
10
Task
Java Collections, level 9, lesson 9
Locked
Rollback
Rollback
20
Task
Java Collections, level 9, lesson 9
Locked
Maximum area
Maximum area

"As usual, the secret agent will give you all of the implementation details."

Comments (9)
TO VIEW ALL COMMENTS OR TO MAKE A COMMENT,
GO TO FULL VERSION
Hoist Level 38, San Diego, United States
9 July 2025
Output // Testing isPalindromePermutation: aab: true abc: false Aab: true racecar: true hello: false A man a plan a canal Panama: true
Hoist Level 38, San Diego, United States
22 June 2025
Output: Power switch flipped. Turning on the SecuritySystem! Power switch flipped. Turning off the SecuritySystem!
Hoist Level 38, San Diego, United States
22 June 2025
Output Initial image: 1 5 6 3 0 0 5 6 1 6 3 2 4 3 4 0 1 6 0 4 0 1 3 4 0 1 3 3 2 3 4 4 0 1 6 1 4 6 2 0 0 0 6 6 2 2 1 6 0 5 4 0 3 3 5 5 6 0 3 6 5 3 6 5 4 0 6 6 0 5 4 1 4 4 2 6 5 5 0 6 5 3 3 0 0 3 2 6 1 3 0 6 0 5 6 2 4 4 3 2 Modified image: 1 5 6 3 0 0 5 6 1 6 3 2 4 3 4 0 1 6 0 4 0 1 4 4 0 1 3 3 2 3
Hoist Level 38, San Diego, United States
22 June 2025
Output: The number of possible ascents for 70 steps is: 2073693258389777176
Justin Smith Level 41, Greenfield, USA, United States
29 April 2023
It seems like we're at a point where we get tasks related to all kinds of things across the entire course and not specifically related to the topic of this chapter (this chapter's lessons up to this point are probably not test-able anyway). You can start to get a feeling that we're getting close to the end. The given difficulty levels for these should be ignored. The second one is rated Easy but I had a pretty rough time with it (I found a solution without a problem, but it is looking for the single fastest possible solution, and so of the many ways of solving this it will only accept that specific solution). On the other hand, the first one is rated medium but I found it pretty easy.
Tom Level 41, San Jose, Sweden
17 June 2021
so many exciting exercise!🤓
Juan Ma Level 1, Arauca, Colombia
1 July 2020
In One change Task, it should have said: ...method that returns true if it is possible to edit/add/delete (AT MOST) one character... because, to pass validator, equal strings must return true.
matemate123 Level 50, Kraków, Poland
4 December 2023
edit/add/delete or without changes -> return true
fzw Level 41, West University Place, United States
13 May 2020
Fill 'er up: Along four directions(up, down, left, right) from starting point, if color is the same as original color of starting point, change its color to desired color.