lg.LUIS GARDUNO
DEVELOPER & EXPLORERLet’s talk
BACK TO THE NOTEBOOKTHE PRACTICE CORNER / BLIND75

One problem
at a time.

Small steps add up. My original Blind75 collection, with a little room to track your own progress. Check one off, flag one to revisit, and come back tomorrow.

11 / 75
SMALL WINS. STEADY PROGRESS.

75 PROBLEMS

Array

Find Minimum in Rotated Sorted ArrayMedium
Best Time To Buy and Sell Stock (max profit)Easy
Contains DuplicateEasy
Product of Array Except SelfMedium
Maximum SubarrayMedium
Maximum Product SubarrayMedium
Two SumEasy
Search in Rotated Sorted ArrayMedium
3 SumMedium
Container with Most WaterMedium

Binary

Sum of Two IntegersMedium
Number of 1 BitsEasy
Counting BitsEasy
Missing NumberEasy
Reverse BitsEasy

Dynamic Programming

Climbing StairsEasy
Coin ChangeMedium
Longest Increasing SubsequenceMedium
Longest Common SubsequenceMedium
Word Break ProblemMedium
Combination SumMedium
House RobberMedium
House Robber IIMedium
Decode WaysMedium
Unique WaysMedium
Jump GameMedium

Graph

Clone GraphMedium
Course ScheduleMedium
Pacific Atlantic Water FlowMedium
Number of IslandsMedium
Longest Consecutive SequenceMedium
Alien DictionaryHard
Graph Valid TreeMedium
Number of Connected Components in an Undirected GraphMedium

Interval

Insert IntervalMedium
Merge IntervalsMedium
Non-overlapping IntervalsMedium
Meeting RoomsEasy
Meeting Rooms IIMedium

Linked List

Reverse a Linked ListEasy
Detect Cycle in a Linked ListEasy
Merge Two Sorted ListsEasy
Remove Nth Node From End Of ListMedium
Reorder ListMedium

Heap

Merge K Sorted ListsHard
Top K Frequent ElementsMedium
Find Median from Data StreamHard

Matrix

Set Matrix ZeroesMedium
Spiral MatrixMedium
Rotate ImageMedium
Word SearchMedium

String

Longest Substring Without Repeating CharactersMedium
Longest Repeating Character ReplacementMedium
Minimum Window SubstringHard
Valid AnagramEasy
Group AnagramsMedium
Valid ParenthesesEasy
Valid PalindromeEasy
Longest Palindromic SubstringMedium
Palindromic SubstringsMedium
Encode and Decode stringsMedium

Tree

Maximum Depth of Binary TreeEasy
Same TreeEasy
Invert/Flip Binary TreeEasy
Binary Tree Maximum Path SumHard
Binary Tree Level Order TraversalMedium
Serialize and Deserialize Binary TreeHard
Subtree of Another TreeEasy
Construct Binary Tree from Preorder and Inorder TraversalMedium
Validate Binary Search TreeMedium
Kth Smallest Element in a BSTMedium
Lowest Common Ancestor of BSTMedium
Implement Trie (Prefix Tree)Medium
Add and Search WordMedium
Word Search IIHard
PROGRESS SAVES ON THIS DEVICE.Read the original notes ↗