Solutions for the Blind 75 Must Do Leetcode questions.
- Two Sum [solved]
- Best Time to Buy and Sell Stock [solved]
- Contains Duplicate [solved]
- Product of Array Except Self [solved]
- Maximum Subarray [solved]
- Maximum Product Subarray [solved]
- Find Minimum in Rotated Sorted Array [solved]
- Search in Rotated Sorted Array [solved]
- 3 Sum [solved]
- Container With Most Water [solved]
- Climbing Stairs [solved]
- Coin Change [solved]
- Longest Increasing Subsequence
- Longest Common Subsequence
- Word Break Problem
- Combination Sum
- House Robber
- House Robber II
- Decode Ways
- Unique Paths
- Jump Game [solved]
- Clone Graph
- Course Schedule
- Pacific Atlantic Water Flow
- Number of Islands
- Longest Consecutive Sequence
- Alien Dictionary (Leetcode Premium)
- Graph Valid Tree (Leetcode Premium)
- Number of Connected Components in an Undirected Graph (Leetcode Premium)
- Insert Interval [solved]
- Merge Intervals [solved]
- Non-overlapping Intervals
- Meeting Rooms (Leetcode Premium)
- Meeting Rooms II (Leetcode Premium)
- Reverse a Linked List
- Detect Cycle in a Linked List
- Merge Two Sorted Lists
- Merge K Sorted Lists
- Remove Nth Node From End Of List
- Reorder List
- Set Matrix Zeroes [solved]
- Spiral Matrix
- Rotate Image
- Word Search
- Longest Substring Without Repeating Characters [solved]
- Longest Repeating Character Replacement
- Minimum Window Substring
- Valid Anagram [solved]
- Group Anagrams [solved]
- Valid Parentheses [solved]
- Valid Palindrome [solved]
- Longest Palindromic Substring [solved]
- Palindromic Substrings
- Encode and Decode Strings (Leetcode Premium)
- Maximum Depth of Binary Tree
- Same Tree
- Invert/Flip Binary Tree
- Binary Tree Maximum Path Sum
- Binary Tree Level Order Traversal
- Serialize and Deserialize Binary Tree
- Subtree of Another Tree
- Construct Binary Tree from Preorder and Inorder Traversal
- Validate Binary Search Tree
- Kth Smallest Element in a BST
- Lowest Common Ancestor of BST
- Implement Trie (Prefix Tree)
- Add and Search Word
- Word Search II
- Top K Frequent Elements
- Find Median from Data Stream