How to Solve Number of Islands From Blind 75 LeetCode Questions
About this episode
This story was originally published on HackerNoon at: https://hackernoon.com/how-to-solve-number-of-islands-from-blind-75-leetcode-questions.
We will learn how to solve "Number of Islands" from Blind 75 LeetCode Questions.
Check more stories related to programming at: https://hackernoon.com/c/programming.
You can also check exclusive content about #java, #data-structures, #leetcode, #algorithms, #dfs, #programming, #java-programming, #learn-programming, #hackernoon-es, and more.
This story was written by: @rakhmedovrs. Learn more about this writer by checking @rakhmedovrs's about page,
and for more stories, please visit hackernoon.com.
Given an m x n 2D binary 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 surrounded by water.
Get every episode summarized
Each time Programming Tech Brief By HackerNoon publishes, we email you a written briefing from the transcript — the topics, who appeared, and any specific claims, with the ad reads skipped.
Email me new episodesFree for 3 shows. No card needed.
Hosts & guests
No transcript yet
This episode has not been transcribed. Request it and it moves to the front of the queue.
More episodes
More from Programming Tech Brief By HackerNoon
Build a Tiny Grep Clone While Rust Teaches You Who Owns What
Programming Tech Brief By HackerNoon
Deterministic Routing: The Hidden Key to Low Latency
Programming Tech Brief By HackerNoon
The Classic Computer Vision Trick Behind Smooth Image Blending
Programming Tech Brief By HackerNoon
7 Essential IP Geolocation API Features Every Developer Needs
Programming Tech Brief By HackerNoon