Day 16 | Linked List Introduction | DSA by FRAZ

Welcome to NextLeap Coding, a space where one of our instructors Mohammad Fraz breaks down the various essentials of the topic Data Structures and Algorithms (DSA)! In this series we’re covering the maths aspect of DSA! We hope you enjoy these live streamed sessions and are able to get value from them! Stay tuned towards the end as Fraz also takes audience Questions as well!
In this special episode, Fraz talks about one of the most fascinating DSA concepts, linked lists! Over the next few classes, he will be covering various questions, levels and concepts that come under the category of Linked Lists. This live, he gives a general introduction into the structure of Linked Lists and their working.
For doubts join https://t.me/leadcoding2

🚀 Head to http://bit.ly/3H7e7ho to join the NextLeap DSA fellowship

Please share your feedback on this episode in the comments sections. It will help us make it better for you.

0:00 Day 16 | Linked List Introduction
1:18 Introduction
13:35 Problem statement
58:34 How to create a new data type
1:22:52 Dynamic memory
1:30:28 Delete node in a Linked List
1:47:17 Nextleap Software developer fellowship program
1:49:20 Conclusion with Q&A

Check out NextLeap website for the latest and upcoming programs:

👉http://bit.ly/3W1RgKg

Follow NextLeap on Social Media for all the latest and upcoming:

👉Twitter: https://twitter.com/yourNextLeap

👉 Linkedin: https://www.linkedin.com/company/your...

🔴Subscribe to our channel to get the latest video updates