LeetCodechevron_rightDifficulty trackschevron_rightHard
Practice by pressure level

Hard LeetCode problems

Hard is best used as a pressure-calibration track for solving stability, complexity explanation, and follow-up handling. The page keeps the useful training cues, then tucks the large corpus into a progressive-loading bank.

database679 problemscategory8 high-frequency topicsboltInterview drill track

Training brief

Focus

Stress-test edge reasoning and optimization depth.

Cadence

Run 1-3 problems per round and rehearse follow-ups, optimizations, and edge defense.

Best paired with

Cross-train with graph, tree, DP, and design topics to keep high-pressure reps honest.

Training focus

Stress-test edge reasoning and optimization depth.

Cadence

Run 1-3 problems per round and rehearse follow-ups, optimizations, and edge defense.

Pair with

Cross-train with graph, tree, DP, and design topics to keep high-pressure reps honest.

Problem bank

Hard difficulty bank

The full corpus is no longer dumped onto the page. Search fast, narrow by high-frequency topic, and let the bank load progressively inside its own container.

Progressive training bank

Made for large difficulty tracks: scan the structure first, then dig deeper.

hourglass_bottomScroll inside to continue
search
categoryTopic focus

Showing 24 / 679 problems

+24 per load
#TitleDifficulty
4

Median of Two Sorted Arrays

Find the median of two sorted arrays using binary search for efficient O(log(min(m, n))) time complexity.

Hard
10

Regular Expression Matching

The Regular Expression Matching problem involves checking if a string matches a pattern using '.' and '*'.

Hard
23

Merge k Sorted Lists

Merge k Sorted Lists requires efficiently combining multiple sorted linked lists into one using pointers and priority qu…

Hard
25

Reverse Nodes in k-Group

Reverse Nodes in k-Group challenges you to reverse segments of a linked list in groups of size k.

Hard
30

Substring with Concatenation of All Words

Find all starting indices of substrings in a string that are concatenations of a given list of words.

Hard
32

Longest Valid Parentheses

Compute the length of the longest well-formed parentheses substring using state transition dynamic programming and stack…

Hard
37

Sudoku Solver

Solve the Sudoku puzzle by filling empty cells while respecting Sudoku's rules using array scanning and backtracking.

Hard
41

First Missing Positive

Identify the smallest missing positive integer in an unsorted array using constant space and linear time scanning techni…

Hard
42

Trapping Rain Water

Calculate the total trapped rain water using the elevation map array, leveraging dynamic programming and two-pointer pat…

Hard
44

Wildcard Matching

Implement full wildcard pattern matching using '?' and '*' by applying state transition dynamic programming with careful…

Hard
51

N-Queens

Solve the N-Queens problem using backtracking with pruning, exploring all valid board placements while avoiding conflict…

Hard
52

N-Queens II

Solve the N-Queens II problem using backtracking with pruning to efficiently count all valid placements for n queens on …

Hard
60

Permutation Sequence

Find the kth permutation sequence of a set of numbers using math and recursion to efficiently compute the result.

Hard
65

Valid Number

Determine if a given string represents a valid number using precise string parsing and character validation rules.

Hard
68

Text Justification

Text Justification requires packing words into lines to match a specified width, ensuring even distribution of spaces.

Hard
76

Minimum Window Substring

Find the smallest substring of s containing all characters from t using a sliding window with running state updates for …

Hard
84

Largest Rectangle in Histogram

Find the maximal rectangular area in a histogram using stack-based state management for precise bar tracking and width c…

Hard
85

Maximal Rectangle

Compute the largest rectangle of 1's in a binary matrix using dynamic programming and stack-based state transitions effi…

Hard
87

Scramble String

Scramble String is a dynamic programming problem where we determine if one string can be scrambled to form another using…

Hard
115

Distinct Subsequences

Compute the number of distinct subsequences of one string matching another using precise state transition dynamic progra…

Hard
123

Best Time to Buy and Sell Stock III

Determine the maximum profit from at most two stock transactions using state transition dynamic programming on price arr…

Hard
124

Binary Tree Maximum Path Sum

Calculate the maximum sum of any path in a binary tree by exploring all node sequences using DFS and dynamic programming…

Hard
126

Word Ladder II

Find all shortest transformation sequences from beginWord to endWord using a dictionary, leveraging backtracking search …

Hard
127

Word Ladder

Find the shortest transformation sequence from a start word to an end word, with each word in the sequence differing by …

Hard

swap_vertScroll inside the bank to auto-load more

Continue by topic

Once you know the weak spots, jump into narrower topic hubs for targeted reps at the same pressure level.

route

Guided Practice Path

AI recommends problems by your level and tracks your progress.

Start Guided Patharrow_forward
Hard LeetCode Problems