Open
Description
Bug Report for https://neetcode.io/problems/products-of-array-discluding-self
Follow-up: Could you solve it in
$O(n)$ time without using the division operation?
This confused me for ~10 minutes.
I think the Time Complexity lecture or this problem may benefit from explicitness with respect to auxiliary space usage vs. output space usage.
In standard algorithm analysis, space complexity does not include the output.
Metadata
Metadata
Assignees
Labels
No labels