Linked List Implementation in Python
This post provides an overview of several methods to implement a linked list in Python.. A Linked List node consists of a data field and a reference to the next node in the list.
Category: Python
Graph Implementation in Python
This post implements weighted and unweighted directed graph data structure in Python using an adjacency list representation of a graph, where each vertex in the graph stores a list of neighboring vertices.
Stack Implementation in Python
This article covers the stack implementation in Python. A stack is a linear data structure that follows the LIFO (Last–In, First–Out) order, i.e., items can be inserted or removed only at one end of it.
Queue Implementation in Python
This article covers queue implementation in Python. A queue is a linear data structure that follows the FIFO (First–In, First–Out) order, i.e., the item inserted first will be the first one out.
Max heap implementation in Python using heapq
This post will discuss how to implement max heap in Python based on the heapq module.
Print binary representation of a number – C, C++, Java, and Python
Print binary representation of a given number in C, C++, Java, and Python using built-in methods and custom routines.
Find all permutations of a string in Python
In this post, we will see how to list out all permutations of a string in Python.
Number to word conversion
Write an efficient program to convert a given number to words.
Trie Data Structure – Python Implementation
Trie is a tree-based data structure used for efficient retrieval of a key in a huge set of strings. In this post, we will discuss Python implementation of Trie data structure which supports insertion and search operations.
In-place vs out-of-place algorithms
All algorithms can be classified into in-place and out-of-place algorithms based on the amount of extra space used by them. In this quick article, we’ll explore the difference between the two.