The problem says we’re given an array of integers A, and we should compute an array B where B[i] is a product of all elements in A except A[i]. It says time complexity should be O(n) and space complexity O(1) additional space.

I just want to verify my understanding of the space complexity - Is it correct that I have 2 arrays to work with (A and B), but beyond that can use only constant space?

Thanks!