Embark on your journey of mastering advanced built-in data structures such as sorted maps, linked lists/queues, and stacks. This course will lay the foundational knowledge required to effectively manipulate these advanced data structures.
Overview
Syllabus
- Lesson 1: Exploring Stacks with Python Lists
- Cafeteria Stack Maintenance
- Peek at the Next Tray Without Moving It
- Manage Cafeteria Trays with a Stack in Python
- Add Functionality to Check for Matching Brackets in Expressions
- Balancing Parentheses With Stack Operations
- Evaluating Prefix Expressions Using Stack Operations
- Lesson 2: Understanding Queues and Deques in Python
- Supermarket Checkout Line Debugging
- Implementing a Task Queue
- Implement Queue Processing Logic in a Print Job Simulation
- Implement a Deque Rotation Logic in Python
- Implement a Coffee Shop Queue
- Lesson 3: Exploring Sorted Dictionaries with Python and the sortedcontainers Library
- Rectify Population Dictionary Code
- Add Peek Forward Feature to SortedDict Application
- Implementing Key Succession Discovery in a SortedDict
- Identifying the Subsequent Event Using SortedDict
- Enhancing SortedDict with Custom Key Ordering
- Lesson 4: Sorting Through Data: Using Custom Classes and Comparators in Python Maps
- Sorting Employee Records by ID
- Adding Publication Year to the Book Display in a Sorted Library Inventory
- Creating a Sorted Leaderboard for Competitive Coding Sessions
- Implementing a Bookshelf Class with Custom Sorting Logic
- Using bisect_left and peekitem with a SortedDict and a Custom Class Key
- Lesson 5: Applying Advanced Data Structures in Practice Problems
- Design and Implement a Cafe Order Queue System in Python
- Implementing a Deque-Based Browser History Management System in Python
- Implementing an Efficient Task Prioritization System using SortedDict in Python
- Implementing a Task Scheduler with Custom Sorting