LeetCode 78. Subsets
Link https://leetcode.com/problems/subsets/description/ Problem Given an integer array nums of unique elements, return all possible subsets (the power…
Latest News
⚑ Report a ProblemTech news from the best sources
All topics
- игры
AI
Gear
News
Tech
agents
ai
api
architecture
automation
beginners
career
claude
devchallenge
devops
javascript
llm
machinelearning
mcp
opensource
performance
productivity
programming
python
react
security
showdev
tutorial
typescript
webdev
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 valid.…
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 th…
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 of…
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 (Horizo…
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 no…
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 no…
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 F…
Compare version numbers
Problem Statement Given two version strings: version1 version2 Each version consists of revisions separated by dots ( . ). Compare the two versions. R…
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 thinkin…
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 mom…
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 rots…
Min Stack
leetcode.com Problem Statement Design a stack that supports the following operations in O(1) time: push ( x ) pop () top () getMin () getMin() should …
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 Intu…
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 i…
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 s…
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 qu…
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 d…
Как я в 14 лет написал свой аналог LeetCode с котиками за месяц (и немного поехал башкой)
Привет, Хабр! Мне 14 лет, и пока мои ровесники ругаются в cs2, а нормальные люди спят по 8 часов, я решил, что мне катастрофически не хватает стресса …
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 element…
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, re…
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 unde…
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 contain…
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 Diago…
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 cho…
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 must…
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] O…
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 numbe…
Java Solution - LeetCode Problem 1 Two Sum
Problem Description: Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to the target. You…
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 t…