feat: kata/treasure-hunt-with-clues (#727)

* docs: kata description

* docs: sync progress

* feat: kata/treasure-hunt-with-clues

---------

Co-authored-by: ParanoidUser <5120290+ParanoidUser@users.noreply.github.com>

Author: github-actions[bot]

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) |
 |:-----------------------------:|:-----------------------------:|:-----------------------------:|:-----------------------------:|:-----------------------------:|:-----------------------------:|:-----------------------------:|:-----------------------------:|:---------------------------:|:---------------------------------:|
-| 0 | 1 | 2 | 26 | 48 | 439 | 600 | 225 | 56 | 82 |
+| 0 | 1 | 2 | 26 | 48 | 439 | 601 | 225 | 56 | 82 |
 
 **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

@@ -582,6 +582,7 @@
 - [Thinking & Testing: A and B?](thinking-and-testing-a-and-b)
 - [Tidy Number (Special Numbers Series #9)](tidy-number-special-numbers-series-number-9)
 - [ToLeetSpeak](toleetspeak)
+- [Treasure Hunt with Clues](treasure-hunt-with-clues)
 - [Triangle area](triangle-area)
 - [Triangles from Dots](triangles-from-dots)
 - [Triangular Treasure](triangular-treasure)

kata/7-kyu/treasure-hunt-with-clues/README.md

@@ -0,0 +1,34 @@
+# [Treasure Hunt with Clues](https://www.codewars.com/kata/treasure-hunt-with-clues "https://www.codewars.com/kata/66c0fec80a2a28b2a451d408")
+
+Inputs:
+
+A `n × n` grid with `1 >= n >= 9`, and 2 integers `row, col` with `1 <= row, col <= n`, indicating the starting position of the treasure
+hunt.
+
+Clues:
+
+Every cell of the grid contains a number between `11` and <code>n<sup>2</sup></code>. These values provide the coordinates of the
+next cell to search. The treasure is found in a cell whose value matches its location. (The clue says "stay where you are"!) There will
+always be treasure reachable from the starting position.
+
+Output:
+
+The value in the treasure cell reached by following the clues from the starting position.
+
+Example:
+
+Consider the grid below, with starting position <code>row=3,col=4.</code>
+
+```
+34 21 32 44 25
+21 41 43 14 31
+31 45 52 42 23
+33 15 51 44 35
+21 52 33 13 44
+```
+
+Indexes start from 1, so the value in cell <code>3,4</code> is <code>42.</code> Thus the next clue is found in cell <code>4,2.</code> The
+value there is <code>15.</code> Seeking in cell <code>1,5</code> uncovers the clue <code>25,</code> and cell <code>2,5</code>
+contains <code>31.</code> Since the value in cell <code>3,1</code> is <code>31,</code> that is the location of the treasure.
+
+Source: This kata extends a problem found on [GitHub](https://github.com/HoanVanHuynh/Programming-Practice-Problems--treasure-hunts).

kata/7-kyu/treasure-hunt-with-clues/main/TreasureHunt.java

@@ -0,0 +1,10 @@
+interface TreasureHunt {
+  static int findTreasure(int[][] grid, int row, int col) {
+    int cell;
+    while ((cell = grid[row - 1][col - 1]) != 10 * row + col) {
+      row = cell / 10;
+      col = cell % 10;
+    }
+    return cell;
+  }
+}

kata/7-kyu/treasure-hunt-with-clues/test/TreasureHuntTest.java

@@ -0,0 +1,34 @@
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+import org.junit.jupiter.api.Test;
+
+class TreasureHuntTest {
+  @Test
+  void sample() {
+    assertEquals(11, TreasureHunt.findTreasure(new int[][]{{11}}, 1, 1));
+    assertEquals(21, TreasureHunt.findTreasure(new int[][]{{21, 21, 21}, {21, 21, 21}, {21, 21, 21}}, 2, 3));
+
+    int[][] allTheWay = {{12, 13, 14, 15, 21}, {22, 23, 24, 25, 31}, {32, 33, 34, 35, 41}, {42, 43, 44, 45, 51}, {52, 53, 54, 55, 55}};
+    assertEquals(55, TreasureHunt.findTreasure(allTheWay, 1, 1));
+
+    int[][] meandering = {{34, 24, 32, 41, 25}, {14, 12, 43, 44, 31}, {54, 45, 52, 34, 23}, {33, 15, 51, 53, 35}, {21, 55, 11, 13, 22}};
+    assertEquals(34, TreasureHunt.findTreasure(meandering, 1, 5));
+
+    int[][] grid5x5 = {{34, 21, 32, 44, 25}, {21, 41, 43, 14, 31}, {31, 45, 52, 42, 23}, {33, 15, 51, 44, 35}, {21, 52, 33, 13, 44}};
+    assertEquals(31, TreasureHunt.findTreasure(grid5x5, 3, 4));
+    assertEquals(21, TreasureHunt.findTreasure(grid5x5, 1, 2));
+
+    int[][] grid9x9 = {
+        {34, 21, 98, 14, 25, 29, 32, 18, 25},
+        {21, 12, 43, 34, 31, 12, 43, 34, 93},
+        {67, 45, 52, 42, 23, 45, 52, 42, 23},
+        {38, 76, 51, 53, 35, 15, 51, 53, 35},
+        {21, 15, 51, 53, 98, 15, 51, 53, 35},
+        {34, 18, 62, 41, 25, 24, 37, 41, 25},
+        {71, 12, 43, 34, 31, 29, 43, 34, 31},
+        {55, 45, 83, 42, 73, 45, 52, 42, 23},
+        {33, 15, 55, 53, 36, 15, 51, 98, 35}
+    };
+    assertEquals(98, TreasureHunt.findTreasure(grid9x9, 1, 1));
+  }
+}