chore: sync-up catalog (#383)

- digit-star-digit => square-every-digit (7-kyu)
- subtract-the-sum => never-visit-a (8-kyu)
- n-th-power (8-kyu => retired)
- base-factorial-converter (beta => retired)
- vampire-numbers-2 (beta => retired)

Author: ParanoidUser

docs/README.md

@@ -25,7 +25,7 @@ slug.
 
 | [1 kyu](/kata/1-kyu/index.md) | [2 kyu](/kata/2-kyu/index.md) | [3 kyu](/kata/3-kyu/index.md) | [4 kyu](/kata/4-kyu/index.md) | [5 kyu](/kata/5-kyu/index.md) | [6 kyu](/kata/6-kyu/index.md) | [7 kyu](/kata/7-kyu/index.md) | [8 kyu](/kata/8-kyu/index.md) | [beta](/kata/beta/index.md) | [retired](/kata/retired/index.md) |
 |:-----------------------------:|:-----------------------------:|:-----------------------------:|:-----------------------------:|:-----------------------------:|:-----------------------------:|:-----------------------------:|:-----------------------------:|:---------------------------:|:---------------------------------:|
-|               -               |               1               |               2               |              18               |              36               |              410              |              545              |              201              |             59              |                73                 |
+|               -               |               1               |               2               |              18               |              36               |              410              |              545              |              200              |             57              |                76                 |
 
 **Note:** The source code is written in Java 17 and may use language features that are incompatible
 with Java 8, 11.

kata/7-kyu/index.md

@@ -127,7 +127,6 @@
 - [Dice Rotation](dice-rotation)
 - [Difference between two collections](difference-between-two-collections)
 - [Difference between years. (Level 1)](difference-between-years-level-1)
-- [Digit*Digit](digit-star-digit)
 - [Digits explosion](digits-explosion)
 - [Disagreeable ascii](disagreeable-ascii)
 - [Disarium Number (Special Numbers Series #3)](disarium-number-special-numbers-series-number-3)
@@ -468,6 +467,7 @@
 - [Split By Value](split-by-value)
 - [Split In Parts](split-in-parts)
 - [Spoonerize Me](spoonerize-me)
+- [Square Every Digit](square-every-digit)
 - [Square Pi's](square-pis)
 - [Stacked Balls - 2D](stacked-balls-2d)
 - [Stacked Balls - 3D (square base)](stacked-balls-3d-square-base)

kata/7-kyu/digit-star-digit/README.md kata/7-kyu/square-every-digit/README.mdkata/7-kyu/digit-star-digit/README.md renamed to kata/7-kyu/square-every-digit/README.md

@@ -1,11 +1,11 @@
-# [Digit*Digit](https://www.codewars.com/kata/digit-star-digit "https://www.codewars.com/kata/546e2562b03326a88e000020")
+# [Square Every Digit](https://www.codewars.com/kata/square-every-digit "https://www.codewars.com/kata/546e2562b03326a88e000020")
 
 Welcome. In this kata, you are asked to square every digit of a number and concatenate them.
 
-For example, if we run 9119 through the function, 811181 will come out, because 9<sup>2</sup> is 81
-and 1<sup>2</sup> is 1. (81-1-1-81)
+For example, if we run 9119 through the function, 811181 will come out, because 9<sup>2</sup> is 81 and 1<sup>2</sup> is
+1. (81-1-1-81)
 
-Example #2: An input of 765 will/should return 493625 because 7<sup>2</sup> is 49, 6<sup>2</sup> is
-36, and 5<sup>2</sup> is 25. (49-36-35)
+Example #2: An input of 765 will/should return 493625 because 7<sup>2</sup> is 49, 6<sup>2</sup> is 36, and 5<sup>
+2</sup> is 25. (49-36-25)
 
 **Note:** The function accepts an integer and returns an integer.

…u/digit-star-digit/main/SquareDigit.java …square-every-digit/main/SquareDigit.javakata/7-kyu/digit-star-digit/main/SquareDigit.java renamed to kata/7-kyu/square-every-digit/main/SquareDigit.java kata/7-kyu/digit-star-digit/main/SquareDigit.java renamed to kata/7-kyu/square-every-digit/main/SquareDigit.java

@@ -138,7 +138,7 @@
 - [Multiply](multiply)
 - [My head is at the wrong end!](my-head-is-at-the-wrong-end)
 # N
-- [N-th Power](n-th-power)
+- [Never visit a . . . !?](never-visit-a)
 - [No zeros for heroes](no-zeros-for-heros)
 # O
 - [OOP: Object Oriented Piracy](oop-object-oriented-piracy)
@@ -184,7 +184,6 @@
 - [String repeat](string-repeat)
 - [String Templates - Bug Fixing #5](string-templates-bug-fixing-number-5)
 - [Stringy Strings](stringy-strings)
-- [Subtract the Sum](subtract-the-sum)
 - [Sum Arrays](sum-arrays)
 - [Sum Mixed Array](sum-mixed-array)
 - [Sum of differences in array](sum-of-differences-in-array)

…git-star-digit/test/SquareDigitTest.java …re-every-digit/test/SquareDigitTest.javakata/7-kyu/digit-star-digit/test/SquareDigitTest.java renamed to kata/7-kyu/square-every-digit/test/SquareDigitTest.java kata/7-kyu/digit-star-digit/test/SquareDigitTest.java renamed to kata/7-kyu/square-every-digit/test/SquareDigitTest.java

@@ -1,30 +1,29 @@
-# [Subtract the Sum](https://www.codewars.com/kata/subtract-the-sum "https://www.codewars.com/kata/56c5847f27be2c3db20009c3")
+# [Never visit a . . . !?](https://www.codewars.com/kata/never-visit-a "https://www.codewars.com/kata/56c5847f27be2c3db20009c3")
 
-<span style="color:red">_NOTE! This kata can be more difficult than regular 8-kyu katas_</span>
+<span style="color:red">_NOTE! This kata can be more difficult than regular 8-kyu katas (lets say 7 or 6 kyu)_</span>
 
-Complete the function which get an input number `n` such that `n >= 10` and `n < 10000`, then:    
-1. Sum all the digits of `n`.    
-2. Subtract the sum from `n`, and it is your new `n`.    
-3. If the new `n` is in the list below return the associated fruit, otherwise return back to task 1.    
+Complete the function which get an input number `n` such that `n >= 10` and `n < 10000`, then:
+1. Sum all the digits of `n`.
+2. Subtract the sum from `n`, and it is your new `n`.
+3. If the new `n` is in the list below return the associated fruit, otherwise return back to task 1.
 
 ### Example
-n = 325   
-sum = 3+2+5 = 10   
-n = 325-10 = 315 (not in the list)    
-sum = 3+1+5 = 9    
-n = 315-9 = 306 (not in the list)   
-sum = 3+0+6 = 9   
-n =306-9 = 297 (not in the list)   
+
+n = `325`   
+sum = `3+2+5` = `10`   
+n = `325-10` = `315` (not in the list)    
+sum = `3+1+5` = `9`    
+n = `315-9` = `306` (not in the list)   
+sum = `3+0+6` = `9`   
+n =`306-9` = `297` (not in the list)   
 .   
 .   
 .   
 ...until you find the first n in the list below.
 
-
 There is no preloaded code to help you.
 _This is not about coding skills; think before you code_
 
-
 ```
 1-kiwi
 2-pear
@@ -126,5 +125,4 @@ _This is not about coding skills; think before you code_
 98-pineapple
 99-apple
 100-pineapple
-
 ```

kata/8-kyu/index.md

@@ -3,7 +3,6 @@
 # B
 - [Bad Collection?](bad-collection)
 - [BAD Hash - String to String](bad-hash-string-to-string)
-- [Base Factorial Converter](base-factorial-converter)
 - [Basic Arabic-To-Roman Numerals (1 to 999)](basic-arabic-to-roman-numerals-1-to-999)
 - [Beginner friendly: remove the letter o](beginner-friendly-remove-the-letter-o)
 - [Brackets Checker](brackets-checker)
@@ -65,7 +64,6 @@
 - [Tinder for Programmers](tinder-for-programmers)
 - [Tug-o'-War](tug-o-war)
 # V
-- [Vampire Numbers](vampire-numbers-2)
 - [Very Simple Inheritance for Beginners](very-simple-inheritance-for-beginners)
 # W
 - [Weton](weton)