Given an array of integers, select K elements such that product is maximized. Return product.\n\nDid a sorting based approach - but missed some cases where all the numbers were negative, followup was \n1. No extra space after sorting\n2. No sorting - suggested Priority queues.\n\nHow would u do it?

Given an array of integers, select K elements such that product is maximized. Return product.\n\nDid a sorting based approach - but missed some cases where all 

GOOGLE SDE Phone Screening Round | 1 Question