![Vivekanand Khyade - Algorithm Every Day](/img/default-banner.jpg)
- 202
- 10 399 847
Vivekanand Khyade - Algorithm Every Day
India
Registrace 20. 03. 2011
This channel covers all the problems on Data structures and Algorithms. You can comment any problems you are facing and I will provide you the solution. I have also covered Programs / code of respective algorithms..
Maximum difference between two elements in array
Find maximum difference between two elements in array. The case where larger element comes after smaller element is handled here.
zhlédnutí: 4 403
Video
What is Docker (container) ? Easiest explanation with interesting analogy #techdiscussion
zhlédnutí 1,2KPřed 11 měsíci
Docker is explained in detail in this video with interesting analogy.
We got Silver Button friends...!!!!
zhlédnutí 760Před 11 měsíci
Silver Button thanks video. Instagram: algorithm_every_day?igshid=ZGUzMzM3NWJiOQ
Ada Lovelace..story of First Computer Programmer #Inspire
zhlédnutí 319Před 11 měsíci
Ada Lovelace is the First Computer Programmer in the world.
WorldCoin Project, BingAI in Windows11, Fireflies storage, Threads DM #News1
zhlédnutí 300Před 11 měsíci
This is a technological news video in computer science.
Delete head node in Linked List #CodeWithMe#5
zhlédnutí 525Před 11 měsíci
Delete head node in Linked List Creation of Linked List :- czcams.com/video/zDhN6kWrelM/video.html Github Code Link :- github.com/vivekanand44/codes-CZcams-videos/blob/master/delete_head_node_of_LL.cpp
Insert node at the end of Linked List #CodeWithMe#4
zhlédnutí 667Před rokem
Insert node at the end of Linked List. This is an important problem in DSA computer science. Creation of Linked List :- czcams.com/video/zDhN6kWrelM/video.html Github Code Link :- github.com/vivekanand44/codes-CZcams-videos/blob/master/insert_a_node_at_end_in_Linked_List.cpp
Stock Span Problem ALGORITHM ( Simplest explanation on Internet )
zhlédnutí 836Před rokem
Stock Span Problem ALGORITHM
Steve Jobs hated the iPhone's idea at first ( was later convinced )
zhlédnutí 676Před rokem
Steve Jobs hated the iPhone's idea at first ( was later convinced )
Insert a Node in Linked List #CodeWithMe#3
zhlédnutí 6KPřed 3 lety
Insert a Node in Linked List #CodeWithMe#3
Insert a node at HEAD (beginning) in a Linked List #CodeWithMe#2
zhlédnutí 7KPřed 3 lety
Insert a node at HEAD (beginning) in a Linked List #CodeWithMe#2
Equilibrium Element in Array in o(n) time complexity ( Interview Question for FAANG companies)
zhlédnutí 8KPřed 3 lety
Equilibrium Element in Array in o(n) time complexity ( Interview Question for FAANG companies)
How to CODE to create BINARY SEARCH TREE (Implementation of BST using Linked List )
zhlédnutí 5KPřed 3 lety
How to CODE to create BINARY SEARCH TREE (Implementation of BST using Linked List )
Find Majority Element in an Array using Binary Search Tree O(n logn)
zhlédnutí 3,5KPřed 3 lety
Find Majority Element in an Array using Binary Search Tree O(n logn)
Get minimum element from stack with O(1) space complexity
zhlédnutí 6KPřed 3 lety
Get minimum element from stack with O(1) space complexity
Connected and Strongly Connected Components in a Graph #Graph Series #24
zhlédnutí 84KPřed 4 lety
Connected and Strongly Connected Components in a Graph #Graph Series #24
Merge two Binary Search Trees(BST) to form a Sorted Linked List
zhlédnutí 20KPřed 4 lety
Merge two Binary Search Trees(BST) to form a Sorted Linked List
k-cores of an undirected graph | degeneracy | Graph Theory
zhlédnutí 8KPřed 4 lety
k-cores of an undirected graph | degeneracy | Graph Theory
Bridges in Graph | Cut Edges | Graph Theory #21
zhlédnutí 34KPřed 5 lety
Bridges in Graph | Cut Edges | Graph Theory #21
Articulation Point in Graph Algorithm Detail | Graph Theory #20
zhlédnutí 19KPřed 5 lety
Articulation Point in Graph Algorithm Detail | Graph Theory #20
Complement of a Graph | Graph Theory #19
zhlédnutí 19KPřed 5 lety
Complement of a Graph | Graph Theory #19
Code to Create a Linked List in C | Programming #CodeWithMe#1
zhlédnutí 71KPřed 5 lety
Code to Create a Linked List in C | Programming #CodeWithMe#1
Number of Spanning trees possible in given Grpah | Kirchoff's Matrix Tree Theorem | Graph Theory #18
zhlédnutí 37KPřed 5 lety
Number of Spanning trees possible in given Grpah | Kirchoff's Matrix Tree Theorem | Graph Theory #18
Hamiltonian Graph | Details|Graph Theory #17
zhlédnutí 47KPřed 5 lety
Hamiltonian Graph | Details|Graph Theory #17
Euler Graph | Euler Circuit |Graph Theory #16
zhlédnutí 67KPřed 5 lety
Euler Graph | Euler Circuit |Graph Theory #16
Eccentricity of a vertex , Radius and Diameter of a Graph with example | Graph Theory #15
zhlédnutí 36KPřed 5 lety
Eccentricity of a vertex , Radius and Diameter of a Graph with example | Graph Theory #15
Kruskal's Algorithm for Spanning Tree | Graph Theory #14
zhlédnutí 36KPřed 5 lety
Kruskal's Algorithm for Spanning Tree | Graph Theory #14
Prim's Algorithm for Minimum Spanning Tree | Graph Theory #13
zhlédnutí 80KPřed 5 lety
Prim's Algorithm for Minimum Spanning Tree | Graph Theory #13
Spanning Tree - Minimum Spanning Tree | Graph Theory #12
zhlédnutí 140KPřed 5 lety
Spanning Tree - Minimum Spanning Tree | Graph Theory #12
simple hai
This is one of the best explanations i ever heard, thank you!
Thank you very much sir
thanks
Informative 😊
Thank you very much sir, Your teaching methodology is very good , Thank you very much again.
The 1st time I understand Indian accent. You explained well. Thumbs-up!
Very nice explanation sir but there is a bug in your code(the condition of the while loop will be i>=0 && j<n) either it gives ArrayIndexOutOfBoundsException .Thank you
Great explanation🙌
great explanation sir
if the matrix is not balanced then how can I print it
The explanation is really clear, but I have a doubt about the time complexity of this solution, it would be O(n²) or O(n)?
Thank u so much for a understandable explanation. Our teacher just say this like a story. he doesn’t show it on board.
🤟
Sir aap j ke out of country padhaye.woha sb samjhe ga aapko ye india h aapko pata h na
Great explanation!
NICE SUPER EXCELLENT MOTIVATED
good explanation sir
Thnks very useful
thank you sir, this solution is awesome 🙏
you could have easily gone anticlockwise...this doesn't make much sense, sorry
amazing. thank you
Understood easily,thank you Sir🙌☺️
Hi nice explanation, Where can I find actual code?
. thank you so much, sir! you made the concept very easy to learn and remember .
My mind get easily understood your concept Very nicely explained sir
Thank you sir
Goat stuff right here
you are amazing man
Sir, since cycle is path why vertex is repeated in cycle as you mentioned??
👍
Congratulations!!!!!
why cant we use || then &&?
Please provide complete program
I'm watching this from Oye-Ekiti, Ekiti, Nigeria in June 2024, thank you & God bless you
😂see this boy your lecturer is coming for u
Phli baar iss channel p aaya tha, dimag ka dahi kr diya sala kuch smj ni aaya
I have an exam tomorrow. I hope this video helps me
большое спасибо. хорошо объясняете. все понял
Thank you sir
gaanja fook ke vdo bana rha kya?? literally you wasted my 5 min of time
I was literally struggling with this q for the last 2 hours, thank you from the bottom of my heart sir 😊
Ee video dwara fathers day antey status kadhu vallatho okka roju undalani telisindhi ..nxt year i will try ..♥️🫡👏
no way this video this 7 yar old
otha nee soldratu puriyala da punda
0 4 6 9 13 15 Here 6 elements are present , So it is also accepted???
Nicely Explained.....Thanks
it's not worked 1 1 1 2 2 3 this testcase!
🎉🎉🎉🎉
NICE SUPER EXCELLENT MOTIVATED
That's a great effort from you Vivedanand. But I think you forget the final step which is : To let Head pointer -> pointing to the temp (node 'e') ... Head = temp;