title: Finding k largest elements in an array in O(1) time
body: <p>Is it possible to have O(1) time complexity in find the k largest or smallest numbers in an array, by making a stack class with an auxiliary data structure to track k largest/smallest in every <code>push()</code> and <code>pop()</code>. Since retrieval is O(1), return k elements in a get method</p>