You are given operations, each operation is denoted by the number of minutes it takes. When you want to do an operation, you always start with the one you last received. You always want to know what is shortest-time remaining operation that you still havent done. You must implement addOperation, doOperation, and answering that question : "How long is the shortest operation that you still didnt do?".
tell me about a challenge you faced and how you solved it
Given a set of words, return the longest "chain" where you can start with one word in a set, and remove one letter at a time, and at each step, the word must be in the set.
Basic behavioral questions, and then two technical problems per interview. I got a question that required using a tree recursively, and a question looking at matrices.
Find the shortest path from source to destination on a weighted graph
Two city scheduling on leetcode
Phone Call Interview -> problem : given a n x m grid, find the given target word in the matrix, the word can be twisted when found (aka horizontal and vertical at the same time)
Tell me about yourself
Tell me about a time you had conflicts with a coworker.
Talk about a project you worked on
Viewing 2381 - 2390 interview questions