{"type":"rich","version":"1.0","title":"Shortest Path in a Binary Matrix: 8-Direction BFS Without the Usual Bugs","author_name":"Linkjob AI","author_url":"https://plnkr.co/users/linkjobai_max","provider_name":"Plunker","provider_url":"https://plnkr.co","html":"<iframe id=\"plnkr_embed_pQ1QEETE9TtV9Jex\" class=\"plnkr_embed_iframe\" style=\"width: 100%; overflow: hidden;\" src=\"https://embed.plnkr.co/plunk/pQ1QEETE9TtV9Jex?autoCloseSidebar&deferRun&show=preview\" width=\"600\" height=\"400\" frameborder=\"0\" scrolling=\"no\"></iframe>","width":600,"height":400,"thumbnail_url":"https://shot.plnkr.co/pQ1QEETE9TtV9Jex.png?d=2026-11-03T03%3A30%3A55.877Z","thumbnail_width":400,"thumbnail_height":300}