Skip to content

Tag Archives: Python DSA-exercises

Prerequisites: Networkx NetworkX is a Python language software package for the creation, manipulation, and study of the structure, dynamics, and function of complex networks. It… Read More
Prerequisite: Queue in Python Here given a queue and our task is to dump the queue into list or array. We are to see two… Read More
The stack is a linear data structure which works on the LIFO concept. LIFO stands for last in first out. In the stack, the insertion… Read More
Prerequisite: XOR Linked List An ordinary Doubly Linked List requires space for two address fields to store the addresses of previous and next nodes. A… Read More
Creating custom data types can be tricky, especially when you want to use it like any other data type. Linked List can be thought of… Read More
Linked list is a simple data structure in programming, which obviously is used to store data and retrieve it accordingly. To make it easier to… Read More
A Gtk.Stack is a container which allows visibility to one of its child at a time. Gtk.Stack does not provide any direct access for users… Read More
The Queue module is primarily used to manage to process large amounts of data on multiple threads. It supports the creation of a new queue… Read More
Given a file, the task is to print as well as store the lines of that file in reverse order using Stack. Examples: Input :… Read More
Priority Queue is an extension of the queue with the following properties. An element with high priority is dequeued before an element with low priority.… Read More
The pixels in an image are represented as integers. After blurring each pixel ‘x’ of the resulting image has a value equal to the average… Read More
Given string str, the task is to find whether the given string is a palindrome or not using a stack. Examples:   Input: str = “geeksforgeeks” Output:… Read More
A stack is a collection of objects that are inserted and removed using Last in First out Principle(LIFO). User can insert elements into the stack,… Read More