text function productExceptSelf(nums): n = length(nums) result = array of size n // Compute prefix products result[0] = 1 for i from 1 to n-1: result[i] = result[i-1] * nums[i-1] // Compute suffix products and combine suffix = 1 for i from n-1 down to 0: result[i] = result[i] * suffix suffix = suffix * nums[i] return result Time complexity: . Two passes through the array. Space complexity: extra space (output array doesn't count).
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
$ curl repovive.com/roadmaps/maang-interview-prep/arrays-hashing/product-of-array-except-self-pseudocode
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░████████████████████████████████████████████████████████████████████████████████████████████████████████