The company invests in employees' wellbeing through wellness workshops that promote both professional and personal development.
Company sponsors certifications and external learning.
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
There were two rounds. The first was technical, and the second was an HR/Managerial round. This was an on-campus recruitment. 1. Technical round: This was mostly on OOPS, DBMS, and DSA questions. 2. Second round: This was mainly based on my projects
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
There were two rounds. The first was technical, and the second was an HR/Managerial round. This was an on-campus recruitment. 1. Technical round: This was mostly on OOPS, DBMS, and DSA questions. 2. Second round: This was mainly based on my projects
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.