Great Company
Excellent Technology Exposure
Great Leadership
None that I know of
None
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.
On campus Round 0 - OA (logical reasoning, SQL, ML) Round 1 - GD, was given a topic on AI: good or bad. Round 2 - Technical (SQL, projects in depth). Was asked in depth about every project on my resume and internals about the tools I used (they ev
The process was smooth, with a total of three rounds. All the interviewers were amazing and extremely talented. They explained the questions clearly and helped me understand them before I answered. The questions were a mix of theory and practical.
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.
On campus Round 0 - OA (logical reasoning, SQL, ML) Round 1 - GD, was given a topic on AI: good or bad. Round 2 - Technical (SQL, projects in depth). Was asked in depth about every project on my resume and internals about the tools I used (they ev
The process was smooth, with a total of three rounds. All the interviewers were amazing and extremely talented. They explained the questions clearly and helped me understand them before I answered. The questions were a mix of theory and practical.