Algorithms & Data Structures

By Sai Pranav Moluguri Continue reading on Medium »

If you’re starting Data Structures and Algorithms, you’ll eventually come across words like: Continue reading on Medium »

This video walks through LeetCode 3568: Minimum Moves to Clean the Classroom, a Bloomberg interview problem. We explain the BFS + Bitmask… Continue reading on M

Exploring LeetCode 918 with Python: Continue reading on Medium »

The “just use Postgres” stack, the SQL that runs it, and the four places it stops being a good idea. Continue reading on Medium »

Matrix problems have always been a little tricky for me. At first, they look simple because we are just dealing with rows, columns, and a… Continue reading on M

Linked list problems often become easier once we clearly define what information needs to be carried while traversing. Continue reading on Medium »

If you are learning Data Structures and Algorithms (DSA), you will often hear the term Brute Force. But what does a brute force algorithm… Continue reading on M

Sometimes an array problem looks like it needs a complicated technique, but after understanding what actually matters, the solution… Continue reading on Medium

Today I solved leetcode 24: swap nodes in pairs by using python. Continue reading on Medium »

The Internal Data Structures Behind TanStack Query’s Cache Continue reading on Level Up Coding »

Pointers, references, objects, stack frames, heap allocation, garbage collection, and memory leaks explained through simple real-world… Continue reading on Medi

Intuition Continue reading on Medium »

Pointers, references, objects, stack frames, heap allocation, garbage collection and memory leaks explained through real programs. Continue reading on Medium »

There is a Redis instance in your stack that you are quietly afraid to restart. Continue reading on Medium »

If you’ve spent any time grinding through coding interview problems, you’ve probably run into a strange little trick: two pointers moving… Continue reading on M

Four lines of code, and Java shipped them broken in the standard library for eight years. The idea was never the hard part. Continue reading on Stackademic »

Recursive code can be perfectly correct and still crash. The reason isn’t recursion. It’s where the unfinished work gets stored. Continue reading on Stackademic

The low-level transformations, non-mutating pipelines, single-pass aggregations, and performance-tuned patterns that eliminate nested… Continue reading on Skill

A Decision tree is a supervised learning algorithm used for classification and regression tasks. It works like a flowchart where aecg… Continue reading on Mediu

A Decision tree is a supervised learning algorithm used for classification and regression tasks. It works like a flowchart where aecg… Continue reading on Mediu

A Decision tree is a supervised learning algorithm used for classification and regression tasks. It works like a flowchart where aecg… Continue reading on Mediu

When the algorithm works but the writer doesn’t. Continue reading on Medium »

You are given maximum initial energy k (k<1000) and an array A of length n denoting wind speed on n days. He is stuck on a boat, and each… Continue reading on M

A while ago I started reading about the quantum NAND tree algorithm. Continue reading on Medium »

LeetCode 378 asks us to find the kth smallest element in an n x n matrix where every row and every column is sorted. Continue reading on Medium »

Install the AstraeaDB dashboard and explore your movie graph with queries, visual layouts, and graph algorithms. Continue reading on Medium »

How choosing the right root turns Optimal Binary Search Tree into another Interval DP problem Continue reading on Medium »

Learn arrays, linked lists, stacks, queues, trees, graphs, heaps, and hash tables through Instagram, WhatsApp, Google Maps, and YouTube. Continue reading on Sta

There are some LeetCode problems where the code ends up being surprisingly short, but getting to that code teaches you an important… Continue reading on Medium

When we first learn algorithms, we often hear statements like: Continue reading on Medium »

You can rank the most connected nodes, discover hidden communities, rewind the graph to a past date, and feed a small slice of it to a… Continue reading on Medi

You can rank the most connected nodes, discover hidden communities, rewind the graph to a past date, and feed a small slice of it to a… Continue reading on Medi

Rank the most influential nodes, uncover hidden communities, rewind the graph to an earlier date, and let it answer questions in plain… Continue reading on Medi

How adding one condition to interval splitting transforms a familiar DP pattern into Palindrome Partitioning Continue reading on Medium »

How choosing the right multiplication order transforms Matrix Chain Multiplication into a classic Interval DP problem Continue reading on Medium »

Today I solved LeetCode 215: Kth Largest Element in an Array. Continue reading on Medium »

Continue reading on Medium »

How breaking one number into smaller parts turns into a maximum-product Dynamic Programming problem Continue reading on Medium »

By Sai Pranav Moluguri Continue reading on Medium »

Do you ever read a question and think to yourself — ‘Easy, I got this’? Except you really don’t ‘got this’. You had never really ‘got… Continue reading on Mediu

How replacing max() with min() transforms the Unbounded Knapsack Dynamic Programming pattern Continue reading on Medium »

If you’re preparing for coding interviews, you’ve probably solved dozens of array problems already. Continue reading on Medium »

The software industry continues to create exciting opportunities for students, fresh graduates, and career changers. Continue reading on Medium »

Problem Continue reading on Medium »

How cutting a rod into pieces secretly becomes the Unbounded Knapsack Dynamic Programming pattern Continue reading on Medium »

How allowing repeated choices transforms the classic 0–1 Knapsack Dynamic Programming pattern Continue reading on Medium »

Difficulty: Medium Topic: Binary Search + Greedy Algorithm Problem Link: Meta Hacker Cup 2016 Round 1 — Problem B Continue reading on Javascript by doing »