Java

1

Given a list containing strings of text, determine the longest string (i.e., the string that contains the largest number of characters).

2.

Given a string of text and a character to search for, count the number of times that the search character occurs in that string. For example, in the string Boo is not boolean, the search character appears five times, while the search character b appears once (because upper- and lowercase are considered distinct).