Chubb

Role: Associate Engineer Trainee (AET)

College: Not Specified (Chubb Business Services India - Campus Hiring)

Interview Date: February 2025 (Approximate, based on article date)

Interview Type: On-Campus, Full-Time

Result: Selected

Difficulty: Medium-Hard

Rounds: 4 rounds (Pre-Placement Talk, Online Assessment, L1 Technical Interview, L2 Technical + HR Interview)

Topics Asked: Graphs, Dynamic Programming, Arrays, Strings, Data Structures, Algorithms, Angular, Software Development Life Cycle (SDLC), Waterfall vs Agile, User Story in Agile, CSS, React Routing, Linked Lists, Projects, Behavioral/HR

Experience:

The candidate participated in the campus hiring process for the Associate Engineer Trainee (AET) role at Chubb Business Services India.

Round 1: HackerRank Test (Online Assessment)
This round consisted of six coding questions (2 Easy, 2 Medium, 2 Hard) testing concepts in graphs, dynamic programming, arrays, and strings. The candidate successfully solved all questions and was shortlisted.

Questions recalled:

• Given a string composed of lowercase letters, Determine the number of substrings that consist solely of vowels, where each vowel appears at least once.
• For each element in an array arr of n integers, determine if it can be expressed as the sum of k integers such that: Each integer is greater than 0. Exactly k−1 integers are even powers of 2 (0 is not considered an even power of 2). Exactly one integer is less than 4. Find the minimum value of k for each element. If it's not possible, return −1 for that element.
• A server network is a tree with g nodes (servers) and g−1 edges, where each edge connects two servers with a transfer time of 1 unit. Given the tree structure, determine the maximum time required to transfer data between any two servers in the network.
• Given an array arr of n integers, perform n−1 operations to reduce the array to a single element. In each operation: Remove the minimum and maximum elements, and add their sum back to the array. Calculate the cost as: cost = ceil((min+max)/(max-min+1)). Find the total cost after all operations.

Round 2: Technical Interview (L1)
This round lasted approximately 45 minutes with two panelists. The focus was on medium-level coding questions and skills listed on the resume. As the candidate had Angular experience, questions related to it were asked.

Coding Questions (Easy-Medium):

• Sort an array of 0s, 1s and 2s.
• Spiral Matrix.
• Longest substring without repeating characters.

Round 3: Technical + HR Interview (L2)
The final round lasted approximately 45 minutes and combined technical and HR elements.

Questions:

• Coding Question: Write a program to implement Singly Linked List, Doubly Linked List, and Circular Linked List using function overloading for the insert() operation.
• Resume Discussion: Explained project experiences and highlighted key achievements.
• Can you explain the Software Development Life Cycle (SDLC) and its stages?
• What is the difference between the Waterfall and Agile methodologies?
• What is the process of handling a user story in Agile?
• What is the difference between display: none and visibility: hidden in CSS?
• How does routing work in React, and how can you implement it?

The candidate received an offer from Chubb.