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.

I first spoke to the recruiter at a career fair and then scheduled an interview for the summer internship. There were behavioral and technical rounds. The behavioral round focused on why I wanted to work there. The technical round involved a whiteb

The interviewer asked me technical questions over the phone that were problem-solving teasers. He also asked me about the memory allocation of int, char, boolean, etc. He also asked about memory allocation errors and how to prevent them.