feat(work): add Number of Islands solution

This commit is contained in:
Prad Nukala committed 2026-09-21 15:53:24 -04:00
1 parent 23eb71d387
commit 76c9c77307
2 files changed
+53 -1

No files matched your search

@@ -0,0 +1,52 @@
"""
200. Number of Islands
Difficulty: Medium
https://leetcode.com/problems/number-of-islands/
──────────────────────────────────────────────────
Given an m x n 2D binary grid grid which represents a map of '1's
(land) and '0's (water), return the number of islands.
An island is surrounded by water and is formed by connecting adjacent
lands horizontally or vertically. You may assume all four edges of the
grid are all surrounded by water.
Example 1:
Input: grid = [
["1","1","1","1","0"],
["1","1","0","1","0"],
["1","1","0","0","0"],
["0","0","0","0","0"]
]
Output: 1
Example 2:
Input: grid = [
["1","1","0","0","0"],
["1","1","0","0","0"],
["0","0","1","0","0"],
["0","0","0","1","1"]
]
Output: 3
Constraints:
• m == grid.length
• n == grid[i].length
• 1 <= m, n <= 300
• grid[i][j] is '0' or '1'.
"""
class Solution:
def numIslands(self, grid: List[List[str]]) -> int:
@@ -98,4 +98,4 @@ class WordDictionary:
# Your WordDictionary object will be instantiated and called as such:
# obj = WordDictionary()
# obj.addWord(word)
# param_2 = obj.search(word)
# param_3 = obj.search(word)