Algorithm

Problem Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i]. The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer. You must write an algorithm that runs in O(n) time and without using the division operation. Example 1: Input: nums = [1,2,3,4] Output: [24,12,8,6] Example 2: Input: nums = [-1,1,0,-3,3] Output: [0,0,9,0,0] Constraints:...

This problem can be solved using either the Heap (Priority Queue) approach, which has a time complexity of O(N log k), or the Sorting approach, which has a time complexity of O(N log N). We can return the answer in any order, so a better approach is to use Quickselect. It has an average time complexity of O(N) and a worst-case complexity of O(N2), although the probability of encountering the worst-case scenario is negligible....