Leetcode
Leetcode solutions
Install / Use
/learn @gouthampradhan/LeetcodeREADME
Leetcode solutions in Java
My accepted leetcode solutions to some of the common interview problems. Also, some solutions have youtube video link.
Array
- Pascals Traiangle II (Easy)
- Product Of Array Except Self (Medium)
- Rotate Matrix (Medium)
- Set Matrix Zeroes (Medium)
- Third Maximum Number (Easy)
- Two Sum (Easy)
- TwoSum II (Easy)
- Can Place Flowers (Easy)
- Merge Intervals (Medium)
First Missing Positive (Hard)
- Fruit Into Baskets (Medium)
- MaxProduct Of Three Numbers (Easy)
- Missing Number (Easy)
- Merge Sorted Array (Easy)
- Rotate Array (Easy)
- Sort Colors (Medium)
- Battleships in a Board (Medium)
- Find the Celebrity (Medium)
- Meeting Rooms (Easy)
- Longest Continuous Increasing Subsequence (Easy)
- Sparse Matrix Multiplication (Medium)
- Read N Characters Given Read4 (Easy)
- Maximum Swap (Medium)
- H-Index (Medium)
Insert Interval (Hard)
- Increasing Triplet Subsequence (Medium)
K Empty Slots (Hard)
- Subarray Sum Equals K (Medium)
- Pour Water (Medium)
- Relative Ranks (Easy)
- Next Greater Element I (Easy)
- Largest Number At Least Twice of Others (Easy)
- Minimum Moves to Equal Array Elements II (Median)
- Image Smoother (Easy)
- Minimum Index Sum of Two Lists (Easy)
- Card Flipping Game (Medium)
Employee Free Time (Hard)
Best Meeting Point (Hard)
My Calendar III (Hard)
- Champagne Tower (Medium)
- Valid Tic-Tac-Toe State (Medium)
- Number of Subarrays with Bounded Maximum (Medium)
- Surface Area of 3D Shapes (Easy)
- Max Consecutive Ones (Easy)
- Max Consecutive Ones II (Medium)
- Add to Array-Form of Integer (Easy)
- Find Pivot Index (Easy)
- Largest Time for Given Digits (Easy)
- Minimum Time Difference (Medium)
- Reveal Cards In Increasing Order (Medium)
- Sort Array By Parity II (Easy)
- Matrix Cells in Distance Order (Easy)
- Maximum Sum of Two Non-Overlapping Subarrays (Medium)
- Longest Line of Consecutive One in Matrix (Medium)
- Array Partition I (Easy)
- Relative Sort Array (Easy)
- Meeting Scheduler (Medium)
- Minimum Swaps to Group All 1's Together (Medium)
- Array Nesting (Medium)
Backtracking
- Combinations (Medium)
- Combinations Sum (Medium)
- Combinations Sum II (Medium)
- Letter Phone Number (Medium)
- Paliandrome Partitioning (Medium)
- Permutations (Medium)
- Permutations II (Medium)
- SubSets (Medium)
- SubSet II (Medium)
- Word Search (Medium)
Word Search II (Hard)
- Generate Parentheses (Medium)
Remove Invalid Parentheses (Hard)
Regular Expression Matching (Hard)
Expression Add Operators (Hard)
Wildcard Matching (Hard)
- Letter Case Permutation (Easy)
Zuma Game (Hard)
- Matchsticks to Square (Medium)
Binary Search
- Minimum Sorted Rotated Array (Medium)
- Search in a Rotated Sorted Array (Medium)
- Search for a Range (Medium)
- Sqrt(x) (Easy)
- Search Insert Position (Easy)
Median of Two Sorted Arrays (Hard)
- Pow(x, n) (Medium)
- Find Peak Element (Medium)
- Target Sum (Medium)
- H-Index II (Medium)
Swim in Rising Water (Hard)
- Time Based Key-Value Store (Medium)
Minimum Window Subsequence (Hard)
Koko Eating Bananas (Hard)
- Single Element in a Sorted Array (Medium)
Minimize the Maximum Adjacent Element Difference (Hard)
Bit Manipulation
- Gray Code (Medium)
- Hamming Distance (Easy)
- Total Hamming Distance (Medium)
- Divide Two Integers (Medium)
- Binary Number with Alternating Bits (Easy)
- Binary Watch (Easy)
Breadth First Search
- Binaray Tree Level Order Traversal (Medium)
- Word Ladder (Medium)
Word Ladder II
