Poonam Pawarpoonam1607.hashnode.net·Dec 30, 2022Graph TraversalTraversing Let's imagine you have a puzzle🧩 with many pieces having arrows➡ on them that show you, where you can go next. To solve the puzzle, you have to visit every piece keeping in mind not to visit anyone twice. That's what ''Traversing'' the pu...Sakshi Singh and 1 other are discussing this2 people are discussing thisDiscuss·6 likes·61 readsBFS
Divyansh Sareendivyanshsareen.hashnode.net·Sep 11, 2022Ways to Traverse a MatrixIntroduction Matrix is defined as a group of similar or different data values arranged in rows and columns. In programming, matrices are represented as two-dimensional arrays. They are easily one of the most heavily used data structures in the field ...Discuss·4 likes·144 readsDSA
Aayush Shahaaaaayushh.hashnode.net·Dec 19, 2022Find If Path Exists in Graph Leetcode SolutionHello and welcome back to the daily session of crying while grinding Leetcode! Today we tackle a topic that makes most developers wish they'd chosen a different career: Graphs! Don't worry though, this is one of the simplest graph problems you're goi...Discuss·3 likes·59 readsLeetcode Daily Solutionsleetcode
UHforUH's bloguh.hashnode.net·Mar 15, 2023Leetcode 958 || Check Completeness of a Binary TreeProblem Link https://leetcode.com/problems/check-completeness-of-a-binary-tree/ Problem Description The root of a tree is given as input. We have to check if the given tree is a complete binary tree or not. What is a complete binary tree? We will und...DiscussDaily LeetCode Challenge
UHforUH's bloguh.hashnode.net·Mar 14, 2023Leetcode 129 || Sum Root to Leaf NumbersProblem Link https://leetcode.com/problems/sum-root-to-leaf-numbers/ Discussion As input, the root of a binary tree is given. What we need to do that, Explore all the paths from the root to the leaf Each root->leaf makes a number, need to take all ...DiscussDaily LeetCode Challenge
Vedant BandeforVedant's Blogbandeblogs.hashnode.net·Mar 10, 2023Distance of nearest cell having 1A medium graph traversal-based dsa question. Given a binary grid of n*m. Find the distance of the nearest 1 in the grid for each cell.The distance is calculated as |i1 - i2| + |j1 - j2|, where i1, j1 are the row number and column number of the curre...DiscussProgramming Blogs
Rohit Sawforrsaw409.hashnode.net·Mar 4, 2023MineSweeper in React.js using BFSIntroduction Have you ever heard of minesweeper? It is a little classic game that debuted back in 1990 as part of Windows Entertainment. The rules are simple. There is an N X N board in which some of the squares have bombs you have to find all Square...Discuss·27 readsReact
Poonam PawarforPoonam Pawar's blogpoonam1607.hashnode.net·Dec 30, 2022Graph TraversalTraversing Let's imagine you have a puzzle🧩 with many pieces having arrows➡ on them that show you, where you can go next. To solve the puzzle, you have to visit every piece keeping in mind not to visit anyone twice. That's what ''Traversing'' the pu...Sakshi Singh and 1 other are discussing this2 people are discussing thisDiscuss·6 likes·61 readsBFS
Aayush ShahforAayush's Blogaaaaayushh.hashnode.net·Dec 19, 2022Find If Path Exists in Graph Leetcode SolutionHello and welcome back to the daily session of crying while grinding Leetcode! Today we tackle a topic that makes most developers wish they'd chosen a different career: Graphs! Don't worry though, this is one of the simplest graph problems you're goi...Discuss·3 likes·59 readsLeetcode Daily Solutionsleetcode
Varchasv HoonforVarchasv Hoonvarchasvh.hashnode.net·Oct 7, 2022Breadth-First Search (BFS)Definition Breadth First Search is an algorithm for traversing and searching Trees or Graphs. It usually starts at the root node moving on to the next-level nodes and analyzing layer by layer. It must traverse the nodes at the same level first before...Discuss·38 readsBFS
Divyansh Sareenfordivyanshsareen.hashnode.net·Sep 11, 2022Ways to Traverse a MatrixIntroduction Matrix is defined as a group of similar or different data values arranged in rows and columns. In programming, matrices are represented as two-dimensional arrays. They are easily one of the most heavily used data structures in the field ...Discuss·4 likes·144 readsDSA
