Interview experience
Coforge Interview Questions and Answers (2026)
Overview
Section titled “Overview”Coforge is an IT-services firm (formerly NIIT Technologies) whose fresher process opens with a hard English-proficiency filter before the usual aptitude-and-coding pipeline.
Coforge interview process at a glance
Section titled “Coforge interview process at a glance”| Round | Duration | What they test |
|---|---|---|
| Communication Assessment | 15-20 min | Listening, speaking, grammar (English proficiency) |
| Online Assessment | ~90 min | Aptitude, technical MCQs, coding |
| Technical Interview | 30-45 min | DSA, coding, project discussion |
| HR Interview | 15-20 min | Fit, offer discussion |
Communication Assessment
Section titled “Communication Assessment”An early English-proficiency gate covering listening comprehension, speaking, and grammar - run before or alongside the main OA. Coforge weighs this heavily because a large share of its delivery roles are client-facing; candidates who don’t clear the cutoff are dropped here regardless of how strong their technical scores end up being later.
Common questions
- Listening comprehension exercises followed by MCQs
- Grammar and sentence-correction MCQs
- Short spoken-response prompts scored for fluency and clarity
Online Assessment
Section titled “Online Assessment”A roughly 90-minute test split across three sections: quantitative/logical aptitude, technical MCQs (CS fundamentals, programming basics), and coding problems. Shortlisting from the OA is steep - typically only 15-20% of test-takers get called for interviews.
Common questions
- Quantitative aptitude - percentages, time-speed-distance, profit/loss
- Technical MCQs on OOPS, DBMS, and basic programming syntax
- 1-2 easy-to-medium coding problems (arrays, strings, basic logic)
Technical Interview
Section titled “Technical Interview”A 30-45 minute round on DSA fundamentals, coding, and a walkthrough of your resume projects. Interviewers use your project explanations to gauge whether you actually built what you claim, not just to check a box.
Common questions
- Solve a basic-to-medium DSA problem (arrays, strings, sorting)
- Explain the architecture and your specific contribution to a resume project
- OOPS concepts - inheritance, polymorphism, abstraction with examples
- Basic SQL queries or DBMS concepts relevant to your projects
Round-by-round accounts are on the Coforge interview experience page.
HR Interview
Section titled “HR Interview”A short closing round (15-20 minutes) on fit and offer discussion, standard for a services-company pipeline.
Common questions
- Tell me about yourself and why Coforge
- How would you handle being staffed across multiple client engagements or domains at once?
- What do you know about Coforge’s journey from NIIT Technologies to its current form?
- Are you open to relocating to Noida, Greater Noida, or other delivery hubs?
Sample answer frameworks for each of these are on the Coforge HR interview questions page.
Common technical interview questions and answers
Section titled “Common technical interview questions and answers”Q: Explain inheritance, polymorphism and abstraction with examples
Inheritance lets a subclass reuse and extend a base class, so a SavingsAccount extends Account and inherits its balance and deposit logic rather than repeating it. Polymorphism means one interface, many implementations: compile-time polymorphism is method overloading, where the same name takes different parameter lists, and runtime polymorphism is overriding, where a base-class reference calls the subclass version chosen by the object’s actual type. Abstraction exposes what an object does while hiding how - an abstract class or interface declares calculateInterest() and each account type implements it differently. The distinction interviewers probe is abstraction versus encapsulation: abstraction hides complexity at design level through interfaces, encapsulation hides data at implementation level through private fields and accessors.
Q: Reverse a string and check whether it is a palindrome
To reverse in place, use two pointers at the ends and swap inward until they meet - O(n) time, O(1) extra space if the string is mutable, though in Java and Python strings are immutable so you build a new one. For the palindrome check you do not need to reverse at all: compare the character at the left pointer with the one at the right and move both inward, returning false on the first mismatch. That is O(n) time and O(1) space, versus reversing and comparing, which costs O(n) extra space. The variant Coforge asks as a follow-up is ignoring case and non-alphanumeric characters, which just means skipping those positions while advancing the pointers.
Q: How do you find duplicates in an array?
The general solution uses a hash set: iterate once, and if the current element is already in the set report it as a duplicate, otherwise insert it - O(n) time and O(n) space. If the array holds values from 1 to n and you must not use extra space, use index marking: for each element, negate the value at index abs(value) - 1, and a position already negative means that value repeated - O(n) time and O(1) space. A third option is sorting first and scanning adjacent pairs, which is O(n log n) time and O(1) space and is the right answer when memory is the binding constraint. Say which constraint you are optimising for, because that reasoning is what the round scores.
Q: What is the difference between an array and a linked list?
An array occupies contiguous memory with a fixed size, so accessing element i is O(1) pointer arithmetic, but inserting or deleting in the middle is O(n) because everything after shifts, and growth means allocating a bigger block and copying. A linked list stores each element in a node with a pointer to the next, so inserting or deleting at a known node is O(1) and the list grows without reallocation, but reaching element i requires walking from the head at O(n) and each node costs extra memory for its pointer. Arrays also benefit from CPU cache locality since neighbours sit together in memory, which often makes them faster in practice even where big-O says otherwise. Choose an array for indexed access and a linked list for heavy insertion and deletion at known positions.
Q: Explain the difference between DELETE, TRUNCATE and DROP in SQL
DELETE is a DML statement that removes rows one at a time and can be filtered with a WHERE clause; it is logged per row, fires triggers, and can be rolled back, but it is slow on large tables. TRUNCATE is a DDL statement that deallocates the table’s data pages wholesale, so it removes all rows with no WHERE clause, does not fire row triggers, is far faster, and resets identity counters. DROP is DDL that removes the table structure itself along with its data, indexes and constraints, so the table no longer exists afterward. The practical rule is DELETE for a filtered removal you may need to undo, TRUNCATE to empty a staging table quickly, and DROP only when the schema object itself should go.
Q: Write a SQL query to find employees earning more than the average salary of their department
Use a correlated subquery: SELECT e.name, e.salary, e.dept_id FROM employees e WHERE e.salary > (SELECT AVG(salary) FROM employees WHERE dept_id = e.dept_id); - the inner query re-evaluates per department because it references the outer row’s dept_id. A more efficient form on large tables joins against a pre-aggregated set: group employees by dept_id to compute the average once, then join that back on dept_id and filter. The reason you cannot put the aggregate directly in WHERE is that aggregate functions are not allowed there - aggregates are filtered with HAVING, which applies after GROUP BY, and the ordering of WHERE, GROUP BY, HAVING and SELECT is the concept the question is really testing.
Q: What is the difference between == and equals in Java, and between a checked and unchecked exception?
The == operator compares references for objects, so two distinct String objects with identical content are not equal under it, while equals() compares content when properly overridden - the exception being small integers and interned string literals, which share references and so confusingly pass the reference check. Whenever you override equals you must also override hashCode, or hash-based collections will fail to find your objects. On exceptions, checked exceptions such as IOException and SQLException are verified at compile time and must be caught or declared with throws, since they represent recoverable external failures. Unchecked exceptions extend RuntimeException - NullPointerException, ArrayIndexOutOfBoundsException, IllegalArgumentException - and signal programming errors that should be fixed rather than caught.
Q: How do you find the second-largest element, and what are the complexities of common sorts?
For the second largest, one pass with two trackers is enough: keep largest and secondLargest, update secondLargest whenever an element falls between them, and shift both when a new maximum appears. That is O(n) time and O(1) space, better than sorting the array at O(n log n) just to read index n-2. On sorts, bubble, selection and insertion sort are all O(n^2) in the average case, though insertion sort is O(n) on nearly sorted data, which is why hybrid library sorts fall back to it for small partitions. Mergesort is O(n log n) in all cases but needs O(n) extra space and is stable; quicksort averages O(n log n) with O(log n) space but hits O(n^2) on bad pivots; heapsort is O(n log n) with O(1) space but unstable.
Frequently asked questions about Coforge interviews
Section titled “Frequently asked questions about Coforge interviews”What is Coforge’s interview process for freshers?
Coforge’s campus process typically runs 4 rounds: 1. Communication Assessment - listening, speaking, and grammar MCQs, used as an early filter. 2. Online Assessment (about 90 minutes) - aptitude, technical MCQs, and coding, usually split roughly 30/35/25 minutes across the three sections. 3. Technical Interview - DSA, coding, and project discussion. 4. HR Interview - fit and offer discussion. Interviews are usually held on campus a few weeks after the OA, and only a fraction of test-takers get shortlisted for them.
What is the Communication Assessment round at Coforge?
It’s an early-stage English proficiency check covering listening, speaking, and grammar, run before or alongside the main online assessment. As an IT services firm staffing client-facing and support roles, Coforge weighs spoken/written English fairly heavily, and candidates who don’t clear this cutoff are dropped regardless of technical scores.
How many rounds does Coforge’s hiring process have?
Most freshers go through 4 rounds: Communication Assessment, Online Assessment (aptitude + technical MCQs + coding), a Technical Interview, and an HR Interview. Shortlisting after the OA can be steep - often only 15-20% of test-takers move on to interviews.
Is Coforge’s hiring process similar to Nagarro’s?
They’re often covered together in prep guides since both are Noida-headquartered, product-engineering-leaning IT services firms hiring from the same campus pool, and both weight coding ability more heavily than a typical mass-recruiter like TCS or Infosys. But the processes aren’t identical: Coforge adds a distinct Communication Assessment gate that Nagarro’s process doesn’t emphasize, while Nagarro leans harder on multiple written coding rounds. Treat them as similar in rigor, not as one shared pipeline.
How should I prepare for Coforge interviews?
Practice spoken and written English basics for the communication round, revise quantitative aptitude and core CS/programming MCQs, solve easy-to-medium coding problems for the OA, and be ready to discuss your resume projects clearly in the technical round. For ‘Why Coforge?’, it helps to know that Coforge is the rebranded, expanded form of NIIT Technologies and works across BFS, insurance, travel, and manufacturing verticals.