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…
Latest News
⚑ Report a ProblemTech news from the best sources
All topics
- игры
AI
News
Tech
agents
ai
api
architecture
automation
backend
beginners
career
devchallenge
devops
javascript
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…
Почему заметки не работают — и как я заменил их пазлами
Во время обучения чему-либо часто сталкиваешься с тем, что забываешь, что вообще изучал, особенно детали. Мне 18, я решил 822 задачи на LeetCode со…
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…
DSA | Random Generator | Can you come up with a solution?
Hi, I may post some DSA / interview questions I find interesting (even if you would be unlikely to see it in an interview) from some of the books I…
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…
trapping rain water ii
they drew a diagram. a diagram. 😒 when they draw a diagram, you know it's over. they got squares and everything. i remember trapping rain water i i…
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…
Removing Duplicates from a integer list (Easy) | LeetCode Practice #7
Remove Duplicates From Sorted Array Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique…
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…
Valid Parentheses and Stack (Easy) | LeetCode Practice #5
Valid Parentheses Given a string s containing just the characters ' ( ', ' ) ', ' { ', ' } ', ' [ ' and ' ] ', determine if the input string is vali…
Two Sum and the use of Dictionary (Easy) | LeetCode Practice #1
Two Sum Given an array of integers nums and an integer target , return indices of the two numbers such that they add up to target . (You may assume…
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…
Vertical Order Traversal
leetcode.com Problem Statement Given the root of a binary tree, return its vertical order traversal . Rules: Nodes are grouped by their column (Hori…
Right View of a Binary Tree
leetcode.com Problem Statement Given the root of a binary tree, return the nodes visible when the tree is viewed from the right side. Only the last…
Left View of a Binary Tree
leetcode.com Problem Statement Given the root of a binary tree, return the nodes visible when the tree is viewed from the left side. Only the first…
Binary Tree PreOrder Traversal
leetcode.com Problem Statement Given the root of a binary tree, return its preorder traversal. Preorder Traversal follows: Root ↓ Left ↓ Right Brute…
Compare version numbers
Problem Statement Given two version strings: version1 version2 Each version consists of revisions separated by dots ( . ). Compare the two versions.…
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…
Sliding Window Maximum | Monotonic Deque
leetcode.com Problem Statement Given an array nums and an integer k , return the maximum element for every sliding window of size k . Brute Force In…
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…
Implement Queue using Stacks
leetcode.com Problem Statement Implement a Queue using Stack operations only. Support: push () pop () peek () empty () Brute Force Intuition Use one…
Implement Stack using Queue (using single queue)
leetcode.com Problem Statement Implement a Stack using only Queue operations. Support: push () pop () top () empty () Brute Force Intuition Use two…