Daily leetcode challenge with problems chosen randomly by difficulty.
Languages used: Java and Python
-
Easy
- Sum of Even Numbers After Queries
- Next Greater Element 1
- Longest Common Prefix
- Intersection of Two Arrays
- Backspace String Compare
- Merge Two Sorted Lists
- Climbing Stairs
- Fair Candy Swap
- Maximize Distance to Closest Person
- Find Common Characters
- Third Maximum Number
- String Matching in an Array
- Minimum Value to Get Positive Step by Step Sum
- Maximum Product of Three Numbers
- Maximize Sum Of Array After K Negations
- House Robber
- Majority Element
- Reshape the Matrix
- Shortest Unsorted Continuous Subarray
- Find Lucky Integer in an Array
- N-Repeated Element in Size 2N Array
- Sort Array By Parity
- Isomorphic Strings
- Binary Prefix Divisible By 5
- Rank Transform of an Array
- Add to Array-Form of Integer
- Sqrt(x)
- Shuffle the Array
- Remove Duplicates from Sorted List
- Longest Continuous Increasing Subsequence
- Happy Number
- Assign Cookies
- Rotate Array
- N-ary Tree Postorder Traversal
- Pascal's Triangle
- Merge Two Binary Trees
- Invert Binary Tree
-
Medium
- Minimum Add to Make Parentheses Valid
- Distribute Coins in Binary Tree
- Find Minimum Number of Fibonacci Numbers Whose Sum is K
- Find the Duplicate Number
- Unique Paths
- Apply Discount Every n Orders
- All Elements in Two Binary Search Trees
- Elimination Game
- Increasing Triplet Subsequence
- Design Browser History
- Rearrange Words in a Sentence
- Diagonal Traverse II
- Total Hamming Distance
- Partition Array into Disjoint Intervals
- Search in Rotated Sorted Array
- Car Pooling
- Palindromic Substrings
- Prison Cells After N Days
- Minimum Number of Steps to Make Two Strings Anagram
- Maximum Length of Pair Chain
- Linked List Cycle II
- Swap Nodes in Pairs
- All Paths From Source to Target
- Queens That Can Attack The King
- Reverse Substrings Between Each Pair of Parentheses
- Asteroid Collision
- Surrounded Regions
- Predict the Winner
- Subarray Sum Equals K
- Find Minimum in Rotated Sorted Array
- Maximum Swap
- Number of Operations to Make Network Connected
- Sort Colors
- Design Linked List
- Single Number II
- Count Square Submatrices with All Ones
- Divide Array is Sets of K Consecutive Numbers
- Perfect Squares
- Score After Flipping Matrix
- Construct Binary Tree from Preorder and Inorder Traversal
- K Closest Points to Origin
- Number of Islands
- Reverse Linked List II
- Binary Tree Postorder Traversal
- Reconstruct Itinerary
- Course Schedule II
- Permutations
- Permutations II
- Combinations
-
Hard
-
Others (Non-leetcode)