Binary search trees BST are in‑memory sorted data structures for efficient lookups. Each node has two children; for any node, all values in the left subtree are...
Last month, I went down a rabbit hole: I implemented six classic sorting algorithms from scratch in pure Python Bubble, Selection, Insertion, Merge, Quick, Heap...
'Dynamically Typed Syntax
Introduction When people ask how to get better at DSA, the advice is usually some version of: > “Practice more problems.” That’s not wrong. What actually made...
What Is Redis? Redis Remote DIctionary Server is an open‑source, in‑memory data‑structure store and one of the most popular NoSQL databases. Created by Salvato...
Introduction I’m revisiting data structures and algorithms DSA by creating a mini‑project for each topic. This approach helps me see how DSA concepts are appli...
Problem Overview Dividing data into optimal segments is a classic challenge in computer science, often requiring a balance between specific constraints and eff...
Introduction Developing strength in graph algorithms sharpens your programming craft and has a ripple effect across many data structures such as queues, stacks...
Introduction If you have heard developers talk about Redis, you might wonder why it is such a big deal. Redis shows up in backend development, caching, real-ti...
!Cover image for Building in Public: How I Think About DSA and Why I’m Sharing Ithttps://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=aut...
Problem Description We need a function that removes duplicates from a list while preserving the original order of elements. Example remove_duplicates1, 2, 2, 3...
The Train Imagine a train with numbered compartments: 🚂 Car 0 Car 1 Car 2 Car 3 Car 4 Each car has a number starting from 0! and can hold one thing. Arrays ar...
