Similar to this question: https://leetcode.com/problems/find-pivot-index/ Except instead of finding the pivot index, you just return True or False if the array balanced (meaning if you can sum up elements on one side and it equals the sum of the remaining elements)
What interests you about global markets?
Tell me about your background. Why are you looking for a job? Do you want to be a programmer? Have you used this technology before? Are you familiar with these programming languages? How familiar are you with each? What is your salary expectation? Are you willing to go lower than that? How much lower?
Walk me through your resume
How would you implement a hashmap?
Given an array A and a number x, check for a pair in A with the sum as x. Link - http://www.geeksforgeeks.org/write-a-c-program-that-given-a-set-a-of-n-numbers-and-another-number-x-determines-whether-or-not-there-exist-two-elements-in-s-whose-sum-is-exactly-x/
Went line by line on resume, asking questions.
Asked two difficult maths questions and I need to write the program right away.
GS CEO, last quarterly result
There were many tough C/C++ questions based on pointers
Viewing 3441 - 3450 interview questions