(technical interview) You have two arrays: A and B. A contains ints and B has pairs: (element from A, the number of elements that are larger than that element and to the right of it in A). for example: A = [4,3,5] B = [(5,0), (3,1), (4,1)] Given array B, recreate array A
Tell me about your project?
What is a virtual function?
Why did you choose to apply?
data structures and their use
2d array c# problem with edge cases
Questions were like: two sums - In an array, find 2 elements that yield the given sum. Reverse a linked list
describe logic of: Hash table, cash, balanced b-tree etc..
Algoritmical difficult. I'm really did not know.
Multi Thread tools: Mutex, critical section, data race, dead lock etc.
Viewing 5171 - 5180 interview questions