1.Consecutive ones in array. 2.Max in array, provide solution using thread if a system has 4 cores available. then max should be computed using all the 4 cores instead of running only on one core. 3. Find shortest path to reach at end of the row, in a 2D matrix containing ones and zeros. Ones are the cells can be traversed and Zeros can't be jumped. 4. Convert a max heap to min heap
2 question one is implement binary search other is find loop in linked list
2 DSA question related to stack , queue and tree.
linked list questions, Java API design, OO principles such as SOLID, Lambda concepts, Java vs. Kotlin, some Micro services architecture questions etc.
DSA + LLD on elevator system
Simple graph trace, BST and two points variants
Company overview and exploratory round to check skills Technical 1: Observer pattern question, linked list question Technical 2: LLD / HLD on API and SDK
1- SQL query structuring 2- Website optimisation (from fullstack point of view) 3- how to debugging microservices
Why do you want to work here? (and the other usual questions. It has been a while so I don't remember much.)
Given n sticks, joining two sticks takes arr.i + arr.j effort, join all with minimum effort. 2d array of 0 and 1s. Find total no.of islands Water trapped between buildings, etc Some Java, GC based and project based questions
Viewing 471 - 480 interview questions