Skip to content

takeUforward

~ Strive for Excellence

  • Striver’s SDE Sheet
  • SDE Core Sheet
  • Interview Experience
  • Data Structure
  • Advertise with us
  • Join takeUforward

Category: Graph

December 31, 2021 Data Structure / Graph

Topological Sort Using DFS

Problem Statement: Given a DAG( Directed Acyclic Graph ), print all the vertex of the graph in a topologically sorted

Continue reading
December 30, 2021 Data Structure / Graph

Dijkstra’s Algorithm – Shortest distance

Problem Statement: Given a weighted, undirected, and connected graph of V vertices and E edges, Find the shortest distance of all

Continue reading
December 30, 2021 Data Structure / Graph

Bellman-Ford Algorithm – Shortest Distance with Negative Edge

Problem Statement: Given a weighted directed graph with negative edge weights with n nodes and m edges. Nodes are labeled from

Continue reading
December 30, 2021 Data Structure / Graph

Minimum Spanning Tree – MST using Prim’s Algo

Problem Statement: Given a weighted, undirected, and connected graph of V vertices and E edges. The task is to find the

Continue reading
December 30, 2021 Data Structure / Graph

Minimum Spanning Tree – MST using Kruskal’s Algo

Problem Statement: Given a weighted, undirected, and connected graph of V vertices and E edges. The task is to find

Continue reading
December 30, 2021 Data Structure / Graph

Bipartite Check using DFS – If Graph is Bipartite

Problem Statement: Given is a 2D adjacency list representation of a graph. Check whether the graph is Bipartite graph. (Note:

Continue reading
December 30, 2021 Data Structure / Graph

Kosaraju’s Algorithm for Strongly Connected Components(SCC)

Problem Statement: Given a Directed Graph with V vertices (Numbered from 0 to V-1) and E edges, Find the number

Continue reading
December 28, 2021 Data Structure / Graph

Topological Sort (BFS)

Problem statement: Given a graph, find the topological order for the given graph. Topological sort: The linear ordering of nodes/vertices

Continue reading
December 21, 2021 Data Structure / Graph

Detect a cycle in Undirected Graph : Breadth-First Search

Problem Statement: Given an undirected Graph, check for a cycle using BFS (Breadth-First Search) Traversal. Example: Input: Output: Yes Explanation:

Continue reading
December 20, 2021 Data Structure / Graph

Depth First Search (DFS) traversal : Graph

Problem Statement: Given a graph, traverse through all the nodes in the graph using Depth First Search. Example: Input: Output:

Continue reading

Posts navigation

1 2 Next Posts»

Subscribe

I want to receive latest posts and interview tips
Loading

Recent Posts

  • Input, Output, and Import in Python
  • Python Operators
  • Python Data Types
  • Type Conversion in Python
  • BuildHeap(), DecreaseKey(), and Delete() in Binary Heap

Accolite Digital Amazon Arcesium Bank of America Barclays BFS Binary Search Binary Search Tree Commvault CPP DE Shaw DFS DSA Self Paced google HackerEarth infosys inorder Java Juspay Kreeti Technologies Morgan Stanley Newfold Digital Oracle post order pre-order queue recursion Samsung SDE Core Sheet SDE Sheet Searching set-bits sorting sub-array subarray Swiggy takeuforward TCQ NINJA TCS TCS CODEVITA TCS DIGITA; TCS Ninja TCS NQT VMware XOR

Copyright © 2022 takeuforward | All rights reserved