Problems

97 problems found
3Summedium
Two Pointers•Blind 75
Add Two Numbersmedium
Linked List•Blind 75
Alien Dictionaryhard
Graphs•Blind 75
Balanced Binary Treeeasy
Trees•Blind 75
Best Time to Buy and Sell Stockeasy
Sliding Window•Blind 75
Best Time to Buy and Sell Stock with Cooldownmedium
2D DP•DP Mastery
Binary Searcheasy
Binary Search•Blind 75
Binary Tree Level Order Traversalmedium
Trees•Blind 75
Binary Tree Maximum Path Sumhard
Trees•Blind 75
Binary Tree Right Side Viewmedium
Trees•Blind 75
Burst Balloonshard
2D DP•DP Mastery
Car Fleetmedium
Stack•Blind 75
Climbing Stairseasy
1D DP•DP Mastery
Clone Graphmedium
Graphs•Blind 75
Coin Changemedium
1D DP•DP Mastery
Coin Change IImedium
2D DP•DP Mastery
Construct Binary Tree from Preorder and Inordermedium
Trees•Blind 75
Container With Most Watermedium
Two Pointers•Blind 75
Contains Duplicateeasy
Arrays & Hashing•Blind 75
Copy List with Random Pointermedium
Linked List•Blind 75
Count Good Nodes in Binary Treemedium
Trees•Blind 75
Course Schedulemedium
Graphs•Blind 75
Course Schedule IImedium
Graphs•Blind 75
Daily Temperaturesmedium
Stack•Blind 75
Decode Waysmedium
1D DP•DP Mastery
Design Twittermedium
Heap•Blind 75
Diameter of Binary Treeeasy
Trees•Blind 75
Edit Distancemedium
2D DP•DP Mastery
Encode and Decode Stringsmedium
Arrays & Hashing•Blind 75
Evaluate Reverse Polish Notationmedium
Stack•Blind 75
Find Median from Data Streamhard
Heap•Blind 75
Find Minimum in Rotated Sorted Arraymedium
Binary Search•Blind 75
Find the Duplicate Numbermedium
Linked List•Blind 75
Generate Parenthesesmedium
Stack•Blind 75
Graph Valid Treemedium
Graphs•Blind 75
Group Anagramsmedium
Arrays & Hashing•Blind 75
House Robbermedium
1D DP•DP Mastery
House Robber IImedium
1D DP•DP Mastery
Interleaving Stringmedium
2D DP•DP Mastery
Invert Binary Treeeasy
Trees•Blind 75
K Closest Points to Originmedium
Heap•Blind 75
Koko Eating Bananasmedium
Binary Search•Blind 75
Kth Largest Element in a Streameasy
Heap•Blind 75
Kth Largest Element in an Arraymedium
Heap•Blind 75
Kth Smallest Element in a BSTmedium
Trees•Blind 75
Largest Rectangle in Histogramhard
Stack•Blind 75
Last Stone Weighteasy
Heap•Blind 75
Linked List Cycleeasy
Linked List•Blind 75
Longest Common Subsequencemedium
2D DP•DP Mastery
Longest Consecutive Sequencemedium
Arrays & Hashing•Blind 75
Longest Increasing Subsequencemedium
1D DP•DP Mastery
Longest Palindromic Substringmedium
1D DP•DP Mastery
Longest Repeating Character Replacementmedium
Sliding Window•Blind 75
Longest Substring Without Repeating Charactersmedium
Sliding Window•Blind 75
Lowest Common Ancestor of a BSTmedium
Trees•Blind 75
LRU Cachemedium
Linked List•Blind 75
Maximum Depth of Binary Treeeasy
Trees•Blind 75
Maximum Product Subarraymedium
1D DP•DP Mastery
Maximum Subarraymedium
Arrays•Beginner Friendly
Median of Two Sorted Arrayshard
Binary Search•Blind 75
Merge k Sorted Listshard
Linked List•Blind 75
Merge Two Sorted Listseasy
Linked List•Blind 75
Min Cost Climbing Stairseasy
1D DP•DP Mastery
Min Stackmedium
Stack•Blind 75
Minimum Window Substringhard
Sliding Window•Blind 75
Number of Connected Componentsmedium
Graphs•Blind 75
Number of Islandsmedium
Graphs•Blind 75
Pacific Atlantic Water Flowmedium
Graphs•Blind 75
Palindromic Substringsmedium
1D DP•DP Mastery
Partition Equal Subset Summedium
1D DP•DP Mastery
Permutation in Stringmedium
Sliding Window•Blind 75
Product of Array Except Selfmedium
Arrays & Hashing•Blind 75
Regular Expression Matchinghard
2D DP•DP Mastery
Remove Nth Node From End of Listmedium
Linked List•Blind 75
Reorder Listmedium
Linked List•Blind 75
Reverse Linked Listeasy
Linked List•Blind 75
Reverse Nodes in k-Grouphard
Linked List•Blind 75
Same Treeeasy
Trees•Blind 75
Search a 2D Matrixmedium
Binary Search•Blind 75
Search in Rotated Sorted Arraymedium
Binary Search•Blind 75
Serialize and Deserialize Binary Treehard
Trees•Blind 75
Sliding Window Maximumhard
Sliding Window•Blind 75
Subtree of Another Treeeasy
Trees•Blind 75
Target Summedium
2D DP•DP Mastery
Task Schedulermedium
Heap•Blind 75
Time Based Key-Value Storemedium
Binary Search•Blind 75
Top K Frequent Elementsmedium
Arrays & Hashing•Blind 75
Trapping Rain Waterhard
Two Pointers•Blind 75
Two Sumeasy
Arrays & Hashing•Blind 75
Two Sum IImedium
Two Pointers•Blind 75
Unique Pathsmedium
2D DP•DP Mastery
Valid Anagrameasy
Arrays & Hashing•Blind 75
Valid Palindromeeasy
Two Pointers•Blind 75
Valid Parentheseseasy
Stack•Blind 75
Valid Sudokumedium
Arrays & Hashing•Blind 75
Validate Binary Search Treemedium
Trees•Blind 75
Word Breakmedium
1D DP•DP Mastery