Shortest Distance After Road Addition Queries I | Easy Explanation | Leetcode 3243 |codestorywithMIK
287Whatsapp Community Link : https://www.whatsapp.com/channel/0029Va6kVSjICVfiVdsHgi1A
This is the 58th Video of our Playlist "Graphs : Popular Interview Problems" by codestorywithMIK
In this video we will try to solve a simple Graph problem : Shortest Distance After Road Addition Queries I | Using Already Studied Concepts | Leetcode 3243 | codestorywithMIK
I will explain the intuition so easily that you will never forget and start seeing this as cakewalk EASYYY.
We will do live coding after explanation and see if we are able to pass all the test cases.
Also, please note that my Github solution link below contains both C++ as well as JAVA code.
Problem Name : Shortest Distance After Road Addition Queries I | Using Already Studied Concepts | Leetcode 3243 | codestorywithMIK
Company Tags : will update later
My solutions on Github(C++ & JAVA) - https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Graph/Dijkstra'a Based Problems/Shortest Distance After Road Addition Queries I.cpp
Leetcode Link : https://leetcode.com/problems/shortest-distance-after-road-addition-queries-i
My DP Concepts Playlist : • Roadmap for DP | How to Start DP ? | ...
My Graph Concepts Playlist : • Graph Concepts & Qns - 1 : Graph will...
My Recursion Concepts Playlist : • Introduction | Recursion Concepts And...
My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Interview_DS_Algo
Instagram : https://www.instagram.com/codestorywithmik/
Facebook : https://www.facebook.com/people/codestorywithmik/100090524295846/
Twitter : https://twitter.com/CSwithMIK
Subscribe to my channel : / @codestorywithmik
╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝
Summary :
1. Breadth-First Search (BFS) (Approach 1):
Purpose: Finds the shortest path in an unweighted graph.
Technique: Explores nodes level by level, ensuring the first time a node is reached is via the shortest path.
Time Complexity: O(V+E), where V is the number of vertices and E is the number of edges.
Pros:
Simpler and faster for unweighted graphs.
Directly computes the shortest path in terms of the number of edges.
Cons:
Less flexible for handling graphs with weighted edges.
2. Dijkstra's Algorithm (Approach 2):
Purpose: Finds the shortest path in a weighted graph.
Technique: Utilizes a min-heap (priority queue) to explore nodes with the smallest known distances first.
Time Complexity: O(ElogV), where E is the number of edges and V is the number of vertices.
Pros:
Efficient for graphs with weighted edges.
Finds the shortest path with precision even when edges have different weights.
Cons:
Slightly more complex and may be overkill for unweighted graphs.
✨ Timelines✨
00:00 - Introduction
#MIK #mik #Mik
#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview#interviewtips #interviewpreparation #interview_ds_algo #hinglish #github #design #data #google #video #instagram #facebook #leetcode #computerscience #leetcodesolutions #leetcodequestionandanswers #code #learning #dsalgo #dsa #coding #programming #100daysofcode #developers #techjobs #datastructures #algorithms #webdevelopment #softwareengineering #computerscience #pythoncoding #codinglife #coderlife #javascript #datascience #leetcode #leetcodesolutions #leetcodedailychallenge #codinginterview #interviewprep #technicalinterview #interviewtips #interviewquestions #codingchallenges #interviewready #dsa #hindi #india #hindicoding #hindiprogramming #hindiexplanation #hindidevelopers #hinditech #hindilearning #helpajobseeker #jobseekers #jobsearchtips #careergoals #careerdevelopment #jobhunt #jobinterview #github #designthinking #learningtogether #growthmindset #digitalcontent #techcontent #socialmediagrowth #contentcreation #instagramreels #videomarketing #codestorywithmik #codestorywithmick #codestorywithmikc #codestorywitmik #codestorywthmik #codstorywithmik #codestorywihmik #codestorywithmiik #codeistorywithmik #codestorywithmk #codestorywitmick #codestorymik