maximize the top element of the stack after performing exactly K operations

by

Pop k-1 elements in k-1 operations. Now for the last operation, either you can pop one more element, or can push one element from the popped elements.

So compare both the cases, if you pop element in kth operation, the element on top should be more than all first k-1 popped elements, otherwise for kth operation push the largest element from k-1 popped elements.

More Related Contents:

  1. Finding kth smallest number from n sorted arrays
  2. Algorithm for all subsets of Array
  3. How to sort in-place using the merge sort algorithm?
  4. Easy interview question got harder: given numbers 1..100, find the missing number(s) given exactly k are missing
  5. Given an array of numbers, return array of products of all other numbers (no division)
  6. Array versus linked-list
  7. Algorithm to find k smallest numbers in array of n items
  8. Matching values in string array
  9. Stack with find-min/find-max more efficient than O(n)?
  10. design a stack such that getMinimum( ) should be O(1)
  11. Weighted random selection from array
  12. Find the Smallest Integer Not in a List
  13. How to find a duplicate element in an array of shuffled consecutive integers?
  14. How do i define a structure in Matlab
  15. Array remove duplicate elements
  16. Why do we use arrays instead of other data structures?
  17. Given an array, find out the next smaller element for each element
  18. Binary Search algorithm implementations
  19. Find the 2nd largest element in an array with minimum number of comparisons
  20. Algorithm to rotate an array in linear time
  21. Find all subsets of length k in an array
  22. Grouping arrays in PHP
  23. A data structure supporting O(1) random access and worst-case O(1) append?
  24. In-place array reordering?
  25. How to find max. and min. in array using minimum comparisons?
  26. Median of 5 sorted arrays
  27. find pair of numbers in array that add to given sum
  28. Regarding in-place merge in an array
  29. How to find repeating sequence of characters in a given array?
  30. Algorithm to apply permutation in constant memory space

Leave a Comment