cswork / libraryOpen practice workspace

Interview guides · Brillio

Brillio Software Engineer Interview Guide

Brillio Software Engineer interview guide: reported rounds, questions and how candidates describe the process.

The 60-second brief

At Brillio, a Software Engineer plays a pivotal role in driving digital transformation and enterprise modernization for Fortune 1000 clients globally. Operating at the intersection of technology consulting, cloud engineering, and digital product creation, engineers at Brillio are responsible for building scalable, high-performing software applications across domains such as financial services, retail, healthcare, and technology. In this role, your work directly influences client outcomes, digital strategy implementation, and core product architecture. Whether you are modernizing legacy enterprise systems into cloud-native microservices, building responsive frontend applications, or designing robust API integrations, you will be solving complex technical challenges at scale.

This guide is scoped to a Software Engineer candidate at Brillio.

Focus areas

  • React.js
  • JavaScript
  • Coding Assessments

The Brillio interview process

Brillio candidates report 4 rounds over 3-5 weeks. The stages below are what candidates describe, not a published process.

Online Assessment

Comprehensive assessment covering quantitative aptitude, logical reasoning, core computer science concepts, and coding challenges.

What to demonstrate

  • Comprehensive assessment covering quantitative aptitude, logical reasoning, core computer science concepts, and coding challenges
  • Depth in React.js

How to prepare

  • Answer aloud and timed: Write a program to flatten a multi-dimensional or nested array without using built-in utility functions like .flat.
  • Answer aloud and timed: Implement a function to calculate element frequencies in an array or collection using standard collections or streams.

Group Discussion

Round designed to test verbal articulation, logical reasoning, and teamwork under time constraints.

What to demonstrate

  • Round designed to test verbal articulation, logical reasoning, and teamwork under time constraints
  • Depth in React.js

How to prepare

  • Answer aloud and timed: Write a program to check if a number is prime and optimize its time complexity.
  • Answer aloud and timed: Demonstrate the implementation of basic data structures like a Linked List, Stack, or Queue, and explain their memory allocation.

Technical Interview

One or two rounds focusing on technical skills and problem-solving abilities.

What to demonstrate

  • One or two rounds focusing on technical skills and problem-solving abilities
  • Depth in React.js

How to prepare

  • Answer aloud and timed: Explain the internal working of a HashMap or hash table, including hash collisions and resolution strategies.
  • Answer aloud and timed: Explain the core OOPS principles—Abstraction, Encapsulation, Inheritance, and Polymorphism—and provide real-world software engineering examples for each.

HR Discussion

Final discussion with HR to evaluate cultural fit and discuss potential offer.

What to demonstrate

  • Final discussion with HR to evaluate cultural fit and discuss potential offer
  • Depth in React.js

How to prepare

  • Answer aloud and timed: What is the difference between method overloading and method overriding? Provide code snippets illustrating both.
  • Answer aloud and timed: What new features were introduced in Java 8 (e.g., Lambda expressions, Streams API, Functional Interfaces), and why are they beneficial?

Where candidates lose points

Master SQL query writing prior to your interview

SQL is tested rigorously across nearly all engineering profiles at Brillio. Be fluent in writing queries involving subqueries, self-joins, GROUP BY, HAVING, and window functions without relying on IDE autocompletion.

Prepare detailed walkthroughs of your past projects

Be ready to explain your specific contributions, technologies used, architectural decisions made, and technical challenges overcome in previous projects.

Communicate your thought process during live coding

Interviewers value clear logic and problem-solving methodology. Speak aloud as you draft your solution, explain edge cases, and discuss time and space complexity.

Questions & practice

