Clicking on the question title takes you to the corresponding LeetCode submission page. Clicking on "Answer" takes you to my solution (in C++ code) and a markdown file explaining the thought process.
P.s. Safely ignore the checkboxes. It's for my personal use.
- Two Sum (Easy) - Answer
- Best Time to Buy and Sell Stock (Easy) - Answer
- Contains Duplicate (Easy) - Answer
- Maximum Subarray (Easy) - Answer
- Product of Array Except Self (Medium) - Answer
- Maximum Product Subarray (Medium) - Answer
- Find Minimum in Rotated Sorted Array (Medium) - Answer
- Search in Rotated Sorted Array (Medium) - Answer
- 3Sum (Medium)
- Container With Most Water (Medium)
- Valid Anagram (Easy) - Answer
- Valid Parentheses (Easy) - Answer
- Valid Palindrome (Easy) - Answer
- Longest Substring Without Repeating Characters (Medium) - Answer
- Longest Repeating Character Replacement (Medium)
- Group Anagrams (Medium)
- Longest Palindromic Substring (Medium)
- Palindromic Substrings (Medium)
- Minimum Window Substring (Hard)
- Climbing Stairs (Easy) - Answer
- House Robber (Easy)
- Coin Change (Medium)
- Longest Increasing Subsequence (Medium)
- Longest Common Subsequence (Medium)
- Word Break (Medium)
- Combination Sum IV (Medium)
- House Robber II (Medium)
- Decode Ways (Medium)
- Unique Paths (Medium)
- Jump Game (Medium)
- Reverse a Linked List (Easy)
- Detect Cycle in a Linked List (Easy)
- Merge Two Sorted Lists (Easy)
- Remove Nth Node From End Of List (Medium)
- Reorder List (Medium)
- Merge Intervals (Medium)
- Non-overlapping Intervals (Medium)
- Insert Interval (Hard)
- Set Matrix Zeroes (Medium)
- Spiral Matrix (Medium)
- Rotate Image (Medium)
- Word Search (Medium)
- Top K Frequent Elements (Medium)
- Merge K Sorted Lists (Hard)
- Find Median from Data Stream (Hard)
- Maximum Depth of Binary Tree (Easy)
- Same Tree (Easy)
- Invert/Flip Binary Tree (Easy)
- Subtree of Another Tree (Easy)
- Lowest Common Ancestor of BST (Easy)
- Binary Tree Level Order Traversal (Medium)
- Construct Binary Tree from Preorder and Inorder Traversal (Medium)
- Validate Binary Search Tree (Medium)
- Kth Smallest Element in a BST (Medium)
- Implement Trie, i.e. Prefix Tree (Medium)
- Add and Search Word (Medium)
- Binary Tree Maximum Path Sum (Hard)
- Serialize and Deserialize Binary Tree (Hard)
- Word Search II (Hard)
- Number of Islands (Medium)
- Clone Graph (Medium)
- Course Schedule (Medium)
- Pacific Atlantic Water Flow (Medium)
- Longest Consecutive Sequence (Hard)
- Sum of Two Integers (Easy)
- Number of 1 Bits (Easy)
- Missing Number (Easy)
- Reverse Bits (Easy)
- Counting Bits (Medium)