Design Front Middle Back Queue
Implement a data structure that supports push/pop at front, middle, and back of a queue.
Delete Middle Node
Implement a function that deletes a given non-tail node from a singly linked list in O(1) time.
Showing 2 challenges · Data Structures & Algorithms
Data Structures & Algorithms — Python coding challenges
What you will find here
This page lists data structures & algorithms challenges — real Python problems you solve in the browser IDE with instant test feedback. Each challenge includes a clear brief, starter code, and automated checks.
Challenges vs tutorials and quizzes
Challenges test what you can build under constraints. For guided teaching, use our Python tutorials. For quick checks, try quizzes or copy snippets from code samples.