Write a program to flatten a multi-dimensional or nested array without using built-in utility functions like `

Medium · Core Programming & Data Structures

Write a program to flatten a multi-dimensional or nested array without using built-in utility functions like .flat.

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

Implement a function to calculate element frequencies in an array or collection using standard collections or

Medium · Core Programming & Data Structures

Implement a function to calculate element frequencies in an array or collection using standard collections or streams.

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

Write a program to check if a number is prime and optimize its time complexity.

Medium · Core Programming & Data Structures

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

Demonstrate the implementation of basic data structures like a Linked List, Stack, or Queue, and explain their

Medium · Core Programming & Data Structures

Demonstrate the implementation of basic data structures like a Linked List, Stack, or Queue, and explain their memory allocation.

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

  • What happens if two callers reach this at the same time?
  • Where could this allocate more than you expect?

Explain the internal working of a HashMap or hash table, including hash collisions and resolution strategies.

Medium · Core Programming & Data Structures

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

Explain the core OOPS principles—Abstraction, Encapsulation, Inheritance, and Polymorphism—and provide real-wo

Medium · Object-Oriented Programming & Language C

Explain the core OOPS principles—Abstraction, Encapsulation, Inheritance, and Polymorphism—and provide real-world software engineering examples for each.

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

  • What happens if two callers reach this at the same time?
  • Where could this allocate more than you expect?

What is the difference between method overloading and method overriding? Provide code snippets illustrating bo

Medium · Object-Oriented Programming & Language C

What is the difference between method overloading and method overriding? Provide code snippets illustrating both.

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

  • What happens if two callers reach this at the same time?
  • Where could this allocate more than you expect?

Explain memory management in managed languages, including garbage collection, memory leaks, and how to prevent

Medium · Object-Oriented Programming & Language C

Explain memory management in managed languages, including garbage collection, memory leaks, and how to prevent them.

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

  • What happens if two callers reach this at the same time?
  • Where could this allocate more than you expect?

Discuss the concept of immutability in programming languages like Java or JavaScript, and explain why String

Medium · Object-Oriented Programming & Language C

Discuss the concept of immutability in programming languages like Java or JavaScript, and explain why String is immutable in Java.

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

  • What happens if two callers reach this at the same time?
  • Where could this allocate more than you expect?

What is the difference between synchronous and asynchronous processing, and how do event loops or async/await

Medium · Web Technologies & Frameworks

What is the difference between synchronous and asynchronous processing, and how do event loops or async/await work in JavaScript or Node.js?

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

  • What happens if two callers reach this at the same time?
  • Where could this allocate more than you expect?

Write an SQL query to find the second highest (or Nth highest) salary from an Employee table without hardcod

Medium · Database Management & SQL

Write an SQL query to find the second highest (or Nth highest) salary from an Employee table without hardcoding offsets.

Approach

  1. Name the grain you start from and join outward from it.
  2. Check whether any join is one-to-many before aggregating, or the sums inflate.
  3. Say which index the query would use, and what makes it unusable.
  4. Handle the rows that do not match: that is usually the actual question.

Follow-up

  • How does the query change if that join becomes one-to-many?
  • What happens to this when the table is ten times larger?

Explain the difference between INNER JOIN, LEFT JOIN, RIGHT JOIN, and FULL OUTER JOIN with practical database

Medium · Database Management & SQL

Explain the difference between INNER JOIN, LEFT JOIN, RIGHT JOIN, and FULL OUTER JOIN with practical database scenarios.

Approach

  1. Name the grain you start from and join outward from it.
  2. Check whether any join is one-to-many before aggregating, or the sums inflate.
  3. Say which index the query would use, and what makes it unusable.
  4. Handle the rows that do not match: that is usually the actual question.

Follow-up

  • How does the query change if that join becomes one-to-many?
  • What happens to this when the table is ten times larger?

Write SQL queries involving aggregate functions (GROUP BY, HAVING) and conditional data modifications (`UP

Medium · Database Management & SQL

Write SQL queries involving aggregate functions (GROUP BY, HAVING) and conditional data modifications (UPDATE, CASE).

Approach

  1. Name the grain you start from and join outward from it.
  2. Check whether any join is one-to-many before aggregating, or the sums inflate.
  3. Say which index the query would use, and what makes it unusable.
  4. Handle the rows that do not match: that is usually the actual question.

Follow-up

  • How does the query change if that join becomes one-to-many?
  • What happens to this when the table is ten times larger?

What are database indexes, how do they improve query performance, and what are the trade-offs associated with

Medium · Database Management & SQL

What are database indexes, how do they improve query performance, and what are the trade-offs associated with over-indexing?

Approach

  1. Name the grain you start from and join outward from it.
  2. Check whether any join is one-to-many before aggregating, or the sums inflate.
  3. Say which index the query would use, and what makes it unusable.
  4. Handle the rows that do not match: that is usually the actual question.

Follow-up

  • How does the query change if that join becomes one-to-many?
  • What happens to this when the table is ten times larger?

Explain ACID properties in relational databases and contrast SQL databases with NoSQL stores.

Medium · Database Management & SQL

