They were looking for a developer with 1 to 3 years of experience. I had a phone call from AMEX to give their introduction and to learn about my area of interest. I convinced them that I could be a perfect employee for their requirement. They then ar
The interview was conducted in three parts. Two were technical rounds, which focused on data structures, networking, operating systems, and the projects mentioned on the resume. The third was an HR round. The interview was carried out well, and th
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.
They were looking for a developer with 1 to 3 years of experience. I had a phone call from AMEX to give their introduction and to learn about my area of interest. I convinced them that I could be a perfect employee for their requirement. They then ar
The interview was conducted in three parts. Two were technical rounds, which focused on data structures, networking, operating systems, and the projects mentioned on the resume. The third was an HR round. The interview was carried out well, and th
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.