- 205
- 1 205 424
Coding Cart
India
เข้าร่วมเมื่อ 12 ต.ค. 2019
CodingCart is focused on coding and programming. Our youtube channel for learning online where students and professionals can learn new skills in an easy way, explained by industry experts. The channel features hundreds of tutorials which will help students and professionals to achieve their goals.
We help learners engage in courses across software engineering, technology, and more, helping them get closer to achieving their professional goals. We will cover topics like Algorithm, data structure, Programming With Python, C, Java, NodeJS, etc. We will help to understand coding concepts for problem-solving in Python, C, and other languages too. We will also help to prepare for interviews and competitive programming.
#keeplearning
We add lots of videos weekly, Please subscribe to follow:th-cam.com/channels/j98X_6ZxT9Xcx7NO0ECXZw.html
For more information visit us at - www.coderscart.com
Contact us at:- jaiswalsatya93@gmail.com | +91-7278222619
We help learners engage in courses across software engineering, technology, and more, helping them get closer to achieving their professional goals. We will cover topics like Algorithm, data structure, Programming With Python, C, Java, NodeJS, etc. We will help to understand coding concepts for problem-solving in Python, C, and other languages too. We will also help to prepare for interviews and competitive programming.
#keeplearning
We add lots of videos weekly, Please subscribe to follow:th-cam.com/channels/j98X_6ZxT9Xcx7NO0ECXZw.html
For more information visit us at - www.coderscart.com
Contact us at:- jaiswalsatya93@gmail.com | +91-7278222619
Find if Path Exists in Graph | LeetCode | Python | Graph Data Structure
In this video, I have explained a LeetCode problem " Find if Path Exists in Graph"
*How to build a graph from given list of edges
*How to take care of visited nodes
Problem Link: leetcode.com/problems/find-if-path-exists-in-graph/
For 1: 1 Tutoring
WhatsApp contact: 7278222619
mail: jaiswalsatya93@gmail.com
You can support via UPI: sattujaiswal@okhdfcbank
Follow us on:
Whatsapp:
chat.whatsapp.com/LNwHGukUizjJPAxK7ma8gs
Telegram:
t.me/joinchat/QJvaJ97Xuut6i_Zm
Facebook:
codingcart/
Linkedin:
www.linkedin.com/in/satyendra-jaiswal-903588a2/
Instagram:
codingcart
#graph #datastructures #python
#graphdatastructure
#algorithmtutorial
#computerscience
#graphtheory
#DFSAlgorithm
#BFSAlgorithm
#dijkstrasalgorithm
#kruskalsalgorithm
#primsalgorithm
#topologicalsort
#connectedcomponents
#adjacencymatrix
#adjacencylist
#directedgraph
#undirectedgraph
#weightedgraph
#shortestpathalgorithm
#cycledetection
#graphtraversal
#programmingtutorialsgraph data structure using pythonhas path problemhas path or not problemDFS traversal in graphhas path leetcodegraph leetcode using pythonfind if path exists in graph leetcode using pythonfind if path exists in graph python solution1971. find if path exists in graphundirected graphBFS traversal in graphgraph using python
*How to build a graph from given list of edges
*How to take care of visited nodes
Problem Link: leetcode.com/problems/find-if-path-exists-in-graph/
For 1: 1 Tutoring
WhatsApp contact: 7278222619
mail: jaiswalsatya93@gmail.com
You can support via UPI: sattujaiswal@okhdfcbank
Follow us on:
Whatsapp:
chat.whatsapp.com/LNwHGukUizjJPAxK7ma8gs
Telegram:
t.me/joinchat/QJvaJ97Xuut6i_Zm
Facebook:
codingcart/
Linkedin:
www.linkedin.com/in/satyendra-jaiswal-903588a2/
Instagram:
codingcart
#graph #datastructures #python
#graphdatastructure
#algorithmtutorial
#computerscience
#graphtheory
#DFSAlgorithm
#BFSAlgorithm
#dijkstrasalgorithm
#kruskalsalgorithm
#primsalgorithm
#topologicalsort
#connectedcomponents
#adjacencymatrix
#adjacencylist
#directedgraph
#undirectedgraph
#weightedgraph
#shortestpathalgorithm
#cycledetection
#graphtraversal
#programmingtutorialsgraph data structure using pythonhas path problemhas path or not problemDFS traversal in graphhas path leetcodegraph leetcode using pythonfind if path exists in graph leetcode using pythonfind if path exists in graph python solution1971. find if path exists in graphundirected graphBFS traversal in graphgraph using python
มุมมอง: 356
วีดีโอ
Has Path or Not | Directed Graph | DFS Method | Python
มุมมอง 1929 หลายเดือนก่อน
In this video, I have explained how to solve the "Has Path or Not" problem for a directed graph using the BFS approach. For 1: 1 Tutoring WhatsApp contact: 7278222619 mail: jaiswalsatya93@gmail.com You can support via UPI: sattujaiswal@okhdfcbank Follow us on: Whatsapp: chat.whatsapp.com/LNwHGukUizjJPAxK7ma8gs Telegram: t.me/joinchat/QJvaJ97Xuut6i_Zm Facebook: codingcart/ Linkedin:...
Has Path or Not | Directed Graph | DFS Method | Python | has has path problem
มุมมอง 2809 หลายเดือนก่อน
In this video, I have explained how to solve the "Has Path or Not" problem for a directed graph using the DFS approach. For 1: 1 Tutoring WhatsApp contact: 7278222619 mail: jaiswalsatya93@gmail.com You can support via UPI: sattujaiswal@okhdfcbank Follow us on: Whatsapp: chat.whatsapp.com/LNwHGukUizjJPAxK7ma8gs Telegram: t.me/joinchat/QJvaJ97Xuut6i_Zm Facebook: codingcart/ Linkedin:...
Graph Traversal | BFS | Iterative Method | Python
มุมมอง 585ปีที่แล้ว
This video is about graph traversal using BFS, the iterative method in Python. For 1: 1 Tutoring WhatsApp contact: 7278222619 mail: jaiswalsatya93@gmail.com You can support via UPI: sattujaiswal@okhdfcbank Follow us on: Whatsapp: chat.whatsapp.com/LNwHGukUizjJPAxK7ma8gs Telegram: t.me/joinchat/QJvaJ97Xuut6i_Zm Facebook: codingcart/ Linkedin: www.linkedin.com/in/satyendra-jaiswal-90...
Graph Traversal | DFS | Recursion Method | Python
มุมมอง 571ปีที่แล้ว
This video is about graph traversal using DFS, the Recursive method in Python. For 1: 1 Tutoring WhatsApp contact: 7278222619 mail: jaiswalsatya93@gmail.com You can support via UPI: sattujaiswal@okhdfcbank Follow us on: Whatsapp: chat.whatsapp.com/LNwHGukUizjJPAxK7ma8gs Telegram: t.me/joinchat/QJvaJ97Xuut6i_Zm Facebook: codingcart/ Linkedin: www.linkedin.com/in/satyendra-jaiswal-90...
Graph Traversal | DFS | Iterative Method | Python
มุมมอง 757ปีที่แล้ว
This video is about graph traversal using DFS, the iterative method in Python. For 1: 1 Tutoring WhatsApp contact: 7278222619 mail: jaiswalsatya93@gmail.com You can support via UPI: sattujaiswal@okhdfcbank Follow us on: Whatsapp: chat.whatsapp.com/LNwHGukUizjJPAxK7ma8gs Telegram: t.me/joinchat/QJvaJ97Xuut6i_Zm Facebook: codingcart/ Linkedin: www.linkedin.com/in/satyendra-jaiswal-90...
Graph Data Structure using Python | Part 2
มุมมอง 600ปีที่แล้ว
This video is about graph data structure using Python where I have explained how to take the edges values from the user and then build the graph using a dictionary. For 1: 1 Tutoring WhatsApp contact: 7278222619 mail: jaiswalsatya93@gmail.com You can support via UPI: sattujaiswal@okhdfcbank Follow us on: Whatsapp: chat.whatsapp.com/LNwHGukUizjJPAxK7ma8gs Telegram: t.me/joinchat/QJvaJ97Xuut6i_Zm...
Graph Data Structure using Python | Part 1
มุมมอง 2Kปีที่แล้ว
This video is about graph data structure using Python where I have explained how to build the graph using a dictionary when the edges value are given. Types of Graph: www.educba.com/types-of-graph-in-data-structure/ For 1: 1 Tutoring WhatsApp contact: 7278222619 mail: jaiswalsatya93@gmail.com You can support via UPI: sattujaiswal@okhdfcbank Follow us on: Whatsapp: chat.whatsapp.com/LNwHGukUizjJ...
Digital Clock using Python #shorts #python #pythonprogramming
มุมมอง 264ปีที่แล้ว
Digital Clock using Python #shorts #python #pythonprogramming
Palindrome Linked List | LeetCode | Data Structure | Python | Programming
มุมมอง 342ปีที่แล้ว
This video is about the problem "Palindrome Linked List" from LeetCode. Problem:leetcode.com/problems/palindrome-linked-list/ Reverse Linked List :th-cam.com/video/S5UByEqe8aM/w-d-xo.html Follow us on: Whatsapp: chat.whatsapp.com/LNwHGukUizjJPAxK7ma8gs Telegram: t.me/joinchat/QJvaJ97Xuut6i_Zm For 1 : 1 Tutoring WhatsApp contact : 7278222619 mail: jaiswalsatya93@gmail.com You can support via UPI...
Palindrome Linked List | LeetCode | Data Structure | Python | Programming
มุมมอง 3012 ปีที่แล้ว
This video is about the problem "Palindrome Linked List" from LeetCode. Problem:leetcode.com/problems/palindrome-linked-list/ Reverse Linked List :th-cam.com/video/S5UByEqe8aM/w-d-xo.html Follow us on: Whatsapp: chat.whatsapp.com/LNwHGukUizjJPAxK7ma8gs Telegram: t.me/joinchat/QJvaJ97Xuut6i_Zm For 1 : 1 Tutoring WhatsApp contact : 7278222619 mail: jaiswalsatya93@gmail.com You can support via UPI...
Palindrome Linked List | LeetCode | Data Structure | Python | Programming
มุมมอง 2562 ปีที่แล้ว
This video is about the problem "Palindrome Linked List" from LeetCode. Problem:leetcode.com/problems/palindrome-linked-list/ Follow us on: Whatsapp: chat.whatsapp.com/LNwHGukUizjJPAxK7ma8gs Telegram: t.me/joinchat/QJvaJ97Xuut6i_Zm For 1 : 1 Tutoring WhatsApp contact : 7278222619 mail: jaiswalsatya93@gmail.com You can support via UPI : sattujaiswal@okhdfcbank Facebook: groups/77962...
Palindrome Linked List | LeetCode | Data Structure | Python | Programming
มุมมอง 3172 ปีที่แล้ว
This video is about the problem "Palindrome Linked List" from LeetCode. Problem:leetcode.com/problems/palindrome-linked-list/ Follow us on: Whatsapp: chat.whatsapp.com/LNwHGukUizjJPAxK7ma8gs Telegram: t.me/joinchat/QJvaJ97Xuut6i_Zm For 1 : 1 Tutoring WhatsApp contact : 7278222619 mail: jaiswalsatya93@gmail.com You can support via UPI : sattujaiswal@okhdfcbank Facebook: groups/77962...
Palindrome Linked List | LeetCode | Data Structure | Python | Programming
มุมมอง 7742 ปีที่แล้ว
This video is about the problem "Palindrome Linked List" from LeetCode. Problem:leetcode.com/problems/palindrome-linked-list/ Follow us on: Whatsapp: chat.whatsapp.com/LNwHGukUizjJPAxK7ma8gs Telegram: t.me/joinchat/QJvaJ97Xuut6i_Zm For 1 : 1 Tutoring WhatsApp contact : 7278222619 mail: jaiswalsatya93@gmail.com You can support via UPI : sattujaiswal@okhdfcbank Facebook: groups/77962...
Delete Middle Node | Linked List | LeetCode | Data Structure | Python
มุมมอง 9362 ปีที่แล้ว
Delete Middle Node | Linked List | LeetCode | Data Structure | Python
Delete Middle Node | Linked List | LeetCode | Data Structure | Python
มุมมอง 4732 ปีที่แล้ว
Delete Middle Node | Linked List | LeetCode | Data Structure | Python
Merge Nodes Between Zeros | LeetCode | LinkedList | Data Structure | Python
มุมมอง 9922 ปีที่แล้ว
Merge Nodes Between Zeros | LeetCode | LinkedList | Data Structure | Python
Binary to Integer | Linked List | Python | LeetCode | Data Structure | Programming
มุมมอง 4732 ปีที่แล้ว
Binary to Integer | Linked List | Python | LeetCode | Data Structure | Programming
Swap Nodes in Pairs | LeetCode | LinkedList | Programming | Coding | Data Structure
มุมมอง 2372 ปีที่แล้ว
Swap Nodes in Pairs | LeetCode | LinkedList | Programming | Coding | Data Structure
Next Greater Node | Linked List | Data Structure | Programming | Coding
มุมมอง 1.4K2 ปีที่แล้ว
Next Greater Node | Linked List | Data Structure | Programming | Coding
Reorder Node | LeetCode | LinkedList | Programming | Coding
มุมมอง 2102 ปีที่แล้ว
Reorder Node | LeetCode | LinkedList | Programming | Coding
Default Arguments | Debugging | Python | Hackerrank | Programming | Coding
มุมมอง 1.6K2 ปีที่แล้ว
Default Arguments | Debugging | Python | Hackerrank | Programming | Coding
Publicis Sapient Scam | Don't Join | Freshers | Interview | Programming | Coding
มุมมอง 8K2 ปีที่แล้ว
Publicis Sapient Scam | Don't Join | Freshers | Interview | Programming | Coding
Publicis Sapient Interview Experience | Freshers Scam | 2022 | Programming | Coding
มุมมอง 1.8K2 ปีที่แล้ว
Publicis Sapient Interview Experience | Freshers Scam | 2022 | Programming | Coding
Words Score | Debugging | Python | Hackerrank | Programming | Coding
มุมมอง 1.5K2 ปีที่แล้ว
Words Score | Debugging | Python | Hackerrank | Programming | Coding
combinations_with_replacement() | Hackerrank | Python | Itertools | Programming | Coding
มุมมอง 6372 ปีที่แล้ว
combinations_with_replacement() | Hackerrank | Python | Itertools | Programming | Coding
permutations() | Hackerrank | Python | itertools.permutations() | Programming | Coding
มุมมอง 1.9K2 ปีที่แล้ว
permutations() | Hackerrank | Python | itertools.permutations() | Programming | Coding
combinations() | Hackerrank | Python | itertools.combinations | Programming | Coding
มุมมอง 4K2 ปีที่แล้ว
combinations() | Hackerrank | Python | itertools.combinations | Programming | Coding
Recursion | Guess the Output: 5 | How recursion work | Direct & Indirect
มุมมอง 1992 ปีที่แล้ว
Recursion | Guess the Output: 5 | How recursion work | Direct & Indirect
Recursion | Guess the Output: 4 | How recursion work
มุมมอง 1562 ปีที่แล้ว
Recursion | Guess the Output: 4 | How recursion work
Super
Glad it helped😊. Please do share with your friends too😊
very good explanation
Glad it helped😊. Please do share with your friends too😊
if root is not None: why not use? if root:
Awesome explanation....🎉🎉
Glad it helped😊. Please do share with your friends too😊
If the value is 10 20 30 it is not working for 1st approach
Thank you soo muchhh sir😊
Glad it helped😊. Please do share with your friends too😊
great logic!
If you didn't get it in first time, watch it again I got to know this information after wasting my 1 week 😢
Hi buddy, any way you can upload photo now with automation? I can go until the create post but i cant upload to the text box. It keep uploading to the cover picture instead. Any way i can connect you or any platform we can discuss?
Why get n,m values??
Good and super explanation bro , all the best
Use set to remove duplicate values
Thank you for this. I just wanted to point out a few things which might make it easier for everyone: 1. Using a list to store the lowercase alphabet is not required; you can just use a string. 2. Related to #1, rather than use list(map(chr, range(97, 123))), you can just import string and use the built-in string.ascii_lowercase. alphabet = string.ascii_lowercase alphabet_subset = alphabet[size-1::-1] + alphabet[1:size] width = len("-".join(alphabet_subset)) for i in range(1, size): print("-".join(alphabet[size-1:size-i:-1] + alphabet[size-i:size]).center(width, "-")) for i in reversed(range(1, size + 1)): print("-".join(alphabet[size-1:size-i:-1] + alphabet[size-i:size]).center(width, "-"))
good bro keep posting more videos
Glad it helped😊. Please do share with your friends too😊
code is not working properly in python3. used pypy3 for this code if __name__ == '__main__': n = int(input()) integer_list =tuple( map(int, input().split())) print(hash(integer_list))
thanks
I think we can also use hashmap
Give a try 😎
very well explained! for people looking for a reference, here is the law at play: if p = (A mod k) and q = (B mod k) and (A+B) mod k = 0, then p+q is either 0 or k.
Tq it clear
Glad it helped😊. Please do share with your friends too😊
Excellent video thanku
Glad it helped😊. Please do share with your friends too😊
nice explanation👍
Glad it helped😊. Please do share with your friends too😊
Hello
thank you so much please solve insertion sort 1 problem available in hackerrank
probably you should use S1=S1+S.count(s[i:])
happiness=0 n,m=map(int,input().split()) array=list(map(int,input().split())) A=set(map(int,input().split())) B=set(map(int,input().split())) for i in array: if i in A: happiness+=1 elif i in B: happiness-=1 print(happiness)
i need the code to connect to the real device please
Tree playlist: completed✅ Graph playlist: completed✅ Thank you sir hope you will upload more DSA playlist using python
Currently busy in my office project, but will try to upload the videos.. And glad to hear that you liked the teaching style 😎
very good explination
Glad it helped😊. Please do share with your friends too😊
Sir plz start uploading this valuable videos.your videos is really helpful for me
Very well taught , visualisation is very important . Thanks a lot bro
Glad it helped😊. Please do share with your friends too😊
Sir itni jaldi khatam ho gi pata ni chala
Clear explanation ever. Keep making more such solutions
Great explanation ever even begineers understands easily👏
Under rated channel, you deserve more subs!
Sir please or bhi DSA se related playlist late rahiye full support h aapko❤
Glad you liked it😊. Please do share with your friends too😊
if suppose the cycle consists of duplicate values. This will not work right..
great mic🤣
Thank you
Glad it helped😊. Please do share with your friends too😊
Nice explanation!
your videos are so helpful, thanks for sharing....
Glad it helped😊. Please do share with your friends too😊
Here is the easiest to understand for me logic of all: //Additional impl comments below private static void minimumBribes(List<Integer> q) { int count = 0; //bribesCounter boolean flag = false; for(int i = q.size(); i>=1; i--){ if(q.get(i-1) != i) { //is the last element different than i (5) if((i-2)>=0 && q.get(i-2)==i){ //we have single bribe occurring //swap the values when we have single bribe int swap1 = q.get(i-1); //latest unordered element that is not in the correct position int swap2 = q.get(i-2); //the element next to the latest element also not in the correct position. q.set(i-1, swap2); q.set(i-2, swap1); //bribe counter; count++; } else if ((i-3) >= 0 && q.get(i-3) == i){ //double bribe //i-3 is equal to i and i-2 is not //e.g. 2 1 | 5 (i-3) 3 (i-2) 4 (i-1) //swap operations int swap1 = q.get(i-1); //4 int swap2 = q.get(i-2); //3 int swap3 = q.get(i-3); //5 q.set(i-1, swap3); // 5 q.set(i-2, swap1); // 4 q.set(i-3, swap2); // 3 //bribe counter count+=2; } else { //more than 2 consecutive bribes flag = true; break; } } } System.out.println(flag ? "Too chaotic" : count); }
Thank you so much. You saved my day. Great explanation and examples.
On what grounds we decide that we need to travel in both the directions? i.e. forward as well as backwards? Because for this scenario of {5,4,3,2,1} if we consider then only 9 candies needs to be distributed instead of 15. I am not getting this part! 5,4,3,2,1 (Kids) 1,1,1,1,1 (Initial value of candies) 2,1, (1st iteration) 2,2,1 2,2,2,1, 2,2,2,2,1
Don't have to worry for array out of bound in python? Like in first question loop was running from 0-len(s) and not 0 to len(s) -3
Great playlist, highly recommended!
Glad it helped😊. Please do share with your friends too😊