Dataford
Interview QuestionsInterview GuidesExperiencesCoaching
New
Pricing
Get started
Dataford
Popular roles
Software EngineerData AnalystData ScientistData EngineerBusiness AnalystAI EngineerMachine Learning EngineerProduct Manager
Browse
Browse All RolesEvery role hub, from analyst to MLBrowse All CompaniesCompany-specific interview loopsAll Interview GuidesThe full guide library
Top questions by role
Software EngineerData AnalystData ScientistData EngineerBusiness AnalystAI EngineerMachine Learning EngineerProduct Manager
Top questions by skill
SQLPythonStatisticsMachine LearningA/B TestingSystem DesignGenerative AIProduct SenseMetricsBehavioral
Browse all questions →Try a mock interview
Experiences
Practice
Mock InterviewsTimed interview simulations with feedbackCoaching1:1 coaching with people at your target companiesSuccess PathYour 6-week structured planModulesCurated lessons by topicWebinarsTalks from ex-Big Tech data leadsPlaygroundA free-form scratch editor
Learn
BlogInterview strategy and career adviceTech Job Market ReportHiring trends across data and AI rolesFor UniversitiesDataford for career centersAbout DatafordWho we are and how we build
Pricing
Build my plan
O(1) Max in Stack
00:00
5 left

O(1) Max in Stack

EasyPython

Problem

Ring doorbell firmware may need to track the largest pending priority while processing events. Design a stack that supports push, pop, and get_max in O(1) worst-case time per operation.

Implement max_stack_operations(operations). Each operation is represented as a list:

  • ["push", value] adds an integer to the top of the stack and produces no output.
  • ["pop"] removes and returns the top value.
  • ["get_max"] returns the largest value currently in the stack without removing it.

Return a list containing the results of every pop and get_max, in operation order. Inputs will never pop from an empty stack or call get_max on an empty stack. Duplicate values must be handled correctly. Do not use Python's max() during an operation, and do not scan the stack to answer get_max.

Formal Specification

Input: operations, a list of valid operation lists, where values are integers.

Output: A list of integers containing results from pop and get_max operations only.

Constraints

  • 1 <= len(operations) <= 200,000
  • -10^9 <= value <= 10^9
  • Every operation is valid for the current stack state
  • Each operation must run in O(1) worst-case time

Function Signature

def max_stack_operations(operations):
Interviewer

Your question is O(1) Max in Stack. Start with the requirements in the Question tab.

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.
CodePython 3
Sign up free to run your codeLog inLn 2
Run your code to see test output here.