Merge Two Sorted Lists | Animation | Leetcode #21 | Coding Interview Question

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

Watch all my playlist here:

Want to land a software engineering job in the IT industry? This course - 'Visualizing Data Structures and Algorithms' is here to help. The course walks you through multiple Java algorithms, data structures problems, and their solutions with step by step visualizations, so that you are actually learning instead of blindly memorizing solutions.

The course covers in and outs of Data Structures and Algorithms in Java. Java is used as the programming language in the course. Students familiar with Javascript, Python, C#, C++, C, etc will also get to learn concepts without any difficulty. The implementation of various Algorithms and Data Structures have been demonstrated and implemented through animated slides. It covers many interview room questions on Algorithms and Data Structures. The questions and solutions are demonstrated by -

1. Animated slide. (To make visualization of algorithms faster)
2. Coding algorithm on IDE.

The course covers topics such as -
0. Algorithm Analysis
1. Arrays
2. Matrix
3. Singly Linked List
4. Doubly Linked List
5. Circular Singly Linked List
6. Stacks
7. Queues
8. Binary Tree
9. Binary Search Tree
10. Graphs
11. Priority Queues and Heaps
12. Recursion
13. Searching
14. Sorting
15. Strings
16. Trie Data Structure
17. Dynamic Programming
and many more ...

#dsa #algorithms #coding
Рекомендации по теме
Комментарии
Автор

Best series for DS & Algo. I am also 10 yrs java exp guy. Was looking for DS & Algo free course over YouTube with java implementation and found this. Hats Off To You Man..Excellent Work. GOD BLESS YOU :)

shubhamagarwal
Автор

I cannot express how grateful i am right now brother. U the only one who can explain this problem perfectly, that animation made it easier to understand. I was struggling trying to understand the logic behind it but your explanation was on point. New subsciber man. Ur the best <3

alexis--
Автор

Dude, you are THE BEST. The diagram explaining every single detail made me understand this algo much easir...

fabiomarsiaj
Автор

So far, you are the best. Right now, whenever I encounter a difficult problem, I normally ask myself, how will Dinesh solve this problem.

nwokolobueze
Автор

Sir you are doing a fabulous job....love the way you blessed 😍

Qizar
Автор

This is the best DS tutorial I have ever come across. Thanks Dinesh sir

kavyaramachandran
Автор

very good visual explanation in your each and every solution, only missing part is not explaining time and space complexity, it would be great if you could consider in upcoming videos. thank you !!

iamritb
Автор

good one !! I like your approach to solving this problem !!

jonastad
Автор

Fantastic explanation bro😍 The content that you create certainly stands out from other DSA tutorials!!! Keep up the great work!!!! God bless🙃

selvamkandharaja
Автор

Sir why didn't you continue this series.The way of explanation is amazing and clear

Durga-im
Автор

Sir, Try to cover the base cases also in Problem Videos

aniketsomkuwar
Автор

if(a!=null) because then they show the reamaing value of a

anaskhan_in
Автор

sir what is the diffrence b/w ListNode head=null and ListNode dummy =new ListNode(0);?

jayasekharredditelluri
Автор

can you make a video on implementation of this algorithm

prakharrana
Автор

We are changing tail value and not understanding how dummy also getting changed

vinayyelleti