Java solutions for leetcode.
| Title | Time Complexity | Space Complexity |
|---|---|---|
| Burst Balloons | O(N^3) | O(N^2) |
| Longest Palindromic Subsequence | O(N^2) | O(N^2) |
| Delete Operation for Two Strings | O(N^2) | O(N^2) |
| Out of Boundary Paths | O(N * m * n) | O(m * n) improvement |
| Maximum Vacation Days | O(weeks * citites ^ 2) | (O(cities) improvement |
| Partition Equal Subset Sum | O(sum * n) | O(sum) improvement |
| Title | Time Complexity | Space Complexity |
|---|---|---|
| Next Greater Element II | O(N) | O(N) |
| Remove K Digits | O(N) | O(N) |
| Title | Time Complexity | Space Complexity |
|---|---|---|
| The maze II | ||
| Find Bottom Left Tree Value | O(N) | O(N) |
| Find Largest Value in Each Tree Row | O(N) | O(N) |
| Trapping Rain Water II | O(mnlog(mn)) | O(mn) |
| Title | Time Complexity | Space Complexity |
|---|---|---|
| Most Frequent Subtree Sum | O(N) | O(N) |
| Subtree of Another Tree | O(N + M) | O(1) |
| Binary Tree Longest Consecutive Sequence | O(N) | O(1) |
| Serialize and Deserialize Binary Tree | O(N) | O(1) |
| Title | Time Complexity | Space Complexity |
|---|---|---|
| Most Frequent Subtree Sum | O(N) | O(N) |
| Title | Time Complexity | Space Complexity |
|---|---|---|
| Minimum Unique Word Abbreviation | ||
| Word Squares | ||
| Factor Combinations |
| Title | Time Complexity | Space Complexity |
|---|---|---|
| Word Squares |
| Title | Time Complexity | Space Complexity |
|---|---|---|
| Split Array Largest Sum | O(N * log(sum - max)) | O(1) |