How to do it in Python.
Programming idioms are specific to each language. These idiomatic patterns are considered the “Pythonic” way to write code in Python. Knowing them helps you write more readable and efficient code. Let’s dive into some of the most common and useful Python idioms. 1. List Comprehensions Instead of using a loop to generate lists, use a […]
Python Idioms – Write Readable and Efficient Code Read More »
Introduction A Trie, pronounced as “try,” is a tree-like data structure that is used to store an associative array where the keys are usually strings. Unlike binary trees, which have a maximum of two children (left and right), tries can have multiple children, one for each letter in the alphabet. Tries are particularly useful for
Implementing a Trie Data Structure in Python Read More »
Introduction Graphs are a versatile data structure that can represent anything from social networks to web pages and their interconnections. A graph consists of vertices (also known as nodes) and edges that connect pairs of vertices. In this blog post, we’ll explore the fundamentals of graph theory and implement a simple, undirected graph in Python.
Implementing a Graph Data Structure in Python Read More »
Introduction A heap is a special tree-based data structure that satisfies the heap property. It is mainly used to implement priority queues. A heap can be visualized as a binary tree filled on almost all levels, except that the last level might not be completely filled and it’s filled from left to right. In a
Implementing a Heap Data Structure in Python Read More »
Introduction A Hash Set is a data structure that stores unique elements in no particular order. Just like a hash map, a hash set uses a hash table for storage, but it only stores keys, not key-value pairs. In this blog post, we’ll discuss the hash set data structure and implement one from scratch in
Implementing a Hash Set Data Structure in Python Read More »
Introduction Hash maps, also known as hash tables or dictionaries, are data structures that provide fast access, insertion, and deletion operations. The basic idea behind a hash map is to use a hash function to map keys to indices in an array, where the corresponding values can be stored. In this blog post, we’ll walk
Implementing a Hash Map Data Structure in Python Read More »
Introduction A Binary Search Tree (BST) is a tree-based data structure that has the following properties: In this blog post, we’ll dive deep into implementing a Binary Search Tree in Python. Structure of a Binary Search Tree A simple Binary Search Tree can be visually depicted like this: Here, 15 is the root node, and
Implementing a Binary Search Tree in Python Read More »
Introduction The queue is a data structure that stores items in a First-In, First-Out (FIFO) manner. Unlike a stack, where elements are added and removed from the same end, in a queue, elements are added at one end (the “rear”) and removed from the other end (the “front”). In this blog post, we’ll explore how
Implement a Queue in Python Read More »
Introduction Stacks is one of the most fundamental data structures used in computer science. A stack is a last-in, first-out (LIFO) data structure that allows elements to be added and removed from one end, known as the “top” of the stack. In this blog post, we’ll explore how to implement a Stack from scratch in
How to implement Stack in Python? Read More »
Introduction Linked lists are one of the most fundamental data structures in computer science. They provide an alternative to arrays for storing sequential elements. Unlike arrays, linked lists are not contiguous blocks of memory but rather a collection of discrete nodes, each node holding data and a reference to the next node in the sequence.
How to implement Linked List in Python? Read More »