Important Notice:

Practice-It will be discontinued as of November 1st, 2024. After this date, the website will remain online for a transitional period, but login will be restricted to University of Washington NetID authentication. This marks the next phase towards the platform's full retirement. Thank you for your use and support of the application over the years.

If you are looking for an alternative, a similar tool, CodeStepByStep, was developed independently by the original author of Practice-It, and is available at codestepbystep.com**

logo Practice-It logo

Main Page → Problems → Solve a Problem

mode

Language/Type: Java Guava collections
Author: Marty Stepp (on 2013/03/25)

Write a method named mode that accepts a List of strings as a parameter and returns an integer representing the number of occurrences of the most frequently occurring element of the list (also called the "mode" of the list). If the list is empty, return 0. If all elements in the list are unique, return 1. For example, if your method were passed the list [A, ZZ, B, B, G, A, B, B, XY, K, F, B, C, A, D], you would return 5 because there are 5 occurrences of "B", the most frequently occurring element. You should use an auxiliary collection from the Guava framework to help you.

Your code should run in O(N) time where N is the number of elements in the list. You may assume that neither the list nor any of its elements are null. Do not modify the list in any way.

Type your solution here:


This is a method problem. Write a Java method as described. Do not write a complete program or class; just the method(s) above.

You must log in before you can solve this problem.


Log In

If you do not understand how to solve a problem or why your solution doesn't work, please contact your TA or instructor.
If something seems wrong with the site (errors, slow performance, incorrect problems/tests, etc.), please

Is there a problem? Contact a site administrator.