American Express

Maximum Sum of Non-Adjacent Elements You are given an array/list of ‘N’ integers. You are supposed to return the maximum sum of a subsequence with the constraint that no two elements are adjacent in the given array/list.

Two rounds. One on campus, two back-to-back interviews, and then fly out to the office location where there was a super day and tour of the building, and then one-on-one interview with an interviewer.

The interview covered mostly OOP and Java concepts, such as the difference between method overloading and overriding. There were also some SQL questions, basic coding questions (like factorial and letter replacement), and a few tricky estimation ques