Pradeep SuryavanshiStrongly Connected Components (Kosaraju’s Algo) — GeeksforGeeks SolutionGiven a Directed Graph with V vertices (Numbered from 0 to V-1) and E edges, Find the number of strongly connected components in the graph.May 15
Pradeep SuryavanshiShortest path in Undirected Graph — GeeksforGeeks SolutionYou are given an Undirected Graph having unit weight of the edges, find the shortest path from src to all the vertex and if it is…Aug 21Aug 21
Pradeep SuryavanshiGeeksforGeeks Toeplitz matrix Solution | Problem of the DayA Toeplitz (or diagonal-constant) matrix is a matrix in which each descending diagonal from left to right is constant, i.e., all elements…Jun 27Jun 27
Pradeep SuryavanshiConstruct Binary Tree from Parent Array GeeksforGeeks Solution | Problem of the DayGiven an array parent that is used to represent a tree. The array indices (0-based indexing) are the values of the tree nodes and parent[i]…Jul 17Jul 17
Pradeep SuryavanshiStrongly Connected Components (Kosaraju’s Algo) — GeeksforGeeks SolutionGiven a Directed Graph with V vertices (Numbered from 0 to V-1) and E edges, Find the number of strongly connected components in the graph.May 15
Pradeep SuryavanshiShortest path in Undirected Graph — GeeksforGeeks SolutionYou are given an Undirected Graph having unit weight of the edges, find the shortest path from src to all the vertex and if it is…Aug 21
Pradeep SuryavanshiGeeksforGeeks Toeplitz matrix Solution | Problem of the DayA Toeplitz (or diagonal-constant) matrix is a matrix in which each descending diagonal from left to right is constant, i.e., all elements…Jun 27
Pradeep SuryavanshiConstruct Binary Tree from Parent Array GeeksforGeeks Solution | Problem of the DayGiven an array parent that is used to represent a tree. The array indices (0-based indexing) are the values of the tree nodes and parent[i]…Jul 17
Pradeep SuryavanshiMinimize Max Distance to Gas Station — GeeksforGeeks SolutionWe have a horizontal number line. On that number line, we have gas stations at positions stations[0], stations[1], …, stations[N-1], where…May 221
Pradeep SuryavanshiPopulate Inorder Successor for all nodes GeeksforGeeks Solution | Problem of the DayGiven a Binary Tree, complete the function to populate the next pointer for all nodes. The next pointer for every node should point to the…Jul 6
Pradeep SuryavanshiYou and your books — GeeksforGeeks SolutionYou have n stacks of books. Each stack of books has some nonzero height arr[i] equal to the number of books on that stack ( considering…May 25
