Given an array of integers (OR a linked list), and an integer K - write an algorithm to find two elements of the array which sum up to K. * Time complexity of Theta(N) where N is the amount of elements in the array/list. * The algorithm can access the array / list only once. * The size of the array / list is unknown beforehand. * The elements should sum up to K exactly.
It was not a question. It was a prep session for next stage
Why would you like to change offices
How does the heap work in Java?
Why EY?
How many protocols you have worked on Load Runner?
They asked me if I had worked on LoadRunner specifically and asked how it runs, what are the different components etc
General Performance testing concepts questions and willingness to work on different shifts.
Care: Describe a time where you went the extra mile for the health and safety of a colleague.
about yourself
Viewing 381 - 390 interview questions