style: format TopKFrequentWords files with clang-format

Author: oleksii-tumanov

src/main/java/com/thealgorithms/strings/TopKFrequentWords.java

@@ -12,6 +12,9 @@
  * <p>Words are ranked by frequency in descending order. For equal frequencies,
  * words are ranked in lexicographical ascending order.
  *
+ * <p>Reference:
+ * https://en.wikipedia.org/wiki/Top-k_problem
+ *
  */
 public final class TopKFrequentWords {
     private TopKFrequentWords() {
@@ -45,11 +48,7 @@ public static List<String> findTopKFrequentWords(String[] words, int k) {
         }
 
         List<String> candidates = new ArrayList<>(frequency.keySet());
-        candidates.sort(
-            Comparator.<String>comparingInt(frequency::get)
-                .reversed()
-                .thenComparing(Comparator.naturalOrder())
-        );
+        candidates.sort(Comparator.<String>comparingInt(frequency::get).reversed().thenComparing(Comparator.naturalOrder()));
 
         int limit = Math.min(k, candidates.size());
         return new ArrayList<>(candidates.subList(0, limit));

src/test/java/com/thealgorithms/strings/TopKFrequentWordsTest.java

@@ -18,30 +18,8 @@ void testFindTopKFrequentWords(String[] words, int k, List<String> expected) {
     }
 
     static Stream<Arguments> validTestCases() {
-        return Stream.of(
-            Arguments.of(
-                new String[] {"i", "love", "leetcode", "i", "love", "coding"},
-                2,
-                List.of("i", "love")
-            ),
-            Arguments.of(
-                new String[] {"the", "day", "is", "sunny", "the", "the", "the", "sunny", "is", "is"},
-                4,
-                List.of("the", "is", "sunny", "day")
-            ),
-            Arguments.of(
-                new String[] {"bbb", "aaa", "bbb", "aaa", "ccc"},
-                2,
-                List.of("aaa", "bbb")
-            ),
-            Arguments.of(
-                new String[] {"one", "two", "three"},
-                10,
-                List.of("one", "three", "two")
-            ),
-            Arguments.of(new String[] {}, 3, List.of()),
-            Arguments.of(new String[] {"x", "x", "y"}, 0, List.of())
-        );
+        return Stream.of(Arguments.of(new String[] {"i", "love", "leetcode", "i", "love", "coding"}, 2, List.of("i", "love")), Arguments.of(new String[] {"the", "day", "is", "sunny", "the", "the", "the", "sunny", "is", "is"}, 4, List.of("the", "is", "sunny", "day")),
+            Arguments.of(new String[] {"bbb", "aaa", "bbb", "aaa", "ccc"}, 2, List.of("aaa", "bbb")), Arguments.of(new String[] {"one", "two", "three"}, 10, List.of("one", "three", "two")), Arguments.of(new String[] {}, 3, List.of()), Arguments.of(new String[] {"x", "x", "y"}, 0, List.of()));
     }
 
     @ParameterizedTest
@@ -51,10 +29,6 @@ void testFindTopKFrequentWordsInvalidInput(String[] words, int k) {
     }
 
     static Stream<Arguments> invalidTestCases() {
-        return Stream.of(
-            Arguments.of((String[]) null, 1),
-            Arguments.of(new String[] {"a", null, "b"}, 2),
-            Arguments.of(new String[] {"a"}, -1)
-        );
+        return Stream.of(Arguments.of((String[]) null, 1), Arguments.of(new String[] {"a", null, "b"}, 2), Arguments.of(new String[] {"a"}, -1));
     }
 }