chubb logo
Chubb· Software Engineer

Chubb Interview Experience | Software Engineer | 2026

Posted
19 Oct 2026
0 reads

Summary

I went through three rounds of interviews at Chubb for a Software Engineer position, including an online assessment, a technical interview, and a managerial interview.

How it went

Hi everyone!

IT WAS AN ON CAMPUS OPPORTUNITY The hiring process consisted of 3 rounds:

Online Assessment
L1 Technical Interview
L2 Managerial Interview.

Round 1: Online Assessment (OA)

The OA consisted of 2 sections with 5 coding questions in total. I successfully completed 4.5 questions

SECTION 1 - 3 Questions (Easy - medium)
SETION 2 - 2 Questions (Medium)
DURATION - 120 mins

1. Minimize the Maximum Array Element

Given an array, choose indices l, r and an offset i where 0 <= l < r < n and 0 <= i < r. You can perform the operation arr[l+r] = arr[l+i] & arr[r-i], where & denotes bitwise AND. Find the minimum possible value of the maximum element after performing the operation any number of times.

2. Maximize Revenue from Selling Items

A shop has n types of items, with their quantities given in an array. The price of an item equals its current remaining quantity. Given m customers, find the maximum revenue by selling one item to each customer.

3. Minimize the Sum of Prefix Costs

The cost of each array element is the number of distinct elements in the prefix ending at that position. You can rearrange the array into any permutation. Find the minimum possible sum of the costs.

Section 2: 2 Questions

4. Count Valid Pairs

Given an array and integers k and x, count pairs of indices (i, j) satisfying arr[i] <= arr[j], such that the interval [arr[i], arr[j]] contains exactly k elements divisible by x.

5. Maximum Element After Rotations

Given an array arr and an array rotate, find the index of the maximum element after performing the specified number of rotations for each query.

Note: These problem descriptions are based on my recollection.

Round 2: L1 Technical Interview

The questions covered my resume, projects, and the technologies I had mentioned.

  • Introduce yourself.
  • What is normalization? Explain the different normal forms.
  • Explain ACID properties and deadlocks. How can deadlocks be handled?
  • Write an SQL query to find the second-highest salary.
  • Differentiate between DELETE, TRUNCATE, and DROP.
  • What is JWT? Explain the token creation and validation process.
  • Differentiate between MySQL and H2.
  • Differentiate between SQL and NoSQL databases.
  • Differentiate between a process and a thread.
  • Differentiate between async def and def.
  • What is middleware in Express.js?
  • Explain the Virtual DOM.
  • Differentiate between Spring and Spring Boot.
  • Explain one of your projects.
  • What are the advantages and disadvantages of using AI for coding?
  • Explain the Singleton design pattern.
  • What is RBAC (Role-Based Access Control)?
  • Reverse a linked list.
  • Given an array where every element appears twice except one, find the unique element.

Round 3: L2 Managerial Interview

This round focused on managerial and situational questions rather than technical concepts.

The questions I was asked included:

  • What motivates you?
  • Tell me one thing that gave you a quirk in the last month.
  • You are assigned a complex task with a strict deadline. How would you approach it?
  • Explain one of your projects, the challenges you faced, and how you resolved them.
  • What is hallucination?
  • A colleague shares confidential information with you, but you discover that they are doing something unethical. How would you handle the situation?

These all are i can recall as of now.

That's my interview experience with Chubb! I hope this helps others preparing chubb. All the best to everyone attending the interviews!

Questions asked (7)

  1. 01

    Minimize the Maximum Array Element

    Data Structures & Algorithms

    Given an array, choose indices l, r and an offset i where 0 <= l < r < n and 0 <= i < r. You can perform the operation arr[l+r] = arr[l+i] & arr[r-i], where & denotes bitwise AND. Find the minimum possible value of the maximum element after performing the operation any number of times.

  2. 02

    Maximize Revenue from Selling Items

    Data Structures & Algorithms

    A shop has n types of items, with their quantities given in an array. The price of an item equals its current remaining quantity. Given m customers, find the maximum revenue by selling one item to each customer.

  3. 03

    Minimize the Sum of Prefix Costs

    Data Structures & Algorithms

    The cost of each array element is the number of distinct elements in the prefix ending at that position. You can rearrange the array into any permutation. Find the minimum possible sum of the costs.

  4. 04

    Count Valid Pairs

    Data Structures & Algorithms

    Given an array and integers k and x, count pairs of indices (i, j) satisfying arr[i] <= arr[j], such that the interval [arr[i], arr[j]] contains exactly k elements divisible by x.

  5. 05

    Maximum Element After Rotations

    Data Structures & Algorithms

    Given an array arr and an array rotate, find the index of the maximum element after performing the specified number of rotations for each query.

  6. 06

    Reverse a Linked List

    Data Structures & Algorithms

    Given a singly linked list, reverse it in place.

  7. 07

    Find Unique Element in Array

    Data Structures & Algorithms

    Given an array where every element appears twice except one, find the element that appears only once.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Chubb recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!