A shop in HackerLand contains n items where the price of the ith item is priceli]. In one operation, the price of any one item can be increased or decreased by 1. Given q queries denoted by the array queryll, find the minimum number of operations required to make the price of all items equal to each queryli] (0 ≤ i < q).
cant say because I signed NDA
Variable length sliding window question
Given a list of generic items, describe/code the approach would you take to finding the most common item.
Two coding questions. I could barely answer one in the time given.
Min Heap, Longest Common Substring, DFS
How would you approach a full day of work given a collection of tasks you're assigned to do? (time management)
medium difficulty coding questions
Optimize finding the largest plot of land under a given budget
What was the hardest challenge that you've faced so far?
Viewing 2071 - 2080 interview questions