Quant Researcher at Algorithm Trading/Computer Science NSIT/Competitive Coding

Shaksham Garg

The course is about linked list data structure. The prerequisites for the course are: Pointers; Dynamic Memory Allocation. 
The course first gives an introduction to linked list then discusses about operation that can be performed on linked list.

Programming

English

Data Structure and Algorithms - Linked List

Programming Languages

Stacks & Queues

Basics

Competitive Programming

Personal and Skill Development

Develop your coding skills, learn a new language or prepare for campus placements and job interviews, you can do it all with these awesome courses.

Lesson is about introduction to linked list and advantage and disadvantage of linked list over arrays.

Linked List: Introduction

Lesson is about inserting a new node to the end of the list.

Linked List Operation: Appending a Node

Lesson is on an example to insert a new node at end of list.

Appending Node: Example

Lesson is about displaying all the elements in a linked list. Lesson also uses an example to display all the elements of the list.

Displaying All Elements in Linked List

Lesson is about insertion in a sorted linked list.

Inserting a Node in Sorted Linked List

Lesson is on an example for insertion of node in sorted linked list.

Insertion in Sorted List: Example

Lesson is about deleting an element from the linked list.

Deleting a node from the list.

Lesson is about destroying all the elements of the linked list.

Destroying a linked list

List STL

Template in c++

Lesson is about introduction to doubly linked list

Doubly linked list

Lesson is about various operations on a doubly linked list.

Doubly linked list : operations

Lesson is about insertion in a doubly linked list.

Doubly linked list :Insertion operation

Lesson is about deletion from a doubly linked list.

Deletion from doubly linked list.

This series aims to take your programming to the next level. The series focuses on aspiring programmers who aim to be better at coding.

Hackerearth Inc.

This collection begins with the explanation of Euclid's Algorithm. Thereby the next lesson talks about Number Theory and discusses prime numbers. Also the need and implementation of a powerful algorithm, the Modular Exponentiation are also being discussed. In the next lesson, problems are discussed that requires one to compute a huge value. For reference please follow this link:  https://www.hackerearth.com/notes/number-theory-1 

Diving Into Number Theory

The collection provides a basic introduction to Stacks and Queues. The first lesson talks about the Stack data structure and why and how it is used. Thereby Queue data structure and its domain of application are discussed. The last two lessons help in solving an elementary problem using the Stack Data Structure and Queue Data Structure. Also, follow the links provided in the lessons for better understanding. 

Studying The Basic Data Structures - Stacks & Queues

 A student at NIT Durgapur pursuing B.Tech currently in my final year. Interested in Data Structures, Algorithms and Web Development.


Sarfraz Baig

This course deals with the Abstract Data Type Queue and its implementation. In these series of lessons, we will try to do an in-depth analysis of queue and its implementations. The course also deals with solving competitive programming questions based on queue along with some typical questions asked in an interview.

Introduction To Queues

The course is about Stacks and Queues. Stacks and Queues are widely used in competitive programming and are of significant importance in solving many real life problems like expression conversion. Recursion in any programming language is internally implemented by using stacks only. Similarly Queues have their own importance like solving of first come first serve scheduling algorithms.

Data Structures and Algorithms - Stacks and Queues

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

Dhiman Mayank

This course will discuss algorithms and data structures with important interview questions.

(Hindi) Data Structures - Stack, Queue, Linked List, Sorting and Binary Search

The collection begins with an indispensable searching algorithm, Binary Search and tries to get a basic understanding of where it can be used. The next two lessons solve problems for the important application of Binary Search in Competitive Programming. In these two lessons, one can Binary Search for the answer in a range of values and learn how to exploit the behavior of a variable.

Lessons

14 lessons • 2h 15m

Invalid Date

NaN

Linked List: Introduction

Invalid Date

NaN

Linked List Operation: Appending a Node

Invalid Date

NaN

Appending Node: Example

Invalid Date

NaN

Displaying All Elements in Linked List

Invalid Date

NaN

Inserting a Node in Sorted Linked List

Invalid Date

NaN

Insertion in Sorted List: Example

Invalid Date

NaN

Deleting a node from the list.

Invalid Date

NaN

Destroying a linked list

Invalid Date

NaN

List STL

Invalid Date

NaN

Template in c++

+ See all lessons