Blind 75
75 problems · 10 topics · source ↗
0 / 75 solved0%
optimal Big-OO(1) · O(log n)constant / logO(n) · O(n log n)linear / n log nO(n²) · O(m·n)quadratic / polyO(2ⁿ) · O(n!)exponential
Array
0/10- Two Sum↗EasyO(n)
- Best Time to Buy and Sell Stock↗EasyO(n)
- Contains Duplicate↗EasyO(n)
- Product of Array Except Self↗MediumO(n)
- Maximum Subarray↗MediumO(n)
- Maximum Product Subarray↗MediumO(n)
- Find Minimum in Rotated Sorted Array↗MediumO(log n)
- Search in Rotated Sorted Array↗MediumO(log n)
- 3Sum↗MediumO(n^2)
- Container with Most Water↗MediumO(n)
Binary
0/5- Sum of Two Integers↗MediumO(1)
- Number of 1 Bits↗EasyO(1)
- Counting Bits↗EasyO(n)
- Missing Number↗EasyO(n)
- Reverse Bits↗EasyO(1)
Dynamic Programming
0/11- Climbing Stairs↗EasyO(n)
- Coin Change↗MediumO(n·A)
- Longest Increasing Subsequence↗MediumO(n log n)
- Longest Common Subsequence↗MediumO(m·n)
- Word Break↗MediumO(n^2)
- Combination Sum↗MediumO(2^n)
- House Robber↗MediumO(n)
- House Robber II↗MediumO(n)
- Decode Ways↗MediumO(n)
- Unique Paths↗MediumO(m·n)
- Jump Game↗MediumO(n)
Graph
0/8- Clone Graph↗MediumO(V+E)
- Course Schedule↗MediumO(V+E)
- Pacific Atlantic Water Flow↗MediumO(m·n)
- Number of Islands↗MediumO(m·n)
- Longest Consecutive Sequence↗MediumO(n)
- Alien Dictionarypremium↗HardO(V+E)
- Graph Valid Treepremium↗MediumO(V+E)
- Number of Connected Components in an Undirected Graphpremium↗MediumO(V+E)
Interval
0/5- Insert Interval↗MediumO(n)
- Merge Intervals↗MediumO(n log n)
- Non Overlapping Intervals↗MediumO(n log n)
- Meeting Roomspremium↗EasyO(n log n)
- Meeting Rooms IIpremium↗MediumO(n log n)
Linked List
0/6- Reverse Linked List↗EasyO(n)
- Linked List Cycle↗EasyO(n)
- Merge Two Sorted Lists↗EasyO(n+m)
- Merge K Sorted Lists↗HardO(n log k)
- Remove Nth Node from End of List↗MediumO(n)
- Reorder List↗MediumO(n)
Matrix
0/4- Set Matrix Zeroes↗MediumO(m·n)
- Spiral Matrix↗MediumO(m·n)
- Rotate Image↗MediumO(n^2)
- Word Search↗MediumO(m·n·4^L)
String
0/10- Longest Substring Without Repeating Characters↗MediumO(n)
- Longest Repeating Character Replacement↗MediumO(n)
- Minimum Window Substring↗HardO(n)
- Valid Anagram↗EasyO(n)
- Group Anagrams↗MediumO(n·k)
- Valid Parentheses↗EasyO(n)
- Valid Palindrome↗EasyO(n)
- Longest Palindromic Substring↗MediumO(n^2)
- Palindromic Substrings↗MediumO(n^2)
- Encode and Decode Stringspremium↗MediumO(n)
Tree
0/14- Maximum Depth of Binary Tree↗EasyO(n)
- Same Tree↗EasyO(n)
- Invert Binary Tree↗EasyO(n)
- Binary Tree Maximum Path Sum↗HardO(n)
- Binary Tree Level Order Traversal↗MediumO(n)
- Serialize and Deserialize Binary Tree↗HardO(n)
- Subtree of Another Tree↗EasyO(n·m)
- Construct Binary Tree from Preorder and Inorder Traversal↗MediumO(n)
- Validate Binary Search Tree↗MediumO(n)
- Kth Smallest Element in a BST↗MediumO(n)
- Lowest Common Ancestor of a Binary Search Tree↗MediumO(h)
- Implement Trie Prefix Tree↗MediumO(n)
- Design Add and Search Words Data Structure↗MediumO(n)
- Word Search II↗HardO(m·n·4^L)
Heap
0/3- Merge K Sorted Lists↗HardO(n log k)
- Top K Frequent Elements↗MediumO(n log k)
- Find Median from Data Stream↗HardO(log n)