Answer:
for (scores.Entry<String, Integer> entry : scores.entrySet()) {
int value=0; String key="Rambo";
String k = entry.getKey();
int v = entry.getValue();
if (v>value)
{
value =v;
}
else
{
value=value;
}
}
for( scores.Entry<String, Integer> entry : scores.entrySet())
{
if( entry.getValue()==value)
System.out.println("Key = " + entry.getKey() + ", Value = " + entry.getValue());
}
Explanation:
The above scores are an object of Map type. And this is a parameter of findUopStudent function. So scores is a Map, and entry is an item. And we get its key and value. Now we compare each value using senteniel method and find the maximum value. Now we iterate through the scores using for the look and check the value of each entry against the maximum value found, and we print out the entry with maximum value. And that is the top student, which is required.
It should be the Sixth generation
Answer:
Explanation:
The following code is written in Python. It asks the user for an input. Then cleans the input using regex to remove all commas, whitespace, and apostrophes as well as making it all lowercase. Then it reverses the phrase and saves it to a variable called reverse. Finally, it compares the two versions of the phrase, if they are equal it prints out that it is a palindrome, otherwise it prints that it is not a palindrome. The test case output can be seen in the attached picture below.
import re
phrase = input("Enter word or phrase: ")
phrase = re.sub("[,'\s]", '', phrase).lower()
reverse = phrase[::-1]
if phrase == reverse:
print("This word/phrase is a palindrome")
else:
print("This word/phrase is NOT a palindrome")
