Tech Tutorials

Welcome to my series where I teach you how to solve the part of the tech industry we all know and love — Leetcode problems. Continue reading on Medium »

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 »

programming এ একটা program এর time complexity বলতে এইটা না যে এই program টা কত সময় ধরে run হয়েছে আপনার device এ। Continue reading on Medium »

Is it common to be stuck on a leetcode problem for an hour or two and still hitting time limit exceeded error submitted by /u/dragon_pile [link] [comments

hi all, im about to start learning DSA at my university next semester. itll include these topics: Arrays, linked lists, trees and graphs; stacks and queues; sym

Day 27! Today we’re revisiting a problem you may recognize — but this time, we’re looking at it purely through the lens of our newest… Continue reading on Mediu

One pointer asks the question. The other already knows the answer. Continue reading on CodeToDeploy »

It is not language specific article .Trust me ,you will learn a lot .No matter what language you use . Continue reading on Medium »

Memorizing stacks, queues, trees, and graphs is easy. Recognizing which behavior a problem actually requires is the skill that changes how… Continue reading on

Day 23! Today’s problem might just be the most mind-bending application of Fast & Slow Pointers in this whole series — because there’s no… Continue reading on M

Understanding the Working, Advantages, and Use Cases of the Algorithm for Solving Maximum Subarray Problems | Karthikeyan Nagaraj Continue reading on Medium »

Yazılıma yeni başlayan herkesin ilk duyduğu kelimelerden biridir “algoritma”. Kulağa karmaşık gelir, matematik dersinden kalma bir kâbus… Continue reading on Me

Implementing the fastest shortest-path algorithm on paper, and finding the hole in its proof. Continue reading on Medium »

Los números de n=10 hasta n=10000, con k=2, se mantienen esencialmente planos. Continue reading on Medium »

Every raindrop on a pond is running the same algorithm you’ve been afraid of. Watch one fall. Continue reading on Medium »

As a Mobile Tech Lead, I’ve often noticed that most Data Structures & Algorithms (DSA) resources are written for general software… Continue reading on Medium »

Chapter 3 — Hash Tables and Hashing Continue reading on Medium »

Koko loves bananas, and there are several piles of them. She can decide her eating speed (k bananas/hour) and wants to finish all the… Continue reading on Mediu

Master Arrays Before Anything Else: The Foundation of Every Coding Interview Continue reading on Medium »

The Biggest Mistake Most People Make While Preparing for LeetCode Continue reading on Medium »

Day 5 of #MasterDSA! Today’s problem is a great one for building intuition — it feels almost like a sorting trick, but it’s really just… Continue reading on Med

Have you ever wondered how your computer shrinks massive files down so they don’t absolutely wreck your hard drive? Continue reading on Medium »

How a single clever idea — turning any piece of data into a number — powers dictionaries, database indexes, deduplication, joins, and… Continue reading on Mediu