LeetCode 115: two solutions - Space optimization using a 1D array
See how a simple 1D array optimization reduces space complexity from O(n * m) to O(m) while keeping O(n * m) time complexity.
Read moreTag: #complexity
LeetCode 3903: two solutions - O(n²) vs O(n) Time complexity
We're used to evaluating an algorithm's Time complexity, but we often overlook its Space complexity. However, often the best solution for Time complexity is a brute-force solution for Space complexity and vice versa.
Read moreThere is no brute-force solutions
We're used to evaluating an algorithm's Time complexity, but we often overlook its Space complexity. However, often the best solution for Time complexity is a brute-force solution for Space complexity and vice versa.
Read morePage 1 of 1