Approach

  1. Name the grain you start from and join outward from it.
  2. Check whether any join is one-to-many before aggregating, or the sums inflate.
  3. Say which index the query would use, and what makes it unusable.
  4. Handle the rows that do not match: that is usually the actual question.

Follow-up

  • How does the query change if that join becomes one-to-many?
  • What happens to this when the table is ten times larger?

How do you approach application performance optimization, database query tuning, and code refactoring?

Medium · Architecture, Cloud & System Design

Approach

  1. Name the grain you start from and join outward from it.
  2. Check whether any join is one-to-many before aggregating, or the sums inflate.
  3. Say which index the query would use, and what makes it unusable.
  4. Handle the rows that do not match: that is usually the actual question.

Follow-up

  • How does the query change if that join becomes one-to-many?
  • What happens to this when the table is ten times larger?

What new features were introduced in Java 8 (e.g., Lambda expressions, Streams API, Functional Interfaces), an

Medium · Object-Oriented Programming & Language C

What new features were introduced in Java 8 (e.g., Lambda expressions, Streams API, Functional Interfaces), and why are they beneficial?

Approach

  1. Say who the caller is and what they do when the call fails halfway.
  2. Define the identity of a request so a retry cannot double-apply it.
  3. Separate accepted, pending, failed and confirmed; they are different facts.
  4. Design the error taxonomy before the success shape; callers branch on it.

Follow-up

  • What happens if the caller retries after a timeout?
  • How does a client discover it is on an old version of this contract?

How does component state management work in React, and what are the key lifecycle methods or modern React Hook

Medium · Web Technologies & Frameworks

How does component state management work in React, and what are the key lifecycle methods or modern React Hooks (useEffect, useState, useMemo)?

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

Write a basic React component or JavaScript module that fetches data from a REST endpoint and renders it insid

Medium · Web Technologies & Frameworks

Write a basic React component or JavaScript module that fetches data from a REST endpoint and renders it inside a dynamic card interface.

Approach

  1. Say who the caller is and what they do when the call fails halfway.
  2. Define the identity of a request so a retry cannot double-apply it.
  3. Separate accepted, pending, failed and confirmed; they are different facts.
  4. Design the error taxonomy before the success shape; callers branch on it.

Follow-up

  • What happens if the caller retries after a timeout?
  • How does a client discover it is on an old version of this contract?

Explain the request-response lifecycle in a Spring Boot or Node.js RESTful web service, including middleware a

Medium · Web Technologies & Frameworks

Explain the request-response lifecycle in a Spring Boot or Node.js RESTful web service, including middleware and controller routing.

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

Explain API-led connectivity, RAML, and the architectural differences between SOAP and REST web services.

Medium · Web Technologies & Frameworks

Approach

  1. Say who the caller is and what they do when the call fails halfway.
  2. Define the identity of a request so a retry cannot double-apply it.
  3. Separate accepted, pending, failed and confirmed; they are different facts.
  4. Design the error taxonomy before the success shape; callers branch on it.

Follow-up

  • What happens if the caller retries after a timeout?
  • How does a client discover it is on an old version of this contract?

How do you design a scalable online transaction system (e.g., Google Pay or an e-commerce checkout flow)?

Medium · Architecture, Cloud & System Design

Approach

  1. Fix the scope first: who calls this, how often, and what they do when it fails.
  2. Name the read and write paths separately; they rarely have the same bottleneck.
  3. Choose a partition key and say what query it makes expensive.
  4. State the consistency you need, and where you are willing to be stale.

Follow-up

  • What breaks first when traffic grows ten times?
  • How does this behave when that dependency is down for an hour?

Explain microservices architecture and how service discovery, API gateways, and distributed caching operate.

Medium · Architecture, Cloud & System Design

Approach

  1. Fix the scope first: who calls this, how often, and what they do when it fails.
  2. Name the read and write paths separately; they rarely have the same bottleneck.
  3. Choose a partition key and say what query it makes expensive.
  4. State the consistency you need, and where you are willing to be stale.

Follow-up

  • What breaks first when traffic grows ten times?
  • How does this behave when that dependency is down for an hour?

What are the foundational services in cloud platforms like AWS or GCP (e.g., VPC, S3, EC2, Lambda, IAM), and h

Medium · Architecture, Cloud & System Design

What are the foundational services in cloud platforms like AWS or GCP (e.g., VPC, S3, EC2, Lambda, IAM), and how do you secure data in transit and at rest?

