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.
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?
To implement a vending machine
One interview with HR, one technical and one with the people in charge of particular project that the candidate will be assigned to
two sum problem and matrix rotate
Questions on SDLC, Core Java - Multi threading, Exception handling, collections, Java 8 features, Abstract methods & interfaces; Maven , Jenkins, Unix Shell Scripting, basic questions on AWS, SQL Commands, Spring boot - bean scope, DI, Annotations, properties file; JPA hibernate, Spring MVC architecture. Managerial round : Roles & Responsibilities, achievements, interests, questions on how well we can operate under pressure.
did you checking employe profile before setting interview of them ?
Threading, concurrency, design patterns, OO concepts
Java basics, Springboot basics and angular
Viewing 2481 - 2490 interview questions