Traversals
Graph traversal means visiting each vertex and edge in order. We must also verify that each vertex of the graph is visited exactly once when using certain graph algorithms. The order in which these vertices are visited is crucial, and it may be determined by the algorithm or question you're working on It's critical to keep track of which vertices have been visited throughout a traversal. Marking vertices as marked is the most popular method of tracking them.
Rotting Oranges Problem
By Akshat Chaturvedi
● Published At Jan 2022
In this blog post, we’ll learn the rotting oranges problem and how to code it in C++ with brute force and a time-efficient approach. ... Keep reading ..
Check if the end of the Array can be reached from a given position.
By Urwashi Priya
● Published At Nov 2021
This article will brief you on the problem to Check if the end of the Array can be reached from a given position. ... Keep reading ..
Minimize Steps Required to Convert Number N to M.
By Soumya Agrawal
● Published At Jan 2022
This blog will cover the problem of finding the minimum steps required to convert the number N to M using arithmetic operators and discuss its Time and Space complexity.... Keep reading ..
Check if it is possible to reach the index with value K when the start index is given.
By Urwashi Priya
● Published At Nov 2021
This article will brief you on the problem to Check if it is possible to reach the index with value K when the start index is given. ... Keep reading ..
Check If Cells Numbered 1 to K In A Grid Can Be Connected After The Removal Of At most One Blocked Cell
By Rhythm Jain
● Published At Dec 2021
This article discusses the problem of checking If Cells Numbered 1 to K In A Grid Can Be Connected After the Removal Of At most One Blocked Cell.... Keep reading ..
Kahn's Algorithm
By Shubham Agarwal
● Published At Jan 2022
The blog covers Kahn’s Algorithm, which is a method to achieve Topological Sorting including finding indegree with multiple modes, the time and space complexity.... Keep reading ..