A repository for practicing LeetCode problems and improving your coding skills.
Grind is a repository dedicated to helping you practice and improve your coding skills, with a focus on solving problems from LeetCode. Whether you're preparing for a technical interview, or just want to keep your skills sharp, Grind is here to help.
To get started with Grind, simply fork this repository to your own GitHub account, and then clone it to your local machine. From there, you can start solving problems and tracking your progress.
Each problem in Grind is stored in its own directory, along with a description of the problem, a sample solution in the language of your choice, and any additional resources or notes you need to help you solve the problem. To get started, simply pick a problem, read the description, and start coding!
If you'd like to contribute to Grind, simply submit a pull request with your solution to any of the problems in the repository. Your contributions are greatly appreciated, and will help make Grind a valuable resource for other coders.
- Two Sum
- Best Time to Buy and Sell Stock
- Contains Duplicate
- Product of Array Except Self
- Maximum Subarray
- Maximum Product Subarray
- Find Minimum in Rotated Sorted Array
- Search in Rotated Sorted Array
- 3Sum
- Container With Most Water
- Insert Interval
- Merge Intervals
- 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
- Longest Substring Without Repeating Characters
- Longest Repeating Character Replacement
- Minimum Window Substring
- Valid Anagram
- Group Anagrams
- Valid Parentheses
- Valid Palindrome
- Longest Palindromic Substring
- 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
- Climbing Stairs
- Coin Change
- Longest Increasing Subsequence
- Longest Common Subsequence
- Word Break Problem
- Combination Sum
- House Robber
- House Robber II
- Decode Ways
- Unique Paths
- Jump Game
- 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)
Blind - Curated List of Top 75 LeetCode Questions to Save Your Time
This repository is licensed under the MIT license. See the LICENSE file for more information.