This course dives into the understanding and application of basic data structures including Linked Lists, Stacks, and Queues. It sheds light on the inner workings of these structures, their implementation, time, and space complexity, along with their effectiveness in solving interview-focused algorithmic coding challenges.
Implementing Undo and Redo feature in a Text Editor using Stacks
Enhancing User Experience with More Informative Messages
Debugging Stack Operations in a Library System
Adding the "Peek" Operation in Stack Implementation
Balancing the Wild Brackets in a String
Rotational String Manipulation Using Stack Data Structure
"Reverse Order Postfix Expression Evaluation"
Predicting Cooler Days Using Temperature Data Analysis
Designing an Advanced Stack with Maximum Element Functionality
Implementing and Using a Queue Data Structure in Python
Adding More Issues to the Queue
Unjamming the Task Queue
Adding Additional Orders to Catering Queue
Shuffling Elements in a Deque by nth Position
Space Journey Sensor Readings: Calculating Moving Average in Python
Exploring Circular Linked Lists in Python
Altering the Flow of a Doubly Linked List
Fixing LinkedList Size Property
Adding a Node to an Alien Communication Network in Python
Reversing and Summing Element Values in a Singly Linked List
Parity Check for Singly Linked List Elements