A travel freak pursuing B Tech in CSE at NIT Durgapur. I m interested in competitive coding, Data structure and Algorithms. 

Abhishek Kumar

An important data structure course of Linked list. This course will help you understand the various algorithms used to solve some important Linked list problems. Anyone who is is interested in Linked list data structure along with the Interview aspirants must take this course.

CBSE Class 12

English

In-depth Understanding of Linked List

Competitive Programming

Crash Course

Computers - Crash Course

Computer Science

Class 6-12

Become a topper in your school and ace your board exams by learning from best educators in the country

CBSE

CBSE (Central Board of Secondary Education)

This lesson will introduce you to the Linked list and various types of Linked list through an interesting example.

Understanding Linked List

This lesson covers one of the important algorithm of Linked list i.e. Floyd cycle finding algorithm. This lesson is aimed at explaining this algorithm in interesting way.

Floyd Cycle Finding Algorithm 1

This lesson continues with the application of Floyd cycle finding algorithm to solve some frequently asked interview questions.

Floyd Cycle Finding Algorithm 2

This lesson covers an important interview question. We will learn how to merge two sorted linked list such that resultant linked list should also be sorted.

Merge Two Sorted Linked List

This lesson is very important for interview preparation. This lesson aimed at explaining the use of two points to efficiently find the middle node and Nth node from last of a linked list.

Use of Two Pointers in Linked List

This lesson aimed at solving a famous puzzle Josephus circle using Circular Linked list. Important for interview aspirants.

Josephus Circle Using Linked List

This lesson covers a memory efficient alternative of Doubly linked list i.e. XOR list and how to traverse along the XOR linked list.

Memory Efficient Doubly Linked List (XOR List)

This lesson is about how to reverse a singly linked list in an iterative manner. Very important for the interview.

Reversing a Linked List (Iterative Method)

This lesson includes some multiple choice questions based on this course and a quick recap the course.

Quizzes Based On What We Have Learnt So Far

Pursuing BTECH from Guru Jambeshwer University,Hisar
Passionate and optimistic

Simran Thukral

This Course covers Data structures, which is an important subject in computer science.These lessons are very beneficial to students.The content is taught in a very interactive and efficient manner.

(Hindi) Data Structures

Myself Vaibhav, a B.tech Student, one word to define me is Createambitiople (Creative, Ambitious, Simple) and a gamer.

Vaibhav Heda

This Course is related to html document, how to create web pages using HTML and is for students of class 10-12

HTML : CBSE Class 12 Board

Computer science background. Passionate about solving real life problems through algorithms. Intern at GeeksforGeeks. Freelancer.

Dhiman Mayank

This course is about algorithms and data structures and it will focus more on competitive programming and interview questions.

(Hindi) Learning Data Structures and Algorithms

Student studying in VIT university, Pursuing undergrad in IT(information tech),
loves to code and teach.

Kusumanchi Vineeth

In this course, Kusumanchi Vineeth discusses regarding Expression tree, binary search tree, DFS algorithm, AVL tree and Dijkstra's algorithm.

Lessons

9 lessons • 1h 22m

Invalid Date

NaN

Understanding Linked List

Invalid Date

NaN

Floyd Cycle Finding Algorithm 1

Invalid Date

NaN

Floyd Cycle Finding Algorithm 2

Invalid Date

NaN

Merge Two Sorted Linked List

Invalid Date

NaN

Use of Two Pointers in Linked List

Invalid Date

NaN

Josephus Circle Using Linked List

Invalid Date

NaN

Memory Efficient Doubly Linked List (XOR List)

Invalid Date

NaN

Reversing a Linked List (Iterative Method)

Invalid Date

NaN

Quizzes Based On What We Have Learnt So Far