Good work-life balance. Good job security.
Not much scope for career growth.
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
It had a 130-minute coding round with 3 questions to solve. Next, there were two technical F2F rounds and one HR+technical round. They shortlisted 35 people for the further rounds.
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.
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
It had a 130-minute coding round with 3 questions to solve. Next, there were two technical F2F rounds and one HR+technical round. They shortlisted 35 people for the further rounds.
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.