You are required to design and implement a stack data structure that supports the following operations, all in O(1) time complexity: 1️⃣ push(x) — Pushes an integer x onto the stack. 2️⃣ pop() — Removes the element on the top of the stack. 3️⃣ top() — Gets the top element of the stack. 4️⃣ getMin() — Retrieves the minimum element currently in the stack. 5️⃣ getMax() — Retrieves the maximum element currently in the stack.
Tell me about yourself, have you ever worked with compilers, and a single theoretical question I'm not sure I can disclose.
The most difficult task in my job? HashMap, HashSet internally? ACID, Spring
What would you implement to process this string containing this arithmetical expression? (compiler exercise for 3h) What algorithm would you implement for finding at which step of the ladder the eggs would break if you had 1 egg only? if you had a basket of eggs...? What did you learn about yourself in the last 3-4 months? Cite 4 qualities of yours. What problem did you have at work recently? What did you do in there?
Tech 1: Write a function which looks for two elements in an array whose sum is a specific number. Can you do it in O(1) time? Tech 2: A very simple parser of expressions. Build a syntax tree, evaluate the expression and find operations resulting in division by zero.
Mainly core Java and Spring Boot
What is your experience with Scrum and can you describe the process?
One interview with HR, one technical and one with the people in charge of particular project that the candidate will be assigned to
qué es un balanceador de carga, diferencias entre un idp y un sp. coding question. easy leetcode question encode lenght string get most repeated number
two sum problem and matrix rotate
Viewing 3191 - 3200 interview questions