Special offers now — see discounted courses.
day
:
hour
:
min
:
sec
See special offers
Python Data Structures: Power of Linked Lists for Technical Interviews

Python Data Structures: Power of Linked Lists for Technical Interviews

1h 30mAdvanced2022-12-13

Authors

Erin Allard

Erin Allard

Software Engineer at Numerator

Course details

Rock your next technical interview by using Python to code some of the most common linear data structures: singly and doubly linked lists. In this course, instructor Erin Allard digs into the subject of linked lists, sharing what you need to know to communicate your understanding of this data structure to an interviewer. Erin goes over abstract data types and helps you conceptualize nodes in linked lists. She also discusses how to create both the singly linked list and doubly linked list classes and goes over how to implement key methods. Throughout the course, she not only shows how to code the class and methods for each data structure, but also explains why each method is needed.

Learning objectives
Abstract data types
Identifying the list data type and its uses
Operations on linked lists
Defining and coding the singly linked node class
Creating the singly linked list class and its methods
Creating the doubly linked list class and its methods

Skills covered

Data EngineeringAdvancedPythonProgramming LanguagesData ScienceOpen SourceSoftware Development

Concepts

0. Introduction

  • 01 - Understanding linked list data structures in Python
  • 02 - What you should know

1. The Linked List Abstract Data Type

  • 03 - Abstract data types
  • 04 - The built-in list data type in Python
  • 05 - The linked list abstract data type - Nodes
  • 06 - The linked list abstract data type - Operations

2. The Node Class for Singly Linked Lists

  • 07 - Defining the singly linked list node class
  • 08 - Coding the singly linked list node class

3. The Node Class for Doubly Linked Lists

  • 09 - get previous() and set previous()

4. The SinglyLinkedList Class

  • 10 - Creating the SinglyLinkedList class and its methods
  • 11 - is empty()
  • 12 - add front()
  • 13 - size()
  • 14 - search()
  • 15 - Visualizing remove()
  • 16 - Coding remove()
  • 17 - Testing remove()

5. The DoublyLinkedList Class

  • 18 - Creating the DoublyLinkedList class and its methods
  • 19 - size() and search()
  • 20 - Coding add front()
  • 21 - Testing add front()
  • 22 - Visualizing remove()
  • 23 - Coding remove()
  • 24 - Testing remove()

Conclusion

  • 25 - Next steps

Related courses

Related learn paths

About us

LyndaKade is a leading learning platform that helps people learn business, software, technology, and creative skills to achieve personal and professional goals.

Phone numberAparat ChannelTelegram SupportTelegram ChannelInstagram Page

All rights to this site belong to LyndaKade.

Terms of Service|Privacy Policy

نماد الکترونیک enamad در صورت اتصال با آی‌پی داخل کشور، نمایش داده خواهد شد.
logo-samandehi - لوگو ساماندهی
zarinpal
zibal