Python Learner Builds Stacks, Queues and Linked Lists From Scratch in Week 8
A Python self-learner completed the second month of their study program by implementing core data structures — stacks, queues, and linked lists — from scratch rather than relying on built-in abstractions. Stacks were explored through the last-in-first-out principle, reinforced by solving the classic Valid Parentheses problem on LeetCode. Queues were built using Python's deque collection to ensure O(1) removal operations, with an added exercise of simulating stack behaviour using only queue operations. The week culminated in a practical browser history tracker featuring functional back and forward navigation, built on the same logic practised through coding challenges. The project marked the close of month two in the learner's structured Python curriculum.
This is an AI-generated summary. ShortSingh links to the original source for the complete article.
Discussion (0)
Log in to join the discussion and vote.
Log in