Rename Challange (#133)

Author: igorwojda

README.md

@@ -76,7 +76,7 @@ multiple times and be persistent over time.
 - [Is tolerant palindrome](src/test/kotlin/com/igorwojda/string/ispalindrome/tolerant)
 - [Is permutation palindrome](src/test/kotlin/com/igorwojda/string/ispalindrome/permutation)
 - [Is anagram](src/test/kotlin/com/igorwojda/string/isanagram)
-- [Max occurring char](src/test/kotlin/com/igorwojda/string/maxchar)
+- [Max occurring char](src/test/kotlin/com/igorwojda/string/maxoccurringchar)
 - [String reverse](src/test/kotlin/com/igorwojda/string/reverse)
 - [Find the vowels](src/test/kotlin/com/igorwojda/string/vowels)
 - [Int reverse](src/test/kotlin/com/igorwojda/integer/reverse)

misc/ChallengeGroups.md

@@ -53,7 +53,7 @@ complexity from `O(n^2)` to `O(n)`.
 - [Is anagram](../src/test/kotlin/com/igorwojda/string/isanagram/README.md)
 - [Square equals](../src/test/kotlin/com/igorwojda/list/squareequal/README.md)
 - [Digit frequency](../src/test/kotlin/com/igorwojda/integer/digitfrequency/README.md)
-- [Max occurring char](../src/test/kotlin/com/igorwojda/string/maxchar/README.md)
+- [Max occurring char](../src/test/kotlin/com/igorwojda/string/maxoccurringchar/README.md)
 - [Get duplicated arguments](../src/test/kotlin/com/igorwojda/string/getduplicatedarguments/README.md)
 - [Subtract](../src/test/kotlin/com/igorwojda/list/subtract/README.md)
 - [Has repeated char](../src/test/kotlin/com/igorwojda/string/hasrepeatedcharacter/README.md)
@@ -144,7 +144,7 @@ We use sliding window instead of nested loops which decreases complexity from `O
 - [Is permutation palindrome](../src/test/kotlin/com/igorwojda/string/ispalindrome/permutation/README.md)
 - [Is substring](../src/test/kotlin/com/igorwojda/string/issubstring/README.md)
 - [Longest word](../src/test/kotlin/com/igorwojda/string/longestword/README.md)
-- [Max occurrent char](../src/test/kotlin/com/igorwojda/string/maxchar/README.md)
+- [Max occurring char](../src/test/kotlin/com/igorwojda/string/maxoccurringchar/README.md)
 - [Reverse string](../src/test/kotlin/com/igorwojda/string/reverse/README.md)
 - [Surrounded letter](../src/test/kotlin/com/igorwojda/string/surroundedletter/README.md)
 - [Find the vowels](../src/test/kotlin/com/igorwojda/string/vowels/README.md)

src/test/kotlin/com/igorwojda/list/subtract/README.md

@@ -5,7 +5,7 @@
 - [Is anagram](../../string/isanagram/README.md)
 - [Square equals](../squareequal/README.md)
 - [Digit frequency](../../integer/digitfrequency/README.md)
-- [Max occurring char](../../string/maxchar/README.md)
+- [Max occurring char](../../string/maxoccurringchar/README.md)
 - [Get duplicated arguments](../../string/getduplicatedarguments/README.md)
 
 ## Instructions

src/test/kotlin/com/igorwojda/string/maxchar/Challenge.kt renamed to src/test/kotlin/com/igorwojda/string/maxoccurringchar/Challenge.kt

@@ -1,30 +1,30 @@
-package com.igorwojda.string.maxchar
+package com.igorwojda.string.maxoccurringchar
 
 import org.amshove.kluent.shouldBeEqualTo
 import org.junit.jupiter.api.Test
 
-private fun maxOccurrentChar(str: String): Char? {
+private fun maxOccurringChar(str: String): Char? {
     TODO("Add your solution here")
 }
 
 private class Test {
     @Test
     fun `Don't find a char in empty string`() {
-        maxOccurrentChar("") shouldBeEqualTo null
+        maxOccurringChar("") shouldBeEqualTo null
     }
 
     @Test
     fun `Finds char 'a' in string 'a'`() {
-        maxOccurrentChar("a") shouldBeEqualTo 'a'
+        maxOccurringChar("a") shouldBeEqualTo 'a'
     }
 
     @Test
     fun `Finds char 'a' in string 'abcdefghijklmnaaaaa'`() {
-        maxOccurrentChar("abcdefghijklmnaaaaa") shouldBeEqualTo 'a'
+        maxOccurringChar("abcdefghijklmnaaaaa") shouldBeEqualTo 'a'
     }
 
     @Test
     fun `Finds char '1' in string 'ab1c1d1e1f1g1'`() {
-        maxOccurrentChar("ab1c1d1e1f1g1") shouldBeEqualTo '1'
+        maxOccurringChar("ab1c1d1e1f1g1") shouldBeEqualTo '1'
     }
 }

src/test/kotlin/com/igorwojda/string/maxchar/README.md renamed to src/test/kotlin/com/igorwojda/string/maxoccurringchar/README.md

@@ -1,4 +1,4 @@
-# Max occurrent char
+# Max occurring char
 
 ## Instructions
 
@@ -9,9 +9,9 @@ Given a string implement a function which returns the character that is most com
 ## Examples
 
 ```kotlin
-maxChar("abcccccccd") // "c"
+maxOccurringChar("abcccccccd") // "c"
 
-maxChar("apple 1231111") // "1"
+maxOccurringChar("apple 1231111") // "1"
 ```
 
 ## Hints

src/test/kotlin/com/igorwojda/string/maxchar/Solution.kt renamed to src/test/kotlin/com/igorwojda/string/maxoccurringchar/Solution.kt

@@ -1,8 +1,8 @@
-package com.igorwojda.string.maxchar
+package com.igorwojda.string.maxoccurringchar
 
 // Kotlin idiomatic solution
 private object Solution1 {
-    private fun maxOccurrentChar(str: String): Char? {
+    private fun maxOccurringChar(str: String): Char? {
         if (str.isBlank()) return null
 
         return str.toCharArray()
@@ -14,7 +14,7 @@ private object Solution1 {
 
 // Kotlin idiomatic solution
 private object Solution2 {
-    private fun maxOccurrentChar(str: String): Char? {
+    private fun maxOccurringChar(str: String): Char? {
         if (str.isBlank()) return null
 
         return str.toList()
@@ -26,7 +26,7 @@ private object Solution2 {
 }
 
 private object Solution3 {
-    private fun maxOccurrentChar(str: String): Char? {
+    private fun maxOccurringChar(str: String): Char? {
         if (str.isBlank()) return null
 
         val map = mutableMapOf<Char, Int>()
@@ -42,7 +42,7 @@ private object Solution3 {
 // Recursive naive approach
 // Time complexity: O(n^2)
 private object Solution4 {
-    private fun maxOccurrentChar(str: String): Char? {
+    private fun maxOccurringChar(str: String): Char? {
         if (str.length == 1) {
             return str.first()
         }