{"type":"rich","version":"1.0","provider_name":"Transistor","provider_url":"https://transistor.fm","author_name":"Programming Tech Brief By HackerNoon","title":"How to Solve Number of Islands From Blind 75 LeetCode Questions","html":"<iframe width=\"100%\" height=\"180\" frameborder=\"no\" scrolling=\"no\" seamless src=\"https://share.transistor.fm/e/3badf5f5\"></iframe>","width":"100%","height":180,"duration":216,"description":"\n        This story was originally published on HackerNoon at: https://hackernoon.com/how-to-solve-number-of-islands-from-blind-75-leetcode-questions.\nWe will learn how to solve \"Number of Islands\" from Blind 75 LeetCode Questions.\nCheck more stories related to programming at: https://hackernoon.com/c/programming.\n            You can also check exclusive content about #java, #data-structures, #leetcode, #algorithms, #dfs, #programming, #java-programming, #learn-programming, #hackernoon-es,  and more.\nThis story was written by: @rakhmedovrs. Learn more about this writer by checking @rakhmedovrs's about page,\n            and for more stories, please visit hackernoon.com.\nGiven 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.","thumbnail_url":"https://img.transistorcdn.com/KhCapPSRkLGL2Xw8888yuChkNRWthaKapLYTvNdu4W4/rs:fill:0:0:1/w:400/h:400/q:60/mb:500000/aHR0cHM6Ly9pbWct/dXBsb2FkLXByb2R1/Y3Rpb24udHJhbnNp/c3Rvci5mbS9zaG93/LzQxMTY2LzE2ODM1/ODIzMzAtYXJ0d29y/ay5qcGc.webp","thumbnail_width":300,"thumbnail_height":300}