Learn how to solve linked list problems for coding challenges and technical interviews. The course covers topics such as understanding linked lists, traversal, working with linked list values, summing lists, finding elements, retrieving node values, list reversal, and list zipping. The teaching method includes video lectures and problem-solving exercises. This course is intended for individuals preparing for technical interviews or coding challenges that require knowledge of linked lists.
Overview
Syllabus
) Course Introduction.
) What is a Linked List?.
) Linked List Traversal.
) Linked List Values (https://structy.net/problems/linked-list-values).
) Sum List (https://structy.net/problems/sum-list).
) Linked List Find (https://structy.net/problems/linked-list-find).
) Get Node Value (https://structy.net/problems/get-node-value).
) Reverse List (https://structy.net/problems/reverse-list).
) Zipper Lists (https://structy.net/problems/zipper-lists).
Taught by
freeCodeCamp.org
Related Courses
-
Graph Algorithms for Technical Interviews - Full Course
-
Binary Tree Algorithms for Technical Interviews - Full Course
-
Data Structures and Algorithms in Python - Full Course for Beginners
4.6 -
Data Structures - Full Course Using C and C++
-
Introduction to Data Structures for Interviews
-
Dynamic Programming with Java – Learn to Solve Algorithmic Problems & Coding Challenges
