Lists of company wise questions available on leetcode premium. Every csv file in the companies directory corresponds to a list of questions on leetcode for a specific company based on the leetcode company tags. Updated as of May, 2022.
Jupyter Notebook
11,380
37 commits
updated Jul 16, 2024
Curated lists of Leetcode questions group by companies, updated as of May, 2022.
Shout out to fishercoder1534 for the awesome Leetcode repo for solutions.
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | Stone Game VI | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 3 | Two Sum | Easy | Java, C++, Javascript |
| 2 | Count Odd Numbers in an Interval Range | Easy | Solution |
| 2 | Merge Two Sorted Lists | Easy | Solution |
| 2 | Palindrome Number | Easy | Java, C++ |
| 1 | Find Subsequence of Length K With the Largest Sum | Easy | Java |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 2 | Minimum ASCII Delete Sum for Two Strings | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 52 | Two Sum | Easy | Java, C++, Javascript |
| 19 | Median of Two Sorted Arrays | Hard | Solution, C++ |
| 16 | Roman to Integer | Easy | Solution |
| 13 | Reverse Integer | Easy | Solution, C++ |
| 12 | Maximum Subarray | Easy | Solution |
| 12 | Contains Duplicate | Easy | Solution |
| 12 | Longest Palindromic Substring | Medium | Solution |
| 11 | Merge Two Sorted Lists | Easy | Solution |
| 11 | Longest Common Prefix | Easy | Solution |
| 10 | Add Two Numbers | Medium | Solution |
| 9 | Container With Most Water | Medium | Solution |
| 9 | 3Sum | Medium | Solution, C++ |
| 8 | Valid Parentheses | Easy | Solution |
| 8 | Merge Intervals | Medium | Solution |
| 8 | First Missing Positive | Hard | Solution |
| 8 | Best Time to Buy and Sell Stock | Easy | Solution |
| 7 | Search Insert Position | Easy | Solution |
| 7 | Search in Rotated Sorted Array | Medium | Solution |
| 7 | Trapping Rain Water | Hard | Solution |
| 7 | Product of Array Except Self | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 10 | Insert Delete GetRandom O(1) | Medium | Solution |
| 6 | Design Hit Counter | Medium | Solution |
| 4 | Group Anagrams | Medium | Solution |
| 3 | Insert Delete GetRandom O(1) - Duplicates allowed | Hard | Solution |
| 3 | Valid Anagram | Easy | Solution |
| 2 | Optimal Account Balancing | Hard | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 14 | Palindrome Pairs | Hard | Solution |
| 14 | Alien Dictionary | nan | Solution |
| 9 | Flatten 2D Vector | Medium | Solution |
| 7 | Smallest Common Region | Medium | Solution |
| 6 | Pour Water | Medium | Solution |
| 6 | Minimum Window Substring | Hard | Solution |
| 5 | Combination Sum | Medium | Solution |
| 4 | Flatten Nested List Iterator | Medium | Solution |
| 3 | Design Circular Queue | Medium | Solution |
| 3 | Fraction to Recurring Decimal | Medium | Solution |
| 2 | Find the Smallest Divisor Given a Threshold | nan | Solution |
| 2 | Tag Validator | Hard | Solution |
| 2 | Intersection of Two Linked Lists | Easy | Solution |
| 1 | Pyramid Transition Matrix | Medium | Solution |
| 1 | Mini Parser | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | N-Repeated Element in Size 2N Array | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 8 | Increasing Decreasing String | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 3 | H-Index | Medium | Solution |
| 2 | Best Time to Buy and Sell Stock | Easy | Solution |
| 2 | Group Anagrams | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | Path Sum IV | Medium | Solution |
| 1 | Split Concatenated Strings | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | Number Of Rectangles That Can Form The Largest Square | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 117 | Two Sum | Easy | Java, C++, Javascript |
| 117 | LRU Cache | Hard | Solution |
| 103 | Number of Islands | Medium | Solution |
| 87 | Merge Intervals | Medium | Solution |
| 68 | Search Suggestions System | Medium | Solution |
| 56 | Best Time to Buy and Sell Stock | Easy | Solution |
| 51 | Group Anagrams | Medium | Solution |
| 50 | Analyze User Website Visit Pattern | Medium | Solution |
| 49 | Longest Substring Without Repeating Characters | Medium | Solution, C++ |
| 49 | K Closest Points to Origin | Easy | Solution |
| 48 | Meeting Rooms II | Medium | Solution |
| 47 | Merge k Sorted Lists | Hard | Solution |
| 45 | Trapping Rain Water | Hard | Solution |
| 44 | 3Sum | Medium | Solution, C++ |
| 43 | Valid Parentheses | Easy | Solution |
| 41 | Word Ladder | Hard | Solution |
| 40 | Median of Two Sorted Arrays | Hard | Solution, C++ |
| 36 | Add Two Numbers | Medium | Solution |
| 36 | Word Search | Medium | Solution |
| 35 | Maximum Subarray | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 3 | Reorder Routes to Make All Paths Lead to the City Zero | Medium | Solution |
| 3 | Valid Palindrome | Easy | Solution |
| 3 | Two Sum | Easy | Java, C++, Javascript |
| 2 | Reducing Dishes | Hard | Solution |
| 2 | 3Sum | Medium | Solution, C++ |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 40 | Two Sum | Easy | Java, C++, Javascript |
| 20 | LRU Cache | Hard | Solution |
| 19 | Add Two Numbers | Medium | Solution |
| 18 | Merge Intervals | Medium | Solution |
| 17 | Maximum Subarray | Easy | Solution |
| 16 | Longest Substring Without Repeating Characters | Medium | Solution, C++ |
| 15 | Median of Two Sorted Arrays | Hard | Solution, C++ |
| 14 | Longest Common Prefix | Easy | Solution |
| 13 | Roman to Integer | Easy | Solution |
| 11 | Spiral Matrix | Medium | Solution |
| 11 | Group Anagrams | Medium | Solution |
| 11 | Number of Islands | Medium | Solution |
| 10 | Word Break | Medium | Solution |
| 10 | Product of Array Except Self | Medium | Solution |
| 10 | 3Sum | Medium | Solution, C++ |
| 9 | Generate Parentheses | Medium | Solution |
| 8 | Rotate Image | Medium | Solution |
| 8 | Move Zeroes | Easy | Solution |
| 8 | Best Time to Buy and Sell Stock | Easy | Solution |
| 8 | Merge k Sorted Lists | Hard | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 4 | Maximum Length of Subarray With Positive Product | Medium | Solution |
| 2 | Broken Calculator | Medium | Solution |
| 2 | Minimum Size Subarray Sum | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 3 | Valid Parentheses | Easy | Solution |
| 2 | Compare Version Numbers | Easy | Solution |
| 2 | Restore IP Addresses | Medium | Solution |
| 1 | Construct String With Repeat Limit | Medium | Java |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 13 | Product of Array Except Self | Medium | Solution |
| 5 | K Closest Points to Origin | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 4 | Degree of an Array | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 18 | Rank Teams by Votes | Medium | Solution |
| 10 | Logger Rate Limiter | Easy | Solution |
| 4 | Lemonade Change | Easy | Solution |
| 3 | Design Snake Game | Medium | Solution |
| 2 | Greatest Common Divisor of Strings | Easy | Solution |
| 2 | Single Number | Easy | Solution |
| 2 | Best Time to Buy and Sell Stock | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | Out of Boundary Paths | Hard | Solution |
| 1 | Zuma Game | Hard | Solution |
| 1 | Arithmetic Slices II - Subsequence | Hard | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 2 | Valid Parentheses | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 6 | Group Anagrams | Medium | Solution |
| 2 | Evaluate Division | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 64 | Design Underground System | Medium | Solution |
| 33 | Number of Islands | Medium | Solution |
| 33 | Decode String | Medium | Solution |
| 28 | Flatten a Multilevel Doubly Linked List | Medium | Solution |
| 26 | Remove All Adjacent Duplicates in String II | Medium | Solution |
| 23 | Insert Delete GetRandom O(1) | Medium | Solution |
| 23 | Longest Substring Without Repeating Characters | Medium | Solution, C++ |
| 20 | Merge Intervals | Medium | Solution |
| 20 | Meeting Rooms II | Medium | Solution |
| 20 | Design an Ordered Stream | Easy | Solution |
| 19 | LRU Cache | Hard | Solution |
| 16 | Two Sum | Easy | Java, C++, Javascript |
| 16 | Add Two Numbers | Medium | Solution |
| 15 | Trapping Rain Water | Hard | Solution |
| 14 | Validate Binary Search Tree | Medium | Solution |
| 14 | Two City Scheduling | Easy | Solution |
| 14 | Valid Parentheses | Easy | Solution |
| 14 | Word Search | Medium | Solution |
| 13 | First Unique Character in a String | Easy | Solution |
| 12 | Best Time to Buy and Sell Stock | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 5 | Check if All Characters Have Equal Number of Occurrences | Easy | Solution |
| 3 | Reverse Words in a String III | Easy | Solution |
| 3 | Word Pattern | Easy | Solution |
| 2 | Subarray Sum Equals K | Medium | Solution |
| 2 | Word Pattern II | Hard | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 3 | Least Number of Unique Integers after K Removals | Medium | Solution |
| 3 | Backspace String Compare | Easy | Solution |
| 3 | Additive Number | Medium | Solution |
| 2 | Integer to English Words | Hard | Solution |
| 2 | Sliding Window Maximum | Hard | Solution |
| 2 | Valid Parentheses | Easy | Solution |
| 1 | Two Out of Three | Easy | Java |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 12 | Number of 1 Bits | Easy | Solution |
| 4 | Word Ladder II | Hard | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 8 | Merge k Sorted Lists | Hard | Solution |
| 6 | Number of Islands | Medium | Solution |
| 6 | Search in Rotated Sorted Array | Medium | Solution |
| 6 | Binary Tree Maximum Path Sum | Hard | Solution |
| 5 | LRU Cache | Hard | Solution |
| 4 | The Maze | Medium | Solution |
| 4 | Basic Calculator II | Medium | Solution |
| 4 | Sliding Window Maximum | Hard | Solution |
| 4 | The Number of Weak Characters in the Game | Medium | Solution |
| 3 | Best Time to Buy and Sell Stock II | Easy | Solution |
| 3 | Course Schedule II | Medium | Solution |
| 3 | Longest Valid Parentheses | Hard | Solution |
| 3 | Combination Sum | Medium | Solution |
| 3 | N-Queens | Hard | Solution |
| 3 | Maximum Subarray | Easy | Solution |
| 3 | Best Time to Buy and Sell Stock | Easy | Solution |
| 3 | Sort List | Medium | Solution |
| 3 | Closest Dessert Cost | Medium | Solution |
| 3 | 3Sum | Medium | Solution, C++ |
| 3 | Basic Calculator | Hard | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 3 | Pairs of Songs With Total Durations Divisible by 60 | Easy | Solution |
| 3 | Daily Temperatures | Medium | Solution |
| 3 | Generate Parentheses | Medium | Solution |
| 2 | Sort Array by Increasing Frequency | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | Divide a String Into Groups of Size k | Easy | Java |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 18 | License Key Formatting | Medium | Solution |
| 14 | Count Primes | Easy | Solution |
| 13 | Reverse Nodes in k-Group | Hard | Solution |
| 4 | Best Time to Buy and Sell Stock | Easy | Solution |
| 3 | Candy Crush | Medium | Solution |
| 3 | Integer to Roman | Medium | Solution |
| 2 | Rotating the Box | Medium | Solution |
| 2 | Restore the Array From Adjacent Pairs | Medium | Solution |
| 2 | Add Two Numbers | Medium | Solution |
| 1 | Four Divisors | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | Maximum Erasure Value | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 16 | Word Search II | Hard | Solution |
| 16 | Rotate Image | Medium | Solution |
| 11 | Maximum Subarray | Easy | Solution |
| 11 | Expressive Words | Medium | Solution |
| 9 | Decode Ways | Medium | Solution |
| 8 | Validate IP Address | Medium | Solution |
| 8 | Decode String | Medium | Solution |
| 6 | House Robber | Easy | Solution |
| 6 | Maximum Difference Between Increasing Elements | Easy | Java |
| 5 | Valid Parentheses | Easy | Solution |
| 4 | Number of 1 Bits | Easy | Solution |
| 3 | Top K Frequent Elements | Medium | Solution |
| 3 | Beautiful Arrangement | Medium | Solution |
| 3 | Unique Paths II | Medium | Solution |
| 2 | Coin Change 2 | Medium | Solution |
| 2 | First Bad Version | Easy | Solution |
| 2 | Maximum Population Year | Easy | Solution |
| 2 | Best Time to Buy and Sell Stock | Easy | Solution |
| 2 | Find Pivot Index | Easy | Solution |
| 2 | Merge Intervals | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 8 | Pairs of Songs With Total Durations Divisible by 60 | Easy | Solution |
| 5 | Range Addition | Medium | Solution |
| 4 | Sliding Window Maximum | Hard | Solution |
| 2 | Transpose Matrix | Easy | Solution |
| 2 | Best Time to Buy and Sell Stock IV | Hard | Solution |
| 2 | Trapping Rain Water | Hard | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | Find All Groups of Farmland | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 2 | Largest BST Subtree | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | Count Vowel Substrings of a String | Easy | Java |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 2 | Rank Teams by Votes | Medium | Solution |
| 2 | Wildcard Matching | Hard | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 9 | Unique Paths II | Medium | Solution |
| 5 | Valid Sudoku | Medium | Solution, Javascript |
| 3 | Synonymous Sentences | Medium | Solution |
| 3 | The Skyline Problem | Hard | Solution |
| 2 | Product of the Last K Numbers | Medium | Solution |
| 2 | Car Pooling | Medium | Solution |
| 2 | Decode String | Medium | Solution |
| 2 | Palindrome Permutation II | Medium | Solution |
| 2 | Number of Islands | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 3 | Freedom Trail | Hard | Solution |
| 2 | Sliding Window Maximum | Hard | Solution |
| 1 | Number of Substrings Containing All Three Characters | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | Three Consecutive Odds | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 4 | Reorder Routes to Make All Paths Lead to the City Zero | Medium | Solution |
| 1 | Counting Elements | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 9 | Design Hit Counter | Medium | Solution |
| 2 | Sparse Matrix Multiplication | Medium | Solution |
| 2 | First Missing Positive | Hard | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 2 | Valid Parentheses | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 3 | Two Sum | Easy | Java, C++, Javascript |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | The Time When the Network Becomes Idle | Medium | Java |
| 1 | Minimum Operations to Make the Array Increasing | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | Find the Winner of an Array Game | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 5 | Number of Islands | Medium | Solution |
| 3 | Maximum Subarray | Easy | Solution |
| 2 | Implement Trie II (Prefix Tree) | Medium | Solution |
| 2 | Rectangle Overlap | Easy | Solution |
| 2 | Minesweeper | Medium | Solution |
| 2 | LRU Cache | Hard | Solution |
| 2 | Best Time to Buy and Sell Stock | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | Set Intersection Size At Least Two | Hard | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 6 | Find Duplicate File in System | Medium | Solution |
| 5 | Game of Life | Medium | Solution |
| 2 | Max Area of Island | Medium | Solution |
| 2 | Design Phone Directory | Medium | Solution |
| 2 | Number of Islands | Medium | Solution |
| 1 | Seat Reservation Manager | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | Maximize Sum Of Array After K Negations | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 2 | Maximum Number of Coins You Can Get | Medium | Solution |
| 2 | Max Sum of Rectangle No Larger Than K | Hard | Solution |
| 1 | Stone Game VII | Medium | Solution |
| 1 | Ways to Make a Fair Array | Medium | Javascript |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 2 | Minimum Number of People to Teach | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 3 | Letter Combinations of a Phone Number | Medium | Solution |
| 2 | Additive Number | Medium | Solution |
| 1 | Self Dividing Numbers | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | Find Three Consecutive Integers That Sum to a Given Number | Medium | Java |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 282 | Minimum Remove to Make Valid Parentheses | Medium | Solution |
| 252 | Valid Palindrome II | Easy | Solution |
| 188 | Binary Tree Vertical Order Traversal | Medium | Solution |
| 180 | Lowest Common Ancestor of a Binary Tree | Medium | Solution |
| 162 | Pow(x, n) | Medium | Solution |
| 156 | Lowest Common Ancestor of a Binary Tree III | Medium | Solution |
| 149 | Range Sum of BST | Medium | Solution |
| 141 | Subarray Sum Equals K | Medium | Solution |
| 140 | Random Pick with Weight | Medium | Solution |
| 140 | Kth Largest Element in an Array | Medium | Solution |
| 127 | K Closest Points to Origin | Easy | Solution |
| 121 | Dot Product of Two Sparse Vectors | Easy | Solution |
| 118 | Basic Calculator II | Medium | Solution |
| 114 | Valid Word Abbreviation | Easy | Solution |
| 112 | Simplify Path | Medium | Solution |
| 110 | Merge Intervals | Medium | Solution |
| 108 | Binary Tree Right Side View | Medium | Solution |
| 100 | Minimum Add to Make Parentheses Valid | Medium | Solution |
| 100 | Nested List Weight Sum | Easy | Solution |
| 97 | Top K Frequent Elements | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 2 | Maximal Square | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 7 | Number of Students Unable to Eat Lunch | Easy | Solution |
| 4 | Car Pooling | Medium | Solution |
| 3 | Maximum Number of Coins You Can Get | Medium | Solution |
| 3 | Jump Game | Medium | Solution |
| 2 | Shortest Subarray to be Removed to Make Array Sorted | Medium | Solution |
| 2 | Maximum Length of Pair Chain | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | Add One Row to Tree | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 2 | Battleships in a Board | Medium | Solution |
| 2 | LRU Cache | Hard | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 38 | Trapping Rain Water | Hard | Solution |
| 20 | Height Checker | Easy | Solution |
| 18 | Median of Two Sorted Arrays | Hard | Solution, C++ |
| 12 | High Five | Easy | Solution |
| 11 | Best Time to Buy and Sell Stock | Easy | Solution |
| 11 | Delete and Earn | Medium | Solution |
| 9 | Find Pivot Index | Easy | Solution |
| 7 | Two Sum | Easy | Java, C++, Javascript |
| 7 | Count Number of Teams | Medium | Solution |
| 6 | String Compression | Easy | Solution |
| 6 | LRU Cache | Hard | Solution |
| 5 | Longest Palindromic Substring | Medium | Solution |
| 5 | Fraction Addition and Subtraction | Medium | Solution |
| 4 | Elimination Game | Medium | Solution |
| 4 | Find the Winner of the Circular Game | Medium | Solution |
| 4 | 3Sum | Medium | Solution, C++ |
| 4 | Longest Substring Without Repeating Characters | Medium | Solution, C++ |
| 4 | Minimum Moves to Equal Array Elements | Easy | Solution |
| 4 | First Unique Character in a String | Easy | Solution |
| 3 | Minimum Path Sum | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 75 | Find Leaves of Binary Tree | Medium | Solution |
| 73 | Evaluate Reverse Polish Notation | Medium | Solution |
| 44 | Two Sum | Easy | Java, C++, Javascript |
| 36 | Snapshot Array | Easy | Javascript |
| 30 | Stock Price Fluctuation | Medium | Java |
| 30 | Minimum Time Difference | Medium | Solution |
| 28 | Merge Intervals | Medium | Solution |
| 27 | Random Pick with Weight | Medium | Solution |
| 24 | Text Justification | Hard | Solution |
| 22 | Meeting Rooms II | Medium | Solution |
| 22 | Happy Number | Easy | Solution |
| 22 | Logger Rate Limiter | Easy | Solution |
| 21 | Number of Islands | Medium | Solution |
| 19 | First Bad Version | Easy | Solution |
| 19 | Decode String | Medium | Solution |
| 17 | Maximum Points You Can Obtain from Cards | Medium | Solution |
| 15 | Unique Paths | Medium | Solution |
| 15 | Number of Matching Subsequences | Medium | Solution |
| 15 | Subarray Sum Equals K | Medium | Solution |
| 14 | Student Attendance Record II | Hard | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 4 | Bulb Switcher III | Medium | Solution |
| 3 | Sort Colors | Medium | Solution |
| 2 | Reorder Routes to Make All Paths Lead to the City Zero | Medium | Solution |
| 2 | Number of Steps to Reduce a Number to Zero | Easy | Solution |
| 2 | Brick Wall | Medium | Solution |
| 2 | First Missing Positive | Hard | Solution |
| 1 | Minimum Number of Buckets Required to Collect Rainwater from Houses | Medium | Java |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 2 | Short Encoding of Words | Medium | Solution |
| 2 | Sliding Window Median | Hard | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 7 | Equal Sum Arrays With Minimum Number of Operations | Medium | Solution |
| 3 | 24 Game | Hard | Solution |
| 3 | Find Peak Element | Binary Search | Solution |
| 1 | Detect Pattern of Length M Repeated K or More Times | Easy | Solution |
| 1 | Maximum 69 Number | Easy | Solution |
| 1 | Convert Integer to the Sum of Two No-Zero Integers | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | Minimum Distance to the Target Element | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 3 | Asteroid Collision | Medium | Solution |
| 2 | Keys and Rooms | Easy | Solution |
| 2 | Find K Pairs with Smallest Sums | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 2 | Add Two Numbers | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | K-th Smallest in Lexicographical Order | Hard | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 8 | Gas Station | Medium | Solution |
| 8 | Merge Intervals | Medium | Solution |
| 6 | Most Visited Sector in a Circular Track | Easy | Solution |
| 6 | Backspace String Compare | Easy | Solution |
| 4 | Water Bottles | Easy | Solution |
| 3 | Degree of an Array | Easy | Solution |
| 3 | Maximal Square | Medium | Solution |
| 3 | Two Sum | Easy | Java, C++, Javascript |
| 2 | Move Zeroes | Easy | Solution |
| 2 | Group Anagrams | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | Score After Flipping Matrix | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | Count Artifacts That Can Be Extracted | Medium | Java |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 2 | Design Snake Game | Medium | Solution |
| 1 | Find the Derangement of An Array | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 25 | Subdomain Visit Count | Easy | Solution |
| 9 | Word Search | Medium | Solution |
| 8 | Maximum Length of Repeated Subarray | Medium | Solution |
| 6 | Find Words That Can Be Formed by Characters | Easy | Solution |
| 4 | Alert Using Same Key-Card Three or More Times in a One Hour Period | Medium | Solution |
| 3 | Text Justification | Hard | Solution |
| 3 | Merge k Sorted Lists | Hard | Solution |
| 2 | Merge Sorted Array | Easy | Solution |
| 1 | Sum of Even Numbers After Queries | Easy | Solution |
| 1 | Binary Tree Tilt | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | Find the Minimum and Maximum Number of Nodes Between Critical Points | Medium | Java |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 3 | Maximum Product Subarray | Medium | Solution |
| 2 | Sort Integers by The Number of 1 Bits | Easy | Solution |
| 2 | Score of Parentheses | Medium | Solution |
| 2 | Maximum Subarray | Easy | Solution |
| 2 | 4 Sum | Medium | Solution |
| 2 | 3Sum | Medium | Solution, C++ |
[back to top] | Occurence | Problem | Difficulty | Solution
Truncated — view the full README on GitHub.
(top 24 of 29)
609 followers · starred Nov 2024
1,807 followers · starred Aug 2022
4 followers · starred Apr 2023
28 followers · starred Oct 2023
Lists of company wise questions available on leetcode premium. Every csv file in the companies directory corresponds to a list of questions on leetcode for a specific company based on the leetcode company tags. Updated as of May, 2022.
Jupyter Notebook
11,380
37 commits
updated Jul 16, 2024
Curated lists of Leetcode questions group by companies, updated as of May, 2022.
Shout out to fishercoder1534 for the awesome Leetcode repo for solutions.
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | Stone Game VI | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 3 | Two Sum | Easy | Java, C++, Javascript |
| 2 | Count Odd Numbers in an Interval Range | Easy | Solution |
| 2 | Merge Two Sorted Lists | Easy | Solution |
| 2 | Palindrome Number | Easy | Java, C++ |
| 1 | Find Subsequence of Length K With the Largest Sum | Easy | Java |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 2 | Minimum ASCII Delete Sum for Two Strings | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 52 | Two Sum | Easy | Java, C++, Javascript |
| 19 | Median of Two Sorted Arrays | Hard | Solution, C++ |
| 16 | Roman to Integer | Easy | Solution |
| 13 | Reverse Integer | Easy | Solution, C++ |
| 12 | Maximum Subarray | Easy | Solution |
| 12 | Contains Duplicate | Easy | Solution |
| 12 | Longest Palindromic Substring | Medium | Solution |
| 11 | Merge Two Sorted Lists | Easy | Solution |
| 11 | Longest Common Prefix | Easy | Solution |
| 10 | Add Two Numbers | Medium | Solution |
| 9 | Container With Most Water | Medium | Solution |
| 9 | 3Sum | Medium | Solution, C++ |
| 8 | Valid Parentheses | Easy | Solution |
| 8 | Merge Intervals | Medium | Solution |
| 8 | First Missing Positive | Hard | Solution |
| 8 | Best Time to Buy and Sell Stock | Easy | Solution |
| 7 | Search Insert Position | Easy | Solution |
| 7 | Search in Rotated Sorted Array | Medium | Solution |
| 7 | Trapping Rain Water | Hard | Solution |
| 7 | Product of Array Except Self | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 10 | Insert Delete GetRandom O(1) | Medium | Solution |
| 6 | Design Hit Counter | Medium | Solution |
| 4 | Group Anagrams | Medium | Solution |
| 3 | Insert Delete GetRandom O(1) - Duplicates allowed | Hard | Solution |
| 3 | Valid Anagram | Easy | Solution |
| 2 | Optimal Account Balancing | Hard | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 14 | Palindrome Pairs | Hard | Solution |
| 14 | Alien Dictionary | nan | Solution |
| 9 | Flatten 2D Vector | Medium | Solution |
| 7 | Smallest Common Region | Medium | Solution |
| 6 | Pour Water | Medium | Solution |
| 6 | Minimum Window Substring | Hard | Solution |
| 5 | Combination Sum | Medium | Solution |
| 4 | Flatten Nested List Iterator | Medium | Solution |
| 3 | Design Circular Queue | Medium | Solution |
| 3 | Fraction to Recurring Decimal | Medium | Solution |
| 2 | Find the Smallest Divisor Given a Threshold | nan | Solution |
| 2 | Tag Validator | Hard | Solution |
| 2 | Intersection of Two Linked Lists | Easy | Solution |
| 1 | Pyramid Transition Matrix | Medium | Solution |
| 1 | Mini Parser | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | N-Repeated Element in Size 2N Array | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 8 | Increasing Decreasing String | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 3 | H-Index | Medium | Solution |
| 2 | Best Time to Buy and Sell Stock | Easy | Solution |
| 2 | Group Anagrams | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | Path Sum IV | Medium | Solution |
| 1 | Split Concatenated Strings | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | Number Of Rectangles That Can Form The Largest Square | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 117 | Two Sum | Easy | Java, C++, Javascript |
| 117 | LRU Cache | Hard | Solution |
| 103 | Number of Islands | Medium | Solution |
| 87 | Merge Intervals | Medium | Solution |
| 68 | Search Suggestions System | Medium | Solution |
| 56 | Best Time to Buy and Sell Stock | Easy | Solution |
| 51 | Group Anagrams | Medium | Solution |
| 50 | Analyze User Website Visit Pattern | Medium | Solution |
| 49 | Longest Substring Without Repeating Characters | Medium | Solution, C++ |
| 49 | K Closest Points to Origin | Easy | Solution |
| 48 | Meeting Rooms II | Medium | Solution |
| 47 | Merge k Sorted Lists | Hard | Solution |
| 45 | Trapping Rain Water | Hard | Solution |
| 44 | 3Sum | Medium | Solution, C++ |
| 43 | Valid Parentheses | Easy | Solution |
| 41 | Word Ladder | Hard | Solution |
| 40 | Median of Two Sorted Arrays | Hard | Solution, C++ |
| 36 | Add Two Numbers | Medium | Solution |
| 36 | Word Search | Medium | Solution |
| 35 | Maximum Subarray | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 3 | Reorder Routes to Make All Paths Lead to the City Zero | Medium | Solution |
| 3 | Valid Palindrome | Easy | Solution |
| 3 | Two Sum | Easy | Java, C++, Javascript |
| 2 | Reducing Dishes | Hard | Solution |
| 2 | 3Sum | Medium | Solution, C++ |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 40 | Two Sum | Easy | Java, C++, Javascript |
| 20 | LRU Cache | Hard | Solution |
| 19 | Add Two Numbers | Medium | Solution |
| 18 | Merge Intervals | Medium | Solution |
| 17 | Maximum Subarray | Easy | Solution |
| 16 | Longest Substring Without Repeating Characters | Medium | Solution, C++ |
| 15 | Median of Two Sorted Arrays | Hard | Solution, C++ |
| 14 | Longest Common Prefix | Easy | Solution |
| 13 | Roman to Integer | Easy | Solution |
| 11 | Spiral Matrix | Medium | Solution |
| 11 | Group Anagrams | Medium | Solution |
| 11 | Number of Islands | Medium | Solution |
| 10 | Word Break | Medium | Solution |
| 10 | Product of Array Except Self | Medium | Solution |
| 10 | 3Sum | Medium | Solution, C++ |
| 9 | Generate Parentheses | Medium | Solution |
| 8 | Rotate Image | Medium | Solution |
| 8 | Move Zeroes | Easy | Solution |
| 8 | Best Time to Buy and Sell Stock | Easy | Solution |
| 8 | Merge k Sorted Lists | Hard | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 4 | Maximum Length of Subarray With Positive Product | Medium | Solution |
| 2 | Broken Calculator | Medium | Solution |
| 2 | Minimum Size Subarray Sum | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 3 | Valid Parentheses | Easy | Solution |
| 2 | Compare Version Numbers | Easy | Solution |
| 2 | Restore IP Addresses | Medium | Solution |
| 1 | Construct String With Repeat Limit | Medium | Java |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 13 | Product of Array Except Self | Medium | Solution |
| 5 | K Closest Points to Origin | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 4 | Degree of an Array | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 18 | Rank Teams by Votes | Medium | Solution |
| 10 | Logger Rate Limiter | Easy | Solution |
| 4 | Lemonade Change | Easy | Solution |
| 3 | Design Snake Game | Medium | Solution |
| 2 | Greatest Common Divisor of Strings | Easy | Solution |
| 2 | Single Number | Easy | Solution |
| 2 | Best Time to Buy and Sell Stock | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | Out of Boundary Paths | Hard | Solution |
| 1 | Zuma Game | Hard | Solution |
| 1 | Arithmetic Slices II - Subsequence | Hard | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 2 | Valid Parentheses | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 6 | Group Anagrams | Medium | Solution |
| 2 | Evaluate Division | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 64 | Design Underground System | Medium | Solution |
| 33 | Number of Islands | Medium | Solution |
| 33 | Decode String | Medium | Solution |
| 28 | Flatten a Multilevel Doubly Linked List | Medium | Solution |
| 26 | Remove All Adjacent Duplicates in String II | Medium | Solution |
| 23 | Insert Delete GetRandom O(1) | Medium | Solution |
| 23 | Longest Substring Without Repeating Characters | Medium | Solution, C++ |
| 20 | Merge Intervals | Medium | Solution |
| 20 | Meeting Rooms II | Medium | Solution |
| 20 | Design an Ordered Stream | Easy | Solution |
| 19 | LRU Cache | Hard | Solution |
| 16 | Two Sum | Easy | Java, C++, Javascript |
| 16 | Add Two Numbers | Medium | Solution |
| 15 | Trapping Rain Water | Hard | Solution |
| 14 | Validate Binary Search Tree | Medium | Solution |
| 14 | Two City Scheduling | Easy | Solution |
| 14 | Valid Parentheses | Easy | Solution |
| 14 | Word Search | Medium | Solution |
| 13 | First Unique Character in a String | Easy | Solution |
| 12 | Best Time to Buy and Sell Stock | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 5 | Check if All Characters Have Equal Number of Occurrences | Easy | Solution |
| 3 | Reverse Words in a String III | Easy | Solution |
| 3 | Word Pattern | Easy | Solution |
| 2 | Subarray Sum Equals K | Medium | Solution |
| 2 | Word Pattern II | Hard | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 3 | Least Number of Unique Integers after K Removals | Medium | Solution |
| 3 | Backspace String Compare | Easy | Solution |
| 3 | Additive Number | Medium | Solution |
| 2 | Integer to English Words | Hard | Solution |
| 2 | Sliding Window Maximum | Hard | Solution |
| 2 | Valid Parentheses | Easy | Solution |
| 1 | Two Out of Three | Easy | Java |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 12 | Number of 1 Bits | Easy | Solution |
| 4 | Word Ladder II | Hard | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 8 | Merge k Sorted Lists | Hard | Solution |
| 6 | Number of Islands | Medium | Solution |
| 6 | Search in Rotated Sorted Array | Medium | Solution |
| 6 | Binary Tree Maximum Path Sum | Hard | Solution |
| 5 | LRU Cache | Hard | Solution |
| 4 | The Maze | Medium | Solution |
| 4 | Basic Calculator II | Medium | Solution |
| 4 | Sliding Window Maximum | Hard | Solution |
| 4 | The Number of Weak Characters in the Game | Medium | Solution |
| 3 | Best Time to Buy and Sell Stock II | Easy | Solution |
| 3 | Course Schedule II | Medium | Solution |
| 3 | Longest Valid Parentheses | Hard | Solution |
| 3 | Combination Sum | Medium | Solution |
| 3 | N-Queens | Hard | Solution |
| 3 | Maximum Subarray | Easy | Solution |
| 3 | Best Time to Buy and Sell Stock | Easy | Solution |
| 3 | Sort List | Medium | Solution |
| 3 | Closest Dessert Cost | Medium | Solution |
| 3 | 3Sum | Medium | Solution, C++ |
| 3 | Basic Calculator | Hard | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 3 | Pairs of Songs With Total Durations Divisible by 60 | Easy | Solution |
| 3 | Daily Temperatures | Medium | Solution |
| 3 | Generate Parentheses | Medium | Solution |
| 2 | Sort Array by Increasing Frequency | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | Divide a String Into Groups of Size k | Easy | Java |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 18 | License Key Formatting | Medium | Solution |
| 14 | Count Primes | Easy | Solution |
| 13 | Reverse Nodes in k-Group | Hard | Solution |
| 4 | Best Time to Buy and Sell Stock | Easy | Solution |
| 3 | Candy Crush | Medium | Solution |
| 3 | Integer to Roman | Medium | Solution |
| 2 | Rotating the Box | Medium | Solution |
| 2 | Restore the Array From Adjacent Pairs | Medium | Solution |
| 2 | Add Two Numbers | Medium | Solution |
| 1 | Four Divisors | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | Maximum Erasure Value | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 16 | Word Search II | Hard | Solution |
| 16 | Rotate Image | Medium | Solution |
| 11 | Maximum Subarray | Easy | Solution |
| 11 | Expressive Words | Medium | Solution |
| 9 | Decode Ways | Medium | Solution |
| 8 | Validate IP Address | Medium | Solution |
| 8 | Decode String | Medium | Solution |
| 6 | House Robber | Easy | Solution |
| 6 | Maximum Difference Between Increasing Elements | Easy | Java |
| 5 | Valid Parentheses | Easy | Solution |
| 4 | Number of 1 Bits | Easy | Solution |
| 3 | Top K Frequent Elements | Medium | Solution |
| 3 | Beautiful Arrangement | Medium | Solution |
| 3 | Unique Paths II | Medium | Solution |
| 2 | Coin Change 2 | Medium | Solution |
| 2 | First Bad Version | Easy | Solution |
| 2 | Maximum Population Year | Easy | Solution |
| 2 | Best Time to Buy and Sell Stock | Easy | Solution |
| 2 | Find Pivot Index | Easy | Solution |
| 2 | Merge Intervals | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 8 | Pairs of Songs With Total Durations Divisible by 60 | Easy | Solution |
| 5 | Range Addition | Medium | Solution |
| 4 | Sliding Window Maximum | Hard | Solution |
| 2 | Transpose Matrix | Easy | Solution |
| 2 | Best Time to Buy and Sell Stock IV | Hard | Solution |
| 2 | Trapping Rain Water | Hard | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | Find All Groups of Farmland | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 2 | Largest BST Subtree | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | Count Vowel Substrings of a String | Easy | Java |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 2 | Rank Teams by Votes | Medium | Solution |
| 2 | Wildcard Matching | Hard | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 9 | Unique Paths II | Medium | Solution |
| 5 | Valid Sudoku | Medium | Solution, Javascript |
| 3 | Synonymous Sentences | Medium | Solution |
| 3 | The Skyline Problem | Hard | Solution |
| 2 | Product of the Last K Numbers | Medium | Solution |
| 2 | Car Pooling | Medium | Solution |
| 2 | Decode String | Medium | Solution |
| 2 | Palindrome Permutation II | Medium | Solution |
| 2 | Number of Islands | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 3 | Freedom Trail | Hard | Solution |
| 2 | Sliding Window Maximum | Hard | Solution |
| 1 | Number of Substrings Containing All Three Characters | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | Three Consecutive Odds | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 4 | Reorder Routes to Make All Paths Lead to the City Zero | Medium | Solution |
| 1 | Counting Elements | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 9 | Design Hit Counter | Medium | Solution |
| 2 | Sparse Matrix Multiplication | Medium | Solution |
| 2 | First Missing Positive | Hard | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 2 | Valid Parentheses | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 3 | Two Sum | Easy | Java, C++, Javascript |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | The Time When the Network Becomes Idle | Medium | Java |
| 1 | Minimum Operations to Make the Array Increasing | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | Find the Winner of an Array Game | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 5 | Number of Islands | Medium | Solution |
| 3 | Maximum Subarray | Easy | Solution |
| 2 | Implement Trie II (Prefix Tree) | Medium | Solution |
| 2 | Rectangle Overlap | Easy | Solution |
| 2 | Minesweeper | Medium | Solution |
| 2 | LRU Cache | Hard | Solution |
| 2 | Best Time to Buy and Sell Stock | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | Set Intersection Size At Least Two | Hard | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 6 | Find Duplicate File in System | Medium | Solution |
| 5 | Game of Life | Medium | Solution |
| 2 | Max Area of Island | Medium | Solution |
| 2 | Design Phone Directory | Medium | Solution |
| 2 | Number of Islands | Medium | Solution |
| 1 | Seat Reservation Manager | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | Maximize Sum Of Array After K Negations | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 2 | Maximum Number of Coins You Can Get | Medium | Solution |
| 2 | Max Sum of Rectangle No Larger Than K | Hard | Solution |
| 1 | Stone Game VII | Medium | Solution |
| 1 | Ways to Make a Fair Array | Medium | Javascript |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 2 | Minimum Number of People to Teach | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 3 | Letter Combinations of a Phone Number | Medium | Solution |
| 2 | Additive Number | Medium | Solution |
| 1 | Self Dividing Numbers | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | Find Three Consecutive Integers That Sum to a Given Number | Medium | Java |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 282 | Minimum Remove to Make Valid Parentheses | Medium | Solution |
| 252 | Valid Palindrome II | Easy | Solution |
| 188 | Binary Tree Vertical Order Traversal | Medium | Solution |
| 180 | Lowest Common Ancestor of a Binary Tree | Medium | Solution |
| 162 | Pow(x, n) | Medium | Solution |
| 156 | Lowest Common Ancestor of a Binary Tree III | Medium | Solution |
| 149 | Range Sum of BST | Medium | Solution |
| 141 | Subarray Sum Equals K | Medium | Solution |
| 140 | Random Pick with Weight | Medium | Solution |
| 140 | Kth Largest Element in an Array | Medium | Solution |
| 127 | K Closest Points to Origin | Easy | Solution |
| 121 | Dot Product of Two Sparse Vectors | Easy | Solution |
| 118 | Basic Calculator II | Medium | Solution |
| 114 | Valid Word Abbreviation | Easy | Solution |
| 112 | Simplify Path | Medium | Solution |
| 110 | Merge Intervals | Medium | Solution |
| 108 | Binary Tree Right Side View | Medium | Solution |
| 100 | Minimum Add to Make Parentheses Valid | Medium | Solution |
| 100 | Nested List Weight Sum | Easy | Solution |
| 97 | Top K Frequent Elements | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 2 | Maximal Square | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 7 | Number of Students Unable to Eat Lunch | Easy | Solution |
| 4 | Car Pooling | Medium | Solution |
| 3 | Maximum Number of Coins You Can Get | Medium | Solution |
| 3 | Jump Game | Medium | Solution |
| 2 | Shortest Subarray to be Removed to Make Array Sorted | Medium | Solution |
| 2 | Maximum Length of Pair Chain | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | Add One Row to Tree | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 2 | Battleships in a Board | Medium | Solution |
| 2 | LRU Cache | Hard | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 38 | Trapping Rain Water | Hard | Solution |
| 20 | Height Checker | Easy | Solution |
| 18 | Median of Two Sorted Arrays | Hard | Solution, C++ |
| 12 | High Five | Easy | Solution |
| 11 | Best Time to Buy and Sell Stock | Easy | Solution |
| 11 | Delete and Earn | Medium | Solution |
| 9 | Find Pivot Index | Easy | Solution |
| 7 | Two Sum | Easy | Java, C++, Javascript |
| 7 | Count Number of Teams | Medium | Solution |
| 6 | String Compression | Easy | Solution |
| 6 | LRU Cache | Hard | Solution |
| 5 | Longest Palindromic Substring | Medium | Solution |
| 5 | Fraction Addition and Subtraction | Medium | Solution |
| 4 | Elimination Game | Medium | Solution |
| 4 | Find the Winner of the Circular Game | Medium | Solution |
| 4 | 3Sum | Medium | Solution, C++ |
| 4 | Longest Substring Without Repeating Characters | Medium | Solution, C++ |
| 4 | Minimum Moves to Equal Array Elements | Easy | Solution |
| 4 | First Unique Character in a String | Easy | Solution |
| 3 | Minimum Path Sum | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 75 | Find Leaves of Binary Tree | Medium | Solution |
| 73 | Evaluate Reverse Polish Notation | Medium | Solution |
| 44 | Two Sum | Easy | Java, C++, Javascript |
| 36 | Snapshot Array | Easy | Javascript |
| 30 | Stock Price Fluctuation | Medium | Java |
| 30 | Minimum Time Difference | Medium | Solution |
| 28 | Merge Intervals | Medium | Solution |
| 27 | Random Pick with Weight | Medium | Solution |
| 24 | Text Justification | Hard | Solution |
| 22 | Meeting Rooms II | Medium | Solution |
| 22 | Happy Number | Easy | Solution |
| 22 | Logger Rate Limiter | Easy | Solution |
| 21 | Number of Islands | Medium | Solution |
| 19 | First Bad Version | Easy | Solution |
| 19 | Decode String | Medium | Solution |
| 17 | Maximum Points You Can Obtain from Cards | Medium | Solution |
| 15 | Unique Paths | Medium | Solution |
| 15 | Number of Matching Subsequences | Medium | Solution |
| 15 | Subarray Sum Equals K | Medium | Solution |
| 14 | Student Attendance Record II | Hard | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 4 | Bulb Switcher III | Medium | Solution |
| 3 | Sort Colors | Medium | Solution |
| 2 | Reorder Routes to Make All Paths Lead to the City Zero | Medium | Solution |
| 2 | Number of Steps to Reduce a Number to Zero | Easy | Solution |
| 2 | Brick Wall | Medium | Solution |
| 2 | First Missing Positive | Hard | Solution |
| 1 | Minimum Number of Buckets Required to Collect Rainwater from Houses | Medium | Java |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 2 | Short Encoding of Words | Medium | Solution |
| 2 | Sliding Window Median | Hard | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 7 | Equal Sum Arrays With Minimum Number of Operations | Medium | Solution |
| 3 | 24 Game | Hard | Solution |
| 3 | Find Peak Element | Binary Search | Solution |
| 1 | Detect Pattern of Length M Repeated K or More Times | Easy | Solution |
| 1 | Maximum 69 Number | Easy | Solution |
| 1 | Convert Integer to the Sum of Two No-Zero Integers | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | Minimum Distance to the Target Element | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 3 | Asteroid Collision | Medium | Solution |
| 2 | Keys and Rooms | Easy | Solution |
| 2 | Find K Pairs with Smallest Sums | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 2 | Add Two Numbers | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | K-th Smallest in Lexicographical Order | Hard | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 8 | Gas Station | Medium | Solution |
| 8 | Merge Intervals | Medium | Solution |
| 6 | Most Visited Sector in a Circular Track | Easy | Solution |
| 6 | Backspace String Compare | Easy | Solution |
| 4 | Water Bottles | Easy | Solution |
| 3 | Degree of an Array | Easy | Solution |
| 3 | Maximal Square | Medium | Solution |
| 3 | Two Sum | Easy | Java, C++, Javascript |
| 2 | Move Zeroes | Easy | Solution |
| 2 | Group Anagrams | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | Score After Flipping Matrix | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | Count Artifacts That Can Be Extracted | Medium | Java |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 2 | Design Snake Game | Medium | Solution |
| 1 | Find the Derangement of An Array | Medium | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 25 | Subdomain Visit Count | Easy | Solution |
| 9 | Word Search | Medium | Solution |
| 8 | Maximum Length of Repeated Subarray | Medium | Solution |
| 6 | Find Words That Can Be Formed by Characters | Easy | Solution |
| 4 | Alert Using Same Key-Card Three or More Times in a One Hour Period | Medium | Solution |
| 3 | Text Justification | Hard | Solution |
| 3 | Merge k Sorted Lists | Hard | Solution |
| 2 | Merge Sorted Array | Easy | Solution |
| 1 | Sum of Even Numbers After Queries | Easy | Solution |
| 1 | Binary Tree Tilt | Easy | Solution |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 1 | Find the Minimum and Maximum Number of Nodes Between Critical Points | Medium | Java |
| Occurence | Problem | Difficulty | Solution |
|---|---|---|---|
| 3 | Maximum Product Subarray | Medium | Solution |
| 2 | Sort Integers by The Number of 1 Bits | Easy | Solution |
| 2 | Score of Parentheses | Medium | Solution |
| 2 | Maximum Subarray | Easy | Solution |
| 2 | 4 Sum | Medium | Solution |
| 2 | 3Sum | Medium | Solution, C++ |
[back to top] | Occurence | Problem | Difficulty | Solution
Truncated — view the full README on GitHub.
(top 24 of 29)
609 followers · starred Nov 2024
1,807 followers · starred Aug 2022
4 followers · starred Apr 2023
28 followers · starred Oct 2023
