This repository contains (not only) solutions(Neetcode) to the "Grind 75" LeetCode problems as outlined by the Tech Interview Handbook. These problems are curated to prepare for technical interviews and are solved over 5 weeks. Access the Link here!
- Two Sum
- Valid Parentheses
- Merge Two Sorted Lists
- Best Time to Buy and Sell Stock
- Valid Palindrome
- Invert Binary Tree
- Valid Anagram
- Binary Search
- Flood Fill
- Lowest Common Ancestor of a Binary Search Tree
- Balanced Binary Tree
- Linked List Cycle
- Implement Queue using Stacks
- First Bad Version
- Ransom Note
- Climbing Stairs
- Longest Palindrome
- Reverse Linked List
- Majority Element
- Add Binary
- Diameter of Binary Tree
- Middle of the Linked List
- Maximum Depth of Binary Tree
- Contains Duplicate
- Maximum Subarray
- Insert Interval
- 01 Matrix
- K Closest Points to Origin
- Longest Substring Without Repeating Characters
- 3Sum
- Binary Tree Level Order Traversal
- Clone Graph
- Evaluate Reverse Polish Notation
- Course Schedule
- Implement Trie (Prefix Tree)
- Coin Change
- Product of Array Except Self
- Min Stack
- Validate Binary Search Tree
- Number of Islands
- Rotting Oranges
- Search in Rotated Sorted Array
- Combination Sum
- Permutations
- Merge Intervals
- Lowest Common Ancestor of a Binary Tree
- Time Based Key-Value Store
- Accounts Merge
- Sort Colors
- Word Break
- Partition Equal Subset Sum
- String to Integer (atoi)
- Spiral Matrix
- Subsets
- Binary Tree Right Side View
- Longest Palindromic Substring
- Unique Paths
- Construct Binary Tree from Preorder and Inorder Traversal
- Container With Most Water
- Letter Combinations of a Phone Number
- Word Search
- Find All Anagrams in a String
- Minimum Height Trees
- Task Scheduler
- LRU Cache
- Kth Smallest Element in a BST
- Minimum Window Substring
- Serialize and Deserialize Binary Tree
- Trapping Rain Water
- Find Median from Data Stream
- Word Ladder
- Basic Calculator
- Maximum Profit in Job Scheduling
- Merge k Sorted Lists
- Largest Rectangle in Histogram