(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
Why did you choose to apply?
2d array c# problem with edge cases
Algoritmical difficult. I'm really did not know.
C# interview: asked about C# and .NET internals, features. Python interview: write a function to generate N prime numbers
How would you go about creating a caching algorithm in c++?
Theoretical questions outside the scope of a C++ dev and more towards a DevOps.
C++ Basics, Questions on syntax
what is destructor ,CharAt(),Memoryleaked,Dispose(), write a program to swap without sing temp variable, program to find duplicate in a string and return bool if it has duplicate. Be prepared with memory management topic and string programs
Given an integer array and another number, find a pair whose sum is given number. Best solution is to use unordered map <int, int> then use this logic map[sum - a[i]] = a[i]; // O(n) then, for each a[i], if map[a[i]] present then that will be the answer. // O(n)
Viewing 961 - 970 interview questions