Count of Subsets: One Word Changed. Everything Followed.
Chapter 3 ended with a hint. The shift from Knapsack to Subset Sum was a one-word change: max() became or . The structure stayed identical. Only the…
Open Source
⚑ Report a ProblemLatest Open Source news from Tech News
All topics
AI
agents
ai
api
architecture
automation
backend
beginners
career
database
devchallenge
devops
discuss
javascript
linux
llm
machinelearning
mcp
opensource
performance
productivity
programming
python
react
security
showdev
testing
tutorial
typescript
webdev
LeetCode 4000 - 4010 problems: patterns and approaches explained
LeetCode has started publishing problems numbered 4000 and above. At the time of writing this post, there are already 4055 problems. In this post, I…
Algorithmic Patterns: The Ultimate Guide to Sliding Window
The Sliding Window pattern is one of the most vital algorithmic techniques for optimizing array and string problems. Instead of repeatedly processin…
768. Max Chunks To Make Sorted II
Problem You are given an integer array arr. We split arr into some number of chunks (i.e., partitions), and individually sort each chunk. After conc…
Correlated Subqueries Explained: From Confusing to Intuitive
Hey everyone! 👋 It's been a while since I posted here. Over the past few days, I've been revisiting SQL from the ground up—not just solving problems…
Building Automated Developer Pipelines
Building Automated Developer Pipelines Here is how I automated my LeetCode progress, LinkedIn posting, and ATS resume updates using GitHub Actions a…
Building Automated Developer Pipelines
Building Automated Developer Pipelines Here is how I automated my LeetCode progress, LinkedIn posting, and ATS resume updates using GitHub Actions a…
I Found the LeetCode for System Design Interview, and It's Awesome
Disclosure: This post includes affiliate links; I may receive compensation if you purchase products or services from the different links provided in…
LeetCode Journal # 1
Documenting my daily LeetCode journey here! Today's Problem: 1512. Number of Good Pairs My First Approach My initial solution was straightforward: c…
LeetCode 78. Subsets
Link https://leetcode.com/problems/subsets/description/ Problem Given an integer array nums of unique elements, return all possible subsets (the pow…
Maximum Width of Binary Tree
Given the root of a binary tree, return the **## Problem Statement Given the root of a binary tree, return the maximum width of the tree. The width…
Minimum Insertions to Make String Palindrome
leetcode.com Intuition At first glance, it seems like we need to decide where to insert characters to make the string a palindrome. Instead of think…
Every Backtracking Problem Is the Same Three Lines. I Just Couldn't See the Tree.
I avoided backtracking for an embarrassingly long time. I had solved maybe 200 problems and could do graphs, DP, binary search, all of it. But the m…
Rotting Oranges
leetcode.com Problem Statement You are given an m × n grid where: 0 → Empty Cell 1 → Fresh Orange 2 → Rotten Orange Every minute: A rotten orange ro…
Min Stack
leetcode.com Problem Statement Design a stack that supports the following operations in O(1) time: push ( x ) pop () top () getMin () getMin() shoul…
Next Greater Element I | Monotonic Stack
leetcode.com Problem Statement You are given two arrays: nums1 is a subset of nums2 . For every element in nums1 , find the first greater element to…
What I learned after solving 100 Leetcode Problems
In June 1st, 2026 - the first day of summer, I decided to make an incredible challenge: To solve 100 Leetcode problems . This was such an incredible…
Single Element in a Sorted Array
leetcode.com Problem Statement Given a sorted array where: Every element appears exactly twice. Only one element appears once. Find the single eleme…
Search in Rotated Sorted Array | Modified Binary Search
leetcode.com Problem Statement Given a rotated sorted array nums and an integer target , return the index of target . If the target does not exist,…
The 15 LeetCode patterns that cover ~90% of coding interviews
Grinding 500 LeetCode problems is the slow way to prep. The fast way is pattern recognition — because most interview questions are a remix of ~15 un…
Sudoku Solver | Backtracking
leetcode.com Problem Statement Given a partially filled Sudoku board, fill all empty cells so that: Every row contains digits 1-9 Every column conta…
N Queens | Backtracking
leetcode.com Problem Statement Place N queens on an N x N chessboard such that: No two queens attack each other. Queens cannot share: Row Column Dia…
Combination Sum | Backtracking
leetcode.com Problem Statement Given an array of distinct integers candidates and a target value target , return all unique combinations where the c…
Subsets II | Backtracking
leetcode.com Problem Statement Given an integer array nums that may contain duplicates, return all possible subsets (the power set). The solution mu…
Max Consecutive Ones
Problem Statement Given a binary array nums , return the maximum number of consecutive 1's present in the array. Example Input: nums = [1,1,0,1,1,1]…
Remove Duplicates from Sorted Array
Problem Statement Given a sorted integer array nums , remove the duplicates in-place such that each unique element appears only once. Return the num…
System Design Interview Roadmap (10 Concepts That Matter Most)
Disclosure: This post includes affiliate links; I may receive compensation if you purchase products or services from the different links provided in…
Linked List Cycle Detection
leetcode.com Cycle detection is one of the most classic Linked List interview problems. At first, it may look like we need extra memory to track vis…
I Got Bored of LeetCode, so I Built a Coding RPG
https://dsa-life-simulator-frontend.vercel.app"I made a free tool to make DSA practice feel like an RPG — would like feedback from this community"Be…
Delete Node in a Linked List
Problem Link - https://leetcode.com/problems/delete-node-in-a-linked-list/ This is one of those interview questions that looks impossible at first.…