A Binary Search Tree is a type of binary tree where each node follows a specific ordering property: the left child of a node contains a value less than the node’s value, and the right child contains a value greater than the node’s value. This property makes searching, insertion, and deletion efficient. Introduction A Binary … Read more
Automated testing is a crucial aspect of modern software development. It ensures code reliability, maintainability, and helps prevent regression bugs. In the Python ecosystem, Pytest stands out as one of the most powerful, flexible, and widely-used testing frameworks. What is Pytest? Pytest is a testing framework for Python that makes it easy to write simple … Read more
Python is a high-level, dynamically-typed language. It abstracts away memory management for the developer — but understanding how it works under the hood is crucial for writing efficient and memory-safe programs. For the purposes of this article, I’ll focus on the memory management done by the default implementation of Python, CPython. Analogy You can begin … Read more
Floyd’s Cycle Detection Algorithm is a pointer algorithm that uses two pointers moving at different speeds to detect a cycle in a sequence of values, typically in a linked list. It is one of the most elegant solutions to the cycle detection problem and operates with O(n) time and O(1) space complexity. This technique was … Read more
SQL offers powerful tools like CTEs, Views, and Temporary Tables to simplify complex queries and manage data efficiently. Though they may seem similar, each serves a unique purpose. Understanding their differences helps you write clearer, faster, and more maintainable SQL. This article explains what they are, how they differ, and when to use each. What … Read more
Matrices are fundamental data structures in computer science and mathematics. In competitive programming, matrices are widely used in problems involving 2D grids, dynamic programming, graph algorithms, geometry, and simulations. Basics of Matrices in Python Python doesn’t have a native matrix type. A matrix is typically represented as a list of lists: Concepts Matric Representation Initialisation … Read more
Competitive programming or sport programming is a mind sport involving participants trying to program according to provided specifications. Recursion Recursion is one of the most powerful and elegant tools in programming or even in competitive — but it can seem confusing at first. In this guide, you’ll learn what recursion is, how to identify recursive … Read more
Python decorators are one of the language’s most powerful and expressive features. They allow you to extend and modify the behavior of functions or classes without changing their actual code. This article will cover everything you need to know to understand, write, and use decorators effectively. What Is a Decorator? In Python, decorators are a … Read more
Floyd’s Cycle Detection Algorithm (Tortoise and Hare method)
Linked Lists are one of the most fundamental data structures in computer science. Understanding their operations is crucial for interviews, system designs, and efficient programming. In this article, we’ll explore what a linked list is, and walk through all the key operations step-by-step. What is a Linked List? A Linked List is a linear data … Read more