undefined

Tasks | Level 6 | Lesson 8

Java Collections
Level 6 , Lesson 8
Available
undefined
32
Task
Java Collections, level 6, lesson 8
Locked
Understanding red-black trees
You are given an implementation of a red-black tree. But some methods are broken. Analyze the code and fix the errors. The main method is not tested. All of the modifiers are correct. Don't change variable or method names.
undefined
16
Task
Java Collections, level 6, lesson 8
Locked
Using TreeSet
The first parameter is the file name: file1. file1 only contains Latin letters, spaces, punctuation, dashes, and carriage returns. Sort the letters alphabetically and display the first 5 unique letters on a single line without separators.
undefined
16
Task
Java Collections, level 6, lesson 8
Locked
How many potential friends does a person have?
Today we'll analyze some functionality of social networks. How do social networks know who to suggest as friends you might know? This task is easily solved using graphs.
Comments (3)
TO VIEW ALL COMMENTS OR TO MAKE A COMMENT,
GO TO FULL VERSION
yz Level 37, Jakarta, Indonesia
13 April 2020
guys 2nd task want from u from each letter show one ex: aaabbbcc -> a,b,c; it doesnt want u to find which letter is unique like EX: accabca -> b;
Senned Level 41, Azov, Russia
19 December 2019
Task about Friends: Friends of index (4) - 0, 1, 3 there is deep=1 Friends of 0 - 1, 4, 5. there is deep=2 Friends of 1 - 0, 2, 4. there is deep=2 Friends of 3 - 4, 7. there is deep=2 Friends and potential friends for index :0, 1, 2, 3, 5, 7 potential friends for index : 2, 5, 7 In conditions description of int deep - seems wrong, with that it will be needs find friends of 0,1 and 3 too.
季军 Level 38, Shanghai, China
21 August 2019
In the task for TreeSet, don't pass any comparator to the constructor, or the validator cannot recognize the set......