Approach

  1. Say who the caller is and what they do when the call fails halfway.
  2. Define the identity of a request so a retry cannot double-apply it.
  3. Separate accepted, pending, failed and confirmed; they are different facts.
  4. Design the error taxonomy before the success shape; callers branch on it.

Follow-up

  • What happens if the caller retries after a timeout?
  • How does a client discover it is on an old version of this contract?

Read latency spikes on a sixty-second sawtooth

Medium · cache stampede · single-flight · ttl

The cached listing read path serves about 14k reads/second at an 85% hit rate. p99 sits at 35 ms for 57 seconds, jumps to 900 ms for 3, and repeats. During each spike the primary shows several hundred identical listing queries starting within the same millisecond, all carrying one large tenant's id. Cache entries use a 60-second TTL. Give the mechanism, the ordered checks, the fix, and the correctness hazard your fix must not introduce.

Approach

  1. Match the period to a configured number before theorising about load. A spike every 60 seconds against a 60-second TTL is an entry expiring, and you confirm it by correlating spike timestamps with the entry's write time rather than with the traffic curve. If the period had matched a cron or a GC interval instead, this is a different investigation.
  2. Establish the concurrency of the miss. Several hundred identical queries in one millisecond means the miss path has no coalescing: every request that arrives between expiry and repopulation recomputes. The herd size is that key's arrival rate times its recompute time, so at 1.2k reads/second for the hot key and a 250 ms recompute you expect about 300 concurrent misses, which matches what is observed.
  3. Add single-flight on the miss path so one caller per key recomputes under a short-lived lock while the rest wait for its result. Prefer stale-while-revalidate where the read tolerates it: return the expired value immediately and refresh asynchronously, which removes the latency spike rather than serialising it into a queue of waiters.
  4. De-synchronise the keys. Write TTLs with jitter, for example 60 seconds plus or minus 10%, so a deploy or a mass invalidation does not align every key on the same second and turn a per-key herd into a fleet-wide one.

Follow-up

  • The same sawtooth appears on a key that is invalidated on write rather than expired. Is that the same bug?
  • How does your answer change if the recompute takes 4 seconds instead of 250 ms?

Suggested practice checklist

Built from the rounds and topics Brillio candidates report.

Day 1 — Map the Brillio loop

  • Write out the reported sequence: Online Assessment, Group Discussion, Technical Interview, HR Discussion.
  • For each round, write one sentence on what it is judging, from the description above, and mark the one you are least ready for.

Deliverable: A one-page map of the 4 reported rounds, with the weakest marked.

Day 2 — Work React.js

  • Spend the session on React.js, which Brillio candidates report being tested on.
  • Write one worked example in React.js and time yourself on it.

Deliverable: One timed worked example in React.js.

Day 3 — Work JavaScript

  • Spend the session on JavaScript, which Brillio candidates report being tested on.
  • Write one worked example in JavaScript and time yourself on it.

Deliverable: One timed worked example in JavaScript.

Day 4 — Work Coding Assessments

  • Spend the session on Coding Assessments, which Brillio candidates report being tested on.
  • Write one worked example in Coding Assessments and time yourself on it.

Deliverable: One timed worked example in Coding Assessments.

Day 5 — Answer out loud: Core Programming & Data Structures

  • Answer aloud, timed: Write a program to flatten a multi-dimensional or nested array without using built-in utility functions like .flat.
  • Answer aloud, timed: Implement a function to calculate element frequencies in an array or collection using standard collections or streams.

Deliverable: Spoken answers to 2 reported Core Programming & Data Structures question(s), under time.

Day 6 — Answer out loud: Object-Oriented Programming & Language Concepts

  • Answer aloud, timed: Explain the core OOPS principles—Abstraction, Encapsulation, Inheritance, and Polymorphism—and provide real-world software engineering examples for each.
  • Answer aloud, timed: What is the difference between method overloading and method overriding? Provide code snippets illustrating both.

Deliverable: Spoken answers to 2 reported Object-Oriented Programming & Language Concepts question(s), under time.

Day 7 — Answer out loud: Database Management & SQL

  • Answer aloud, timed: Write an SQL query to find the second highest (or Nth highest) salary from an Employee table without hardcoding offsets.
  • Answer aloud, timed: Explain the difference between INNER JOIN, LEFT JOIN, RIGHT JOIN, and FULL OUTER JOIN with practical database scenarios.

