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.
about yourself
Basic Network Enginnering and planning questions. They wanted to gauge the candidate's skills to design a Global CDN Network
Care: Describe a time where you went the extra mile for the health and safety of a colleague.
The questions were around operating systems (deadlocks, semaphores), queuing theory and computer architecture(Pipeline). Most of the interviewers were not ready for asking questions and I was told that "I don't have any specific question for you. so, just explain ...."
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?
General Performance testing concepts questions and willingness to work on different shifts.
Viewing 381 - 390 interview questions