add 3178

Author: fishercoder1534

Diff for: README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 | #    | Title                                                                                                                                                                                         | Solutions                                                                                                                                | Video                                                                         | Difficulty                       | Tag                                                                  
 |------|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|----------------------------------|----------------------------------------------------------------------
+| 3178 | [Find the Child Who Has the Ball After K Seconds](https://leetcode.com/problems/find-the-child-who-has-the-ball-after-k-seconds/)                                                                 | [Java](../master/src/main/java/com/fishercoder/solutions/_3178.java)                                                                     |                                                                               | Easy                             |
 | 3175 | [Find The First Player to win K Games in a Row](https://leetcode.com/problems/find-the-first-player-to-win-k-games-in-a-row/)                                                                 | [Java](../master/src/main/java/com/fishercoder/solutions/_3175.java)                                                                     |                                                                               | Medium                           |
 | 3174 | [Clear Digits](https://leetcode.com/problems/clear-digits/)                                                                                                                                   | [Java](../master/src/main/java/com/fishercoder/solutions/_3174.java)                                                                     |                                                                               | Easy                             |
 | 3164 | [Find the Number of Good Pairs II](https://leetcode.com/problems/find-the-number-of-good-pairs-ii/)                                                                                           | [Java](../master/src/main/java/com/fishercoder/solutions/_3164.java)                                                                     |                                                                               | Medium                           |
@@ -235,7 +236,7 @@ _If you like this project, please leave me a star._ ★
 | 1876 | [Substrings of Size Three with Distinct Characters](https://leetcode.com/problems/substrings-of-size-three-with-distinct-characters/)                                                         | [Solution](../master/src/main/java/com/fishercoder/solutions/_1876.java)                                                                 || Easy                                                                          | String                           |
 | 1874 | [Minimize Product Sum of Two Arrays](https://leetcode.com/problems/minimize-product-sum-of-two-arrays/)                                                                                       | [Solution](../master/src/main/java/com/fishercoder/solutions/_1874.java)                                                                 || Medium                                                                        | Array, Greedy, Sorting           |
 | 1869 | [Longer Contiguous Segments of Ones than Zeros](https://leetcode.com/problems/longer-contiguous-segments-of-ones-than-zeros/)                                                                 | [Solution](../master/src/main/java/com/fishercoder/solutions/_1869.java)                                                                 || Easy                                                                          | Array, Two Pointers              |
-| 1868 | [Product of Two Run-Length Encoded Arrays](https://leetcode.com/problems/product-of-two-run-length-encoded-arrays/)                                                                           | [Solution](../master/src/main/java/com/fishercoder/solutions/_1868.java)                                                                 || Medium                                                                        | Two Pointers                            |
+| 1868 | [Product of Two Run-Length Encoded Arrays](https://leetcode.com/problems/product-of-two-run-length-encoded-arrays/)                                                                           | [Solution](../master/src/main/java/com/fishercoder/solutions/_1868.java)                                                                 || Medium                                                                        | Two Pointers                     |
 | 1863 | [Sum of All Subset XOR Totals](https://leetcode.com/problems/sum-of-all-subset-xor-totals/)                                                                                                   | [Solution](../master/src/main/java/com/fishercoder/solutions/_1863.java)                                                                 || Easy                                                                          | Backtracking, Recursion          |
 | 1862 | [Sum of Floored Pairs](https://leetcode.com/problems/sum-of-floored-pairs/)                                                                                                                   | [Solution](../master/src/main/java/com/fishercoder/solutions/_1862.java)                                                                 || Hard                                                                          | Math                             |
 | 1861 | [Rotating the Box](https://leetcode.com/problems/rotating-the-box/)                                                                                                                           | [Solution](../master/src/main/java/com/fishercoder/solutions/_1861.java)                                                                 | [:tv:](https://youtu.be/2LRnTMOiqSI)                                          | Medium                           | Array, Two Pointers                                                  |

Diff for: src/main/java/com/fishercoder/solutions/_3178.java

@@ -0,0 +1,19 @@
+package com.fishercoder.solutions;
+
+public class _3178 {
+    public static class Solution1 {
+        public int numberOfChild(int n, int k) {
+            //decrement by 1 to make it easier to do math so it becomes o to n - 1
+            n--;
+            int roundTrips = k / n;
+            int remainingSteps = k % n;
+            if (roundTrips % 2 == 0) {
+                //this means it's forward direction
+                return remainingSteps;
+            } else {
+                //this means it's reverse direction
+                return n - remainingSteps;
+            }
+        }
+    }
+}

Diff for: src/test/java/com/fishercoder/_3178Test.java

@@ -0,0 +1,32 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._3178;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+public class _3178Test {
+    private static _3178.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _3178.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(1, solution1.numberOfChild(3, 5));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(2, solution1.numberOfChild(5, 6));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(2, solution1.numberOfChild(4, 2));
+    }
+
+}