APT SortByFreqs

Problem Statement

The frequency with which data occurs is sometimes an important statistic. In this problem you are given an array of strings and must determine how frequently the strings occur. Return an array of strings that is sorted (ordered) by frequency. The first element of the returned array is the most frequently occurring string, the last element is the least frequently occurring. Ties are broken by listing strings in lexicographic/alphabetical order. The returned array contains one occurrence of each unique string from the array parameter.

Consider these strings (quotes for clarity, they're not part of the strings).


{"apple", "pear", "cherry", "apple", "pear", "apple", "banana"}

The array returned is:

   { "apple", "pear", "banana", "cherry" }

since the most frequently occurring string is "apple" which occurs 3 times; the string "pear" occurs twice and the other strings each occur once so they are returned in alphabetical order.

Definition

Class: SortByFreqs
Method: sort
Parameters: String[]
Returns: String[]
Method signature:
```
   String[] sort(String[] data)
```
(be sure your method is public)

Class
public class SortByFreqs { public String[] sort(String[] data) { // fill in code here } }
Notes
None
Constraints
- data will contain at most 500 elements
- each element of data will contain at most 50 characters, all characters are lowercase.
Examples
1. ```
data = {"apple", "pear", "cherry", "apple", "pear", "apple", "banana"}

Returns: {"apple", "pear", "banana", "cherry" }
```
  This is the example given above.
2. ```
data = {"a","b","c",d"}

Returns: {"a","b","c",d"}
```
3. ```
data = {"d","c","b","a"}

Returns: {"a","b","c",d"}
```
  Same as previous, each occurs once ties are broken alphabetically.
4. ```
data = {"a","a","a"}

Returns {"a"}
```
Owen L. Astrachan
Last modified: Tue Feb 14 22:18:46 EST 2006

APT SortByFreqs

Problem Statement

Definition

Class

Notes

Constraints

Examples