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
The first one included 2 Leetcode easy algo questions, followed up by some Operating Systems and C++ questions. The second interview was an interview with the hiring manager, where we discussed the role in more detail, and talked about my previous experience. Then we continued to implement a part of the solution for the design of their de-scoped, in-house storage solution. The third interview was an interview with a Senior member of Technical Staff, where the task was to design a DBMS for unstructured data, with a replication factor of 3. We then discussed the potential drawbacks and trade-offs of the solution.
Mostly open ended questions about previous experience.
If you're currently employed, tell me why you're looking for a new position and what you're looking for. If you're not currently employed, state the reason for leaving your last employer. What are you looking for in your next position?
Data structures, Python coding problems and lot more
How do you deal with criticism?
Tell me about a recent situation when you built a relationship with a new client, customer, or co-worker. What actions did you take to build and maintain the relationship?
linked list questions, Java API design, OO principles such as SOLID, Lambda concepts, Java vs. Kotlin, some Micro services architecture questions etc.
- idempotency - indexing - OOPS - DSA - python constructs deep dive such as async, context managers - SQL For code review - it's straight forward if you have been doing code reviews
DSA- we need to return the count of total mines destroyed in a matrix.
Viewing 741 - 750 interview questions