You are provided with a linked list and need to implement the push and pop functionalities of a stack using this linked list. Your task is to complete the push() and pop() methods in the given class template. The push() method accepts an integer x as input and adds it to the stack, while the pop() method removes and returns the integer at the top of the stack. If the stack is empty, the pop() method should return -1.
Note: The input consists of a series of queries representing operations on the stack. There are two types of queries, as described below:
Query type 1: This query includes an additional parameter x and performs the operation to push x into the stack.
Query type 2: This query performs the operation to pop an element from the stack and return the popped value.
Topics
Companies
Articles
Examples:
Expected Time Complexity: O(1)
Expected Space Complexity: O(1)
Constraints:
1 <= numbers of calls made to push, pop <= 100
1 <= x <= 100
Companies:
MicrosoftSamsungCiscoCognizant
Topics:
Stack
Please log in to access the Submissions tab, where you can review your progress and explore code submissions from other participants.
Please log in to access the Solution tab and view detailed answers and explanations.
Please log in to access the Discussion tab and join conversations with other participants.
Access Restricted: Please Login to access the code editor and test cases.