Interview guides · Hinduja Global Solutions

Hinduja Global Solutions Software Engineer Interview Guide

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

The 60-second brief

As a Software Engineer at Hinduja Global Solutions (HGS), you serve as a critical technical contributor within a global organization that prioritizes efficiency, scalability, and robust service delivery. You will work at the intersection of client-facing technology solutions and internal process optimization, ensuring that the software systems powering HGS's operations are resilient, performant, and aligned with business requirements. This role offers a unique vantage point into how large-scale enterprise solutions are architected and maintained. Whether you are working on internal tools, database management, or client-specific applications, your work directly influences the operational success of the company. You can expect to operate in an environment that values fundamental technical competence, clear communication, and a pragmatic approach to problem-solving.

This guide is scoped to a Software Engineer candidate at Hinduja Global Solutions.

Focus areas

Data Structures & Algorithms (DSA)
Coding Interview Practice
Object-Oriented Programming (OOP) Concepts

The Hinduja Global Solutions interview process

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

Technical Screening

Initial evaluation of technical baseline skills to assess candidate's capabilities.

What to demonstrate

Initial evaluation of technical baseline skills to assess candidate's capabilities
Depth in Data Structures & Algorithms (DSA)

How to prepare

Answer aloud and timed: Explain the core principles of OOPs (Object-Oriented Programming).
Answer aloud and timed: How do you handle memory management in your preferred programming language?

Managerial Assessment

Assessment of professional alignment and project experience with management.

What to demonstrate

Assessment of professional alignment and project experience with management
Depth in Data Structures & Algorithms (DSA)

How to prepare

Answer aloud and timed: Can you write an algorithm to solve a pattern-based problem (e.g., star patterns, factorials)?
Answer aloud and timed: What are the differences between Interface and Abstract Class?

Final Behavioral Assessments

Candidates prepare project narratives for final discussions with management.

What to demonstrate

Candidates prepare project narratives for final discussions with management
Depth in Data Structures & Algorithms (DSA)

How to prepare

Prepare three examples from your own work, each with a decision you made and an outcome you can quantify.
Re-read the description of the final behavioral assessments above and write down what you would ask to confirm before it.

Where candidates lose points

Master the Basics

Revisit your undergraduate computer science fundamentals, especially Networking and Data Structures.

Be Confident

When asked about your projects, speak with authority. You are the expert on the work you have done.

Prepare for Behavioral Questions

Do not treat the HR or Managerial rounds as a formality. They are testing for cultural fit and long-term potential.

Practice Coding

While not all rounds are heavy on complex algorithms, being able to write clean loops and patterns on a whiteboard or screen is a must.

Questions & practice

Can you write an algorithm to solve a pattern-based problem (e.g., star patterns, factorials)?

Medium · Technical Fundamentals and Programming

Approach

Restate the input: its shape, its size, and what is guaranteed about it.
Name the brute-force solution and its complexity before improving on it.
Choose the data structure from the access pattern, not from familiarity.
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?

Merge partitioned event streams into one ordered feed with bounded lateness

Hard · k-way merge · watermarks · out-of-order streams

The read-model service consumes 64 log partitions carrying about 4,000 events per second in total. Each partition is ordered within itself, but partitions drift by up to 30 seconds, and the activity feed must present a tenant's events in occurred_at order. Produce the merge. State its complexity, the buffer it requires in events and in bytes, what happens when one partition is idle, and what you do with an event that arrives after you have already emitted its position. Payloads average 1 KB.

Approach

Merge with a min-heap over the 64 partition heads keyed on (occurred_at, event_id): O(log P) per event and O(n log P) overall. The tie-break on event_id is what makes the output deterministic when two partitions carry the same millisecond, which matters because the feed is paginated and a non-deterministic order reorders pages under the reader.
Emitting the heap head is only correct once every partition has produced everything up to that timestamp, so the emit condition is a watermark: the minimum across partitions of the highest occurred_at seen, less the allowed lateness. Events are held until the watermark passes them, which is what turns individually ordered streams into a jointly ordered one.
Size the buffer from the lateness rather than guessing: 4,000 events per second times 30 seconds is 120,000 buffered events, and at 1 KB each about 120 MB of heap. That number is the real price of the ordering guarantee and belongs in front of whoever asked for it.
Handle the idle partition explicitly, because it fails the feed rather than corrupting it: a partition with no traffic never advances its own maximum, so the watermark freezes and output stops entirely. Either every partition emits a periodic idle marker carrying the broker's current time, or the watermark falls back to wall clock for a partition silent beyond a threshold.

Follow-up

The lateness budget is raised to five minutes. What is the new buffer, and what besides memory changes?
The consumer restarts. Where does it resume from, and what does the feed look like for the first 30 seconds?

Collapse a redelivered event batch into per-aggregate high-water marks

Easy · hashing · at-least-once · aggregation

You drain a batch of up to 5,000,000 events, each (aggregate_id BIGINT, aggregate_version INT, event_type, payload). The log guarantees order within one aggregate only; the batch merges 64 partitions, and a relay failover has redelivered a range, so an older version for an aggregate can appear after a newer one. Given a map of last_applied_version per aggregate, produce the events worth applying, at most one per (aggregate_id, version), plus the count discarded. Target O(n) time. State the memory for 2,000,000 distinct aggregates and what you do when it does not fit.

Approach