Deliverable: Spoken answers to 2 reported Database Management & SQL question(s), under time.

Behavioural preparation

Behavioural rounds judge the decision you made and what it cost.

Reverse your own decision and price the reversal

Medium · reversibility · measurement · migrations

Describe a technical decision you made and later reversed. Pick one that cost something: a service you split and merged back, a cache you added and removed, an index you created that pushed the planner onto a worse plan, a projection you rebuilt from scratch. State what you believed when you decided, the measurement that changed your mind, how long the wrong version ran in production, and what the reversal cost in migrations, dual writes, and a deprecation window for callers you did not own.

Approach

  1. State the original rationale without irony, in the version you would still defend given what was known then. If it is not defensible, the story is about carelessness rather than judgement, and a different example serves you better.
  2. Give the measurement that moved with a before and after: the p99 that did not improve, the cache hit rate that sat at 40%, the plan that flipped to a sequential scan once the table passed a size you can name.
  3. Cost the reversal in steps, not adjectives: expand-and-contract deploys, the dual-write window, the callers who had to be notified, the rows already written in the wrong shape that had to be backfilled or abandoned.
  4. Distinguish reversal from rewrite by naming what you kept. Most good reversals preserve the schema or the interface and undo one decision inside it, which is also why they were affordable.

Follow-up

  • What in that decision was irreversible, and did you know it was irreversible when you made it?
  • How did you tell the people who had already built on top of the original decision?

Turn a code review disagreement into a decision

Easy · code review · optimistic concurrency · communication

A colleague's change updates a row with UPDATE resource SET version = version + 1 WHERE resource_id = $1 AND version = $2 and treats an affected-row count of zero as a successful no-op. You read that as a silently lost update; they think returning 200 is friendlier to clients than returning a conflict. Describe how you have handled a review disagreement of this shape: what goes in the comment, when you leave the thread, and who decides. Then write the comment you would leave here, in under 80 words.

Approach

  1. Sort the disagreement before writing anything. A silently discarded write is a correctness claim about data; the choice between 409 and 412 is taste. Only the first justifies blocking a merge, and saying which one you are doing is most of the value of the comment.
  2. Make the claim reproducible in the comment itself with an interleaving rather than a principle: A reads version 7, B reads version 7, B commits version 8, A's predicate matches zero rows, A is told it succeeded and A's edit is gone.
  3. Offer the alternative with its cost attached: return 409 carrying the current version and the revision that won, so the client can re-read and re-apply. Note that automatic retry is not the fix, because a retry re-reads the winner's state and reapplies an intent formed against data that no longer exists.
  4. Apply an escalation rule you can state: two round trips on the thread, then a call, and the service's owner decides rather than the reviewer. A reviewer who cannot be overruled is a bottleneck with extra steps.

Follow-up

  • Where would you put the test that fails if someone reintroduces the swallowed zero rowcount?
  • The author says clients cannot handle a 409. How do you check whether that is true?

Unblock an engineer without taking the keyboard

Easy · mentoring · leases · at-least-once

A teammate has spent two days on a job handler that occasionally writes duplicate rows. They are certain the queue is delivering twice by mistake. You suspect a lease expiring under a slow handler, so the job is running concurrently with itself. Describe how you have unblocked someone in this position: what you asked before offering a hypothesis, what you showed them rather than told them, and what you left them owning. Then say what you would do if their theory turned out to be the right one.

Approach

  1. Ask before diagnosing, and ask for things answerable from data they already have: the attempt count on the job rows that produced duplicates, the handler's observed duration against its lease expiry, and whether the duplicate rows share a natural key that a unique constraint could have caught.
  2. Teach the shape rather than the answer. A lease cannot distinguish a dead worker from a slow one, so a handler that outruns its lease is running twice by design, and deploys deliver the other half by killing handlers mid-run on every rollout. Both of their candidate theories produce identical duplicate rows, which is why the evidence has to come from timings rather than from argument.
  3. Hand over a checklist they execute: a natural key on every write the handler performs so the second copy collides rather than appends, the record of intent written before any external effect, a lease heartbeat while running, and the metric that shows it working.
  4. Keep ownership with them deliberately. Pair on the first write, then step back; if you finish it yourself you have closed one ticket and left the same person stuck on the next redelivery.

Follow-up

  • How would you distinguish a genuine double-delivery from a lease expiry using only the data already stored?
  • Their handler calls an external endpoint before recording that it did. What do you tell them to change first?