This roadmap document has been shared by a google engineer with the objective of providing courses for aspiring candidates to make them ready for technical interviews.
This explains the basics of disjoint set data structure from scratch. I have explained all about disjoint set data structure in a simple and easy way to clear your basic understanding on the disjoint set data structure.I have taken intuitive Read full
Find the topological sort of a given graph. Here, i have explained how to find topological sort using Kahn’s algorithm.This algorithm is based on BFS (Breadth first search) and makes use of QUEUE and an Indegree ARRAY.Topological sort can also Read full
There are a total of n courses you have to take labelled from 0 to n – 1. Some courses may have prerequisites, for example, if prerequisites[i] = [ai, bi] this means you must take the course bi before the course ai. Given the total number of courses numCourses and a list of Read full
CLONE GRAPH is a very important and interesting programming interview problem which is to create a clone for the given graph.This is a typical recursion programming interview problem which can be solved using DFS/BFS.I have explained how to solve this Read full