One pass, one hash map from aggregate_id to the highest version kept, and a discard counter. An event whose version is at or below last_applied_version for its aggregate is dropped without further work, which is the whole reason the event carries its version rather than a delta. O(n) expected time, O(d) space in distinct aggregates.
Keep the maximum, never the last occurrence. The redelivered range means the final appearance of an aggregate in the batch can be an older version than one seen earlier in the same batch, so last-wins applies stale state over newer state and the projection regresses with no error anywhere.
Cost the memory instead of calling it large: an 8-byte key plus a 4-byte version is 12 bytes of payload, and an open-addressed table held at a 0.7 load factor costs roughly 17 bytes per entry before per-slot metadata, so 2,000,000 aggregates is tens of megabytes in a native layout and several times that in a runtime that boxes both key and value.
If the distinct set exceeds memory, partition on hash(aggregate_id) mod P and reduce each partition independently. Every event for one aggregate hashes to the same partition, so the per-partition result is exact and the merge is concatenation rather than a second reduction.

Follow-up

The payload is a patch rather than a snapshot, so applying only the highest version loses the intermediate changes. What changes in your reduction?
How do you detect that version 7 arrived while version 6 was never delivered, and what should the consumer do about the gap?

Explain the difference between INNER JOIN, LEFT JOIN, and FULL OUTER JOIN.

Medium · Database and SQL

Approach

Name the grain you start from and join outward from it.
Check whether any join is one-to-many before aggregating, or the sums inflate.
Say which index the query would use, and what makes it unusable.
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 optimize a slow-running SQL query?

Medium · Database and SQL

Approach

Name the grain you start from and join outward from it.
Check whether any join is one-to-many before aggregating, or the sums inflate.
Say which index the query would use, and what makes it unusable.
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?

Describe the importance of Normalization in database design.

Medium · Database and SQL

Approach

Name the grain you start from and join outward from it.
Check whether any join is one-to-many before aggregating, or the sums inflate.
Say which index the query would use, and what makes it unusable.
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 core principles of OOPs (Object-Oriented Programming).

Medium · Technical Fundamentals and Programming

Approach

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

Follow-up

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

What are the differences between Interface and Abstract Class?

Medium · Technical Fundamentals and Programming

Approach

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

Follow-up

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

What is the difference between `DELETE`, `TRUNCATE`, and `DROP`?

Medium · Database and SQL

Approach

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

Follow-up

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

How do you approach debugging a complex piece of code?

Medium · Technical Fundamentals and Programming

Approach

Establish what changed and when, before forming any theory.
Pick a bisection that eliminates candidates whichever way it turns out.
Check the instrumentation before believing the symptom.
Separate the trigger from the cause; the deploy is rarely the bug.

Follow-up

What would you look at first, and what would it rule out?
How would you tell a cause from a coincidence here?

Suggested practice checklist

Built from the rounds and topics Hinduja Global Solutions candidates report.

Day 1 — Map the Hinduja Global Solutions loop

Write out the reported sequence: Technical Screening, Managerial Assessment, Final Behavioral Assessments.
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 3 reported rounds, with the weakest marked.

Day 2 — Work Data Structures & Algorithms (DSA)

Spend the session on Data Structures & Algorithms (DSA), which Hinduja Global Solutions candidates report being tested on.
Write one worked example in Data Structures & Algorithms (DSA) and time yourself on it.

Deliverable: One timed worked example in Data Structures & Algorithms (DSA).

Day 3 — Work Coding Interview Practice

Spend the session on Coding Interview Practice, which Hinduja Global Solutions candidates report being tested on.
Write one worked example in Coding Interview Practice and time yourself on it.

Deliverable: One timed worked example in Coding Interview Practice.

Day 4 — Work Object-Oriented Programming (OOP) Concepts

Spend the session on Object-Oriented Programming (OOP) Concepts, which Hinduja Global Solutions candidates report being tested on.
Write one worked example in Object-Oriented Programming (OOP) Concepts and time yourself on it.

Deliverable: One timed worked example in Object-Oriented Programming (OOP) Concepts.

Day 5 — Answer out loud: Technical Fundamentals and Programming

Answer aloud, timed: Explain the core principles of OOPs (Object-Oriented Programming).
Answer aloud, timed: How do you handle memory management in your preferred programming language?

Deliverable: Spoken answers to 2 reported Technical Fundamentals and Programming question(s), under time.

Day 6 — Answer out loud: Database and SQL

Answer aloud, timed: Explain the difference between INNER JOIN, LEFT JOIN, and FULL OUTER JOIN.
Answer aloud, timed: How do you optimize a slow-running SQL query?

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

Day 7 — Answer out loud: Process and Behavioral

Answer aloud, timed: Tell me about a challenging project you completed and your specific role in it.
Answer aloud, timed: How do you manage tight deadlines when faced with technical blockers?

Deliverable: Spoken answers to 2 reported Process and Behavioral question(s), under time.

Behavioural preparation

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

How do you handle memory management in your preferred programming language?

Medium · Technical Fundamentals and Programming

Approach

Pick a story where you made the decision, not one where you watched it.
State the situation in two sentences and spend the rest on the reasoning.
Give the blast radius: what could have broken, and what you measured.
Name the disagreement and how you resolved it with evidence.

Follow-up

What would you do differently if you ran that again?
How did you know your change caused the improvement?

How do you handle data types and constraints in SQL?

Medium · Database and SQL

Approach

Pick a story where you made the decision, not one where you watched it.
State the situation in two sentences and spend the rest on the reasoning.
Give the blast radius: what could have broken, and what you measured.
Name the disagreement and how you resolved it with evidence.

Follow-up

What would you do differently if you ran that again?
How did you know your change caused the improvement?