Design a data structure where insertion, deletion, data access and get random element are all done in O(1), i.e., constant time. (Without using STL or Hash tables)
Development Interview Questions
137,363 development interview questions shared by candidates
Many sticks with length, every time combine two, the cost is the sum of two sticks' length. Finally, it will become a stick, what's the minimum cost?
Most efficient way to find the most frequent number (0-255) in a string of numbers
One of the question was on Designing & Code a TTL Cache with some modifications
Given an array, return the nth largest.
Bar-raiser was difficult and unexpected (to me) as I'm from embedded application dev background and haven't dealt with such scenario's.
Leetcode
In my interview the most challenging question was: How to get the 3rd element in a singly linked list, if you you the last one.
Reverse a string in-place.
Given a value and an array of integers, find if there are two integers in the array that add up to the value.
Viewing 281 - 290 interview questions