Critical Connections in a network | Leetcode #1192 | Tarjans algorithm for bridge

Показать описание

This video explains a very important programming interview problem which is to find the critical connections in a network.This problem is from leetcode 1192.This problem is a popular problem which asks to find all the bridges in a graph.A bridge is an edge, removing which increases the number of components in a graph.Critical connection is same as a bridge.We can efficiently find bridges in a graph using Tarjans algorithm which i have already explained and the link for that will be present below.I have explained the problem statemment first and then showed its relation with bridge problem.I have shown the code at the end of the video.CODE LINK is present below as usual. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)

========================================================================
Please SUPPORT us /\ by JOINing our channel and also get access to perks:

=======================================================================

USEFUL LINKS:-

#bridge #tarjansalgorithm #graph

Рекомендации по теме

Комментарии

Recently got this question in Goldman Sachs test. Thanks for great explanation Sir :)

minakshikudalkar

I recently had a Amazon coding round pas two days.
It's the same question I got there.

bhaveshvaviya

I got the same question in Amazon OT on 23rd September. Wish I had watched this earlier!!!!

parteeksatija

if i got job i will applaud every video i see

rakeshreddyabbireddy

every cross edge of tarzan's algo should be a critical edge right?

amitavamozumder

Sir, If I'm using vector of vector to represent the adjacency list then it's giving TLE but if I'm using array of vector then it passed all the test cases successfully . Sir, Can u please tell me the reason why it's happening ??

nitishgoyal

please cover "Partition to K Equal Sum Subsets"...

tonystarc

Sir if u could explain this question . leet code (Super Washing Machines)

You have n super washing machines on a line. Initially, each washing machine has some dresses or is empty.

For each move, you could choose any m (1 ≤ m ≤ n) washing machines, and pass one dress of each washing machine to one of its adjacent washing machines at the same time .

Given an integer array representing the number of dresses in each washing machine from left to right on the line, you should find the minimum number of moves to make all the washing machines have the same number of dresses. If it is not possible to do it, return -1.

prashantbhalla

I am observing that you are covering graph topics in the recent videos, but the major focus in the interview is dp. I request you to post videos on dp problems also. Also, I have seen that most graph problems are related to dfs and bfs with alterations.

bharatkumar-beki

Critical Connections in a network | Leetcode #1192 | Tarjans algorithm for bridge

Critical Connections in a network | Leetcode #1192 | Tarjans algorithm for bridge

Leetcode - Critical Connections in a Network (Python)

G-55. Bridges in Graph - Using Tarjan's Algorithm of time in and low time

LeetCode 1192. Critical Connections in a Network

Critical Connections in a Network | LeetCode 1192 | Coders Camp

LeetCode 1192. Critical Connections in a Network

Critical Connections in a Network | Live Coding with Explanation | Leetcode - 1192

Critical Connections in a Network ( leetcode ) | Java solution | Tarjan's Algorithm

Coding Interview Problem - Critical Connections In Network

Critical Connections in a Network | Leetcode 1192 | Tarjan Algorithm 🔥🔥🔥 | Easy Peasy

Critical Connections In a Network | Tarjans Algorithm for Bridge Detection | Leetcode 1192

Amazon Coding Interview Question | Leetcode 1192 | Critical Connections in a Network

LeetCode 1192. Critical Connections in a Network Explanation and Solution

1192. Critical Connections in a Network - Day 18/31 Leetcode May Challenge

1192. Critical Connections in a Network

1192. Critical Connections in a Network - Day 24/30 Leetcode April Challenge

Hard Leetcode questions made easy : 1192. Critical Connections in a Network : using union find

Learn Trajan's to find Critical Connections in a network

Critical Connections in a Network, java implementation solution using Tarjan Algorithm

leetcode 1192 Critical Connections in a Network

[Leetcode] #1192 Critical Connections in a Network (Tarjan, DFS)

Bridge in a Graph | Critical Connections in a Network

LC 1192: Critical Connections in a Network

Critical connection || Graph theory