Add daily 1765. Map of Highest Peak

Author: LuaanNguyen

README.md

@@ -30,8 +30,6 @@ go test ./easy/0001_two_sum
 
 |                                                              Leetcode ID                                                              | Title & Solution                                                                                                            | Coefficient Of Difficulty |                                             Remarks                                              |
 | :-----------------------------------------------------------------------------------------------------------------------------------: | :-------------------------------------------------------------------------------------------------------------------------- | :-----------------------: | :----------------------------------------------------------------------------------------------: |
-|                                      [0001](https://leetcode.com/problems/two-sum/description/)                                       | [Two Sum](/easy/0001_two_sum)                                                                                               |           Easy            |                                     _`HashTable`_ _`Array`_                                      |
-|                                   [0392](https://leetcode.com/problems/is-subsequence/description/)                                   | [Is Subsequence](/easy/0392_is_subsequence)                                                                                 |           Easy            |                                   _`Two Pointers`_ _`String`_                                    |
 |                          [3042](https://leetcode.com/problems/count-prefix-and-suffix-pairs-i/description/)                           | [Count Prefix and Suffix Pairs I](/easy/3042_count_prefix_and_sufix_pairs_I)                                                |           Easy            |                                       _`Array`_ _`String`_                                       |
 |                         [2185](https://leetcode.com/problems/counting-words-with-a-given-prefix/description/)                         | [Counting Words With a Given Prefix](/easy/2185_counting_words_with_a_given_string)                                         |           Easy            |                             _`Array`_ _`String`_ _`String Matching`_                             |
 |       [1400](https://leetcode.com/problems/construct-k-palindrome-strings/description/?envType=daily-question&envId=2025-01-11)       | [Construct K Palindrome Strings](/medium/1400_construct_k_palindrome_strings)                                               |          Medium           |                         _`HashTable`_ _`String`_ _`Greedy`_ _`Counting`_                         |
@@ -45,6 +43,7 @@ go test ./easy/0001_two_sum
 |                 [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`_                                     |
+|            [1765](https://leetcode.com/problems/map-of-highest-peak/description/?envType=daily-question&envId=2025-01-22)             | [Map of Highest Peak](/medium/1765_map_of_highest_peak)                                                                     |          medium           |                                _`Graph`_ _`Breadth-First Search`_                                |
 
 ## License 🪪
 

medium/1765_map_of_highest_peak/1765_map_of_highest_peak.go

@@ -0,0 +1,47 @@
+package map_of_highest_peak
+
+func highestPeak(isWater [][]int) [][]int {
+    rows := len(isWater)
+    cols := len(isWater[0])
+    directions := [][2]int{
+        {1, 0}, {-1, 0}, {0, 1}, {0, -1},
+    }
+
+    // Initialize result grid with -1 for land and 0 for water
+    res := make([][]int, rows)
+    for i := range res {
+        res[i] = make([]int, cols)
+        for j := range res[i] {
+            res[i][j] = -1
+        }
+    }
+
+    // Initialize queue for BFS
+    type point struct{ r, c int }
+    q := []point{}
+
+    // Add all water cells to the queue and mark them as height 0
+    for r := 0; r < rows; r++ {
+        for c := 0; c < cols; c++ {
+            if isWater[r][c] == 1 {
+                res[r][c] = 0
+                q = append(q, point{r, c})
+            }
+        }
+    }
+
+    // Perform BFS
+    for len(q) > 0 {
+        curr := q[0]
+        q = q[1:]
+        for _, dir := range directions {
+            nr, nc := curr.r+dir[0], curr.c+dir[1]
+            if nr >= 0 && nr < rows && nc >= 0 && nc < cols && res[nr][nc] == -1 {
+                res[nr][nc] = res[curr.r][curr.c] + 1
+                q = append(q, point{nr, nc})
+            }
+        }
+    }
+
+    return res
+}

medium/1765_map_of_highest_peak/1765_map_of_highest_peak_test.go

@@ -0,0 +1,64 @@
+package map_of_highest_peak
+
+import (
+	"testing"
+)
+
+func TestHighestPeek(t *testing.T) {
+	tests := []struct {
+		name	string 
+		isWater 	[][]int
+		expectedResult 	[][]int
+	} {
+		{
+			name: "Test Case 1",
+			isWater: [][]int {
+				{0,1},
+				{0,0},
+			},
+			expectedResult: [][]int {
+				{1,0},
+				{2,1},
+			},
+		},
+		{
+			name: "Test Case 2",
+			isWater: [][]int {
+				{0,0,1},
+				{1,0,0},
+				{0,0,0},
+			},
+			expectedResult: [][]int {
+				{1,1,0},
+				{0,1,1},
+				{1,2,2},
+			},
+		},
+	}
+
+	for _, test := range tests {
+		t.Run(test.name, func(t *testing.T) {
+			got := highestPeak(test.isWater)
+			if !equal2DSlices(got, test.expectedResult) {
+				t.Errorf("highestPeek(%v) = %v; want = %v", test.isWater, got ,test.expectedResult)
+			}
+		})
+	}
+}
+
+func equal2DSlices(a, b [][]int) bool {
+	if len(a) != len(b) {
+		return false
+	}
+	for i := range a {
+		if len(a[i]) != len(b[i]) {
+			return false
+		}
+		for j := range a[i] {
+			if a[i][j] != b[i][j] {
+				return false
+			}
+		}
+	}
+	return true
+}