General Problems
Proficiency in the practices of data structures and algorithms is essential for acing any coding test/interview. Many of the difficulties we face on a daily basis may be reduced to a graph problem or a closely related subproblem. As a result, considerable acquaintance with various graph modifications and their applications is necessary. Most of the problems based on graphs include the following general algorithms: 1. BFS 2. DFS 3. TOPOLOGICAL SORTING 4. MINIMUM SPANNING TREES (MST) 5. SHORTEST PATH ALGORITHMS 6. CYCLE DETECTION
Course Schedule
By Shreya Deep
● Published At Oct 2021
In this article, we’ll learn how to solve the problem named Course Schedule where we have to find the correct ordering of tasks using topological sorting. ... Keep reading ..
Topological sort without Kahn’s algorithm
By Malay Gain
● Published At Nov 2021
This article will discuss an alternative approach to Khan’s algorithm for topological sorting.... Keep reading ..
Clone a Directed Acyclic Graph
By Vibhor Bhatnagar
● Published At Dec 2021
This article will discuss the problem to clone a directed acyclic graph. ... Keep reading ..
Word Ladder
By GAZAL ARORA
● Published At Dec 2021
In this article, we will solve a programming problem: Given a dictionary of words, find the length of the shortest chain to reach a target word from a given start word. ... Keep reading ..
Minimum Cost Path in a directed graph via a given set of necessary nodes
By Apoorv
● Published At Feb 2022
This article will discuss finding a Minimum Cost Path in a directed graph via a given set of intermediate nodes. The blog also focuses on time and space complexity for the solution.... Keep reading ..
Stepping Numbers
By Aditya Narayan Joardar
● Published At Feb 2022
This article discusses finding stepping numbers in a given range using Brute Force and DFS.... Keep reading ..
Print all paths from a given source to a destination
By Aditya Narayan Joardar
● Published At Dec 2021
This article discusses printing all paths from a given source to a given vertex.... Keep reading ..
Accounts Merge
By Ishita Chawla
● Published At Nov 2021
In this blog, we will discuss the problem of Accounts Merge using Depth First Search and discuss its time and space complexity. ... Keep reading ..
Euler and Hamiltonian Paths
By Harsh Goyal
● Published At Nov 2021
This article will introduce Euler and Hamiltonian paths and discuss approaches to use them in different data structure problems. ... Keep reading ..
How to check if an array of strings can form a circle or not?
By Gorakhnath yadav
● Published At Oct 2021
In this blog, we learned about how to check if a given array of strings can form a circle or not. Read more to learn the detailed solution.... Keep reading ..
Beautiful Arrangement
By Harsh Goyal
● Published At Nov 2021
This article will discuss the Beautiful Arrangements problem and various ways to solve this problem, starting from the brute force approach to the efficient approach. ... Keep reading ..