import java.util.Set; import java.util.TreeSet; import java.util.HashSet; import java.util.Map; import java.util.Random ; import java.util.TreeMap; /** You are given a map of names to scores. Your job is to find the name corresponding to the highest score. */ public class FindMax { public static void main(String[] args) { Map scores = new TreeMap(); Random random = new Random(1) ; scores.put("Dmytro", random.nextInt(100)) ; scores.put("Stefan", random.nextInt(100)) ; scores.put("Usman", random.nextInt(100)) ; scores.put("Rabib", random.nextInt(100)) ; scores.put("Chang", random.nextInt(100)) ; scores.put("Carlos", random.nextInt(100)) ; scores.put("Matthew", random.nextInt(100)) ; scores.put("Andrew", random.nextInt(100)) ; scores.put("Syeda", random.nextInt(100)) ; scores.put("Sundar", random.nextInt(100)) ; scores.put("Minesh", random.nextInt(100)) ; scores.put("Atoosa", random.nextInt(100)) ; scores.put("Shah", random.nextInt(100)) ; //For this problem we will assume scores are from 0 to 99 int maxScore = -1 ; String maxName = "" ; //-----------Start below here. To do: approximate lines of code = 5 // 1-5. find the name (maxName) of the person with the highest score //-----------------End here. Please do not remove this comment. Reminder: no changes outside the todo regions. System.out.println(maxName) ; }
import java.util.Set;
import java.util.TreeSet;
import java.util.HashSet;
import java.util.Map;
import java.util.Random ;
import java.util.TreeMap;
/**
You are given a map of names to scores.
Your job is to find the name corresponding to the highest score.
*/
public class FindMax
{
public static void main(String[] args)
{
Map<String, Integer> scores = new TreeMap<String, Integer>();
Random random = new Random(1) ;
scores.put("Dmytro", random.nextInt(100)) ;
scores.put("Stefan", random.nextInt(100)) ;
scores.put("Usman", random.nextInt(100)) ;
scores.put("Rabib", random.nextInt(100)) ;
scores.put("Chang", random.nextInt(100)) ;
scores.put("Carlos", random.nextInt(100)) ;
scores.put("Matthew", random.nextInt(100)) ;
scores.put("Andrew", random.nextInt(100)) ;
scores.put("Syeda", random.nextInt(100)) ;
scores.put("Sundar", random.nextInt(100)) ;
scores.put("Minesh", random.nextInt(100)) ;
scores.put("Atoosa", random.nextInt(100)) ;
scores.put("Shah", random.nextInt(100)) ;
//For this problem we will assume scores are from 0 to 99
int maxScore = -1 ;
String maxName = "" ;
//-----------Start below here. To do: approximate lines of code = 5
// 1-5. find the name (maxName) of the person with the highest score
//-----------------End here. Please do not remove this comment. Reminder: no changes outside the todo regions.
System.out.println(maxName) ;
}
}
![](/static/compass_v2/shared-icons/check-mark.png)
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 2 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)