Dataford
Interview QuestionsInterview GuidesExperiencesMock InterviewsPricing
Get started

Stack With GetMin in O(1)

EasyPython00:00
Practice interviewer
In session
5 left
00:00

Your question is Stack With GetMin in O(1). Start with the requirements on the right.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

You need to log in / sign up to run or submit.

Problem

UiPath Orchestrator can process sequences of Robot execution events where the most recent event must be removed first. Implement a stack that supports retrieving the smallest stored value without scanning the stack.

Create min_stack(operations), which processes a sequence of operations and returns the results of every operation that produces a value. The stack must support push, pop, top, and getMin, with each operation running in O(1) time.

Formal Specification

  • operations is a list of operation lists.
  • push has the form ["push", value], where value is an integer.
  • pop, top, and getMin have the form ["pop"], ["top"], or ["getMin"].
  • Return a list containing the result of every pop, top, and getMin, in their original order.
  • Every pop, top, or getMin operation is valid only when the stack is non-empty.
  • push does not add an item to the returned result list.

Constraints

  • 1 <= operations.length <= 10^5
  • -10^9 <= value <= 10^9
  • Every pop, top, and getMin operation is performed on a non-empty stack
  • Each operation must run in O(1) time

Function Signature

def min_stack(operations):
Your solutionPython 3
You need to log in / sign up to run or submit.
Run your code to see test output