Not the actual question, I've modified a bit: Find the element(s) in an integer array such that if it's removed, the rest of the array can be divided into 2 sub-arrays of equal sums. The sub-arrays need not contain contiguous elements. There may be 0 or more answers.
I was asked about my qualifications for data warehousing
Do you use Android or iPhone? Why did you choose it?
coding assignment that may sound kind of cool to you but not
How would you bypass change management processes to dynamically change OS JCL streams?
In Selenium, which commands were not used to pause execution until the specified element in the table on a web page becomes present?
What kind of projects I worked on before.
How would you scale a web application with millions of users
Why should we hire you
My 1-on-1 process as an Engineering Manager.
Viewing 51 - 60 interview questions