Implement (actually explain, because it's over the phone), a "max()" function inside of a Stack data structure of numbers. Meaning that every time you'll do a push() or poll() actions, you can run max() and say what is the current max number in the stack. This has to be an O(1) of time complexity and he don't care about space complexity.
Solving sorting medium-to-hard computation algorithms
Asked 2 python programs 4 questions on python
The assessment was not very clear, it was very simple but the instructions weren't clear. They asked to make a simple "calculator" application with provided functions?
What is your ideal work environment?
They asked what's the most important thing for me applying to job process.
Nothing involving details (coding syntax). Friendly survey of tech stack.
How much DSA you know
General questions about API, how do you document your API, how do you test your API
Given a list of unsorted numbers and an integer (n), return the n biggest and n smallest elements from that list of numbers.
Viewing 2161 - 2170 interview questions