add daily 2017. Grid Game

Author: LuaanNguyen

README.md

@@ -44,6 +44,7 @@ go test ./easy/0001_two_sum
 | [1368](https://leetcode.com/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid/?envType=daily-question&envId=2025-01-18) | [Minimum Cost to Make at Least One Valid Path in a Grid](/hard/1368_minimum_cost_to_make_at_least_one_valid_path_in_a_grid) |           Hard            | _`Breadth First Search`_ _`Graph`_ `Heap(Priority Queue)` _`Matrix`_ _`Shortest Path`_ _`Array`_ |
 |                 [407](https://leetcode.com/problems/trapping-rain-water-ii/?envType=daily-question&envId=2025-01-19)                  | [Trapping Rain Water II](/hard/1368_minimum_cost_to_make_at_least_one_valid_path_in_a_grid)                                 |           Hard            | _`Breadth First Search`_ _`Graph`_ `Heap(Priority Queue)` _`Matrix`_ _`Shortest Path`_ _`Array`_ |
 |   [2661](https://leetcode.com/problems/first-completely-painted-row-or-column/description/?envType=daily-question&envId=2025-01-20)   | [First Completely Painter Row or Column](/medium/2661_first_completely_painted_row_or_column)                               |          medium           |                                _`Matrix`_ _`HashTable`_ _`Array`_                                |
+|                                           [2017](https://leetcode.com/problems/grid-game/)                                            | [Grid Game](/medium/2017_grid_game)                                                                                         |          medium           |                                    _`Matrix`_ _`Prefix Sum`_                                     |
 
 ## License 🪪
 

medium/2017_grid_game/2017_grid_game.go

@@ -0,0 +1,35 @@
+package grid_game
+
+import "math"
+
+func gridGame(grid [][]int) int {
+    firstRowSum := 0
+    for _, value := range grid[0] {
+        firstRowSum += value
+    }
+
+    secondRowSum := 0
+    minimumSum := math.MaxInt
+
+    for turnIndex := 0; turnIndex < len(grid[0]); turnIndex++ {
+        firstRowSum -= grid[0][turnIndex]
+        minimumSum = min(minimumSum, max(firstRowSum, secondRowSum))
+        secondRowSum += grid[1][turnIndex]
+    }
+
+    return minimumSum
+}
+
+func min(a, b int) int {
+    if a < b {
+        return a
+    }
+    return b
+}
+
+func max(a, b int) int {
+    if a > b {
+        return a
+    }
+    return b
+}

medium/2017_grid_game/2017_grid_game_test.go

@@ -0,0 +1,5 @@
+package grid_game
+
+import "testing"
+
+