You are given intervals of contiguous integers, like [1, 10), [15, 25), [40, 50), which are non-overlapping and of a fixed size. Design a data structure to store these intervals and have the operations of insert, delete, and find functions
Software Engineer 2 Interview Questions
665,793 software engineer 2 interview questions shared by candidates
The meeting room problem.
Q1: If there is a new Android engineer, how will you suggest the best practice of async jobs in Android? (And the detail about AsyncTask, Executor, Thread interrupt, memory leak...and so on) Q2: Give an unsorted array, find the kth smallest item (Can you do it more quickly?)
It was a mathematical questions about finding the greatest number (but less than the given number) by reordering the digits in the number.
Design an enumerator (e.g. named FBSuperEnumerator) that has two API's: - (id) nextObject; - (NSArray *) allObjects; // all objects remaining which, when given an input array that has content that can be either NSNumbers or NSArray, will expand all arrays embedded inside it. That is, given an input of something like @[@1, @[@2, @[@3, @4]], @[ ], @5], each call to nextObject will display items in the expected order.
2 leetcode easies, 2 leetcode mediums (Codesignal)
Sort a matrix in diagonal order after manipulation
Max Profit Buy Sell Stocks, K Closest Points to Origin and Copy List with Random Pointers
Print Tree nodes level by level
Diameter of binary tree. Find number of islands. Meeting room problem.
Viewing 1751 - 1760 interview questions