Coforge Previous Year Coding Questions and Hiring Process
Coforge, formerly known as NIIT Technologies, is a large IT services company that hires freshers every year for its Graduate Engineer Trainee (GET) role through campus and off campus drives. It recruits from B.E./B.Tech, MCA, and M.Tech backgrounds and trains new hires across Java, .NET, cloud fundamentals, and data tracks.
If you are preparing for Coforge, understanding the Mettl based assessment structure, the SpeechX communication round, and the technical interview expectations will help you prepare efficiently. This guide covers the complete Coforge hiring process along with previous year coding questions asked in its online assessments and interviews.
Coforge Hiring Process
Here is the typical flow for Coforge fresher hiring through campus and off campus drives.
| Stage | What Happens | What They Are Looking For |
|---|---|---|
| A spoken and written English assessment, often on a platform called SpeechX, covering listening, speaking, and grammar tasks. | Clear spoken and written communication. |
| A Mettl based test, around 90 minutes, covering quantitative aptitude, logical reasoning, technical MCQs, and one coding problem. | Breadth across fundamentals and working code. |
| A resume and project walkthrough alongside a DSA question, OOP concepts, DBMS or SQL, and sometimes basic networking or a logical puzzle. Larger drives sometimes split this into two rounds. | Clear logic and communication over optimisation tricks. |
| A conversation about your background, willingness to relocate or work flexible hours, salary expectations, and interest in joining Coforge. | Cultural fit and career clarity. |
Coforge interviewers have been reported explicitly saying they prioritise logic clarity and handling edge cases over writing the most optimised solution, so explaining your reasoning out loud matters as much as the code itself.
Assessment Pattern
Format: A Mettl based proctored online test combining aptitude, technical MCQs, and coding, generally following a separate spoken English assessment.
Sections typically included:
- Quantitative Aptitude: Percentages, ratios, time and work, profit and loss, data interpretation.
- Logical Reasoning: Puzzles, series completion, verbal ability.
- Technical MCQs: Programming basics, OOPs, operating systems, computer networks, and SQL or DBMS.
- Coding Round: One problem, easy to medium difficulty, in C, C++, Java, or Python.
Coforge Coding Round: What to Expect
The coding round at Coforge blends classic DSA problems with sorting and tree traversal fundamentals. Frequently reported topics include:
- Sorting algorithms and their step by step explanation
- Tree traversals such as preorder and reverse level order
- Graph problems such as shortest path and topological sort
- Classic dynamic programming problems such as coin change and fractional knapsack
- Basic number theory problems such as checking primes and generating Fibonacci numbers
For hands on practice, use:
Technical Interview Focus Areas
Real questions reported by candidates in the technical interview round:
- What do you understand by OOPs, and what are its basic principles.
- What is polymorphism, and what is the difference between run time and compile time polymorphism.
- What is inheritance, and what are its types.
- What is the difference between abstraction and an interface.
- What is the difference between encapsulation and abstraction.
- How are threads created and executed in Java.
- What are arrays, and what is a linked list, including its types.
- Can a singly linked list be converted into a circular linked list.
- What is the difference between DDL and DML in SQL.
- Write a SQL query to find students who secured more than 40 percent marks.
- Write a SQL query to find the second highest salary.
- What is normalisation, and how would you normalise a given table.
- Do you know SQL window functions.
- What is the difference between a router, a switch, and a hub.
- What is the difference between a public and a private IP address.
HR Interview Tips
The HR round checks communication, motivation, and overall fit. Common questions include:
- Why do you want to work for Coforge.
- What are your greatest strengths and weaknesses.
- Why should we hire you.
- Describe a time you worked on a team project and handled a difficult situation.
- Are you willing to relocate or work beyond standard hours if a project demands it.
- Questions about your family background, education history, and hobbies.
Complete HR Interview Questions
Answer with specific examples from your projects and internships rather than generic statements.
Resources to Prepare for Coforge
- Free Aptitude Mock Practice latest patterns and mock tests
- ATS Score Checker and Resume Optimizer
- Roadmaps
- Interview Questions
- Resume Templates
- Free Placement Materials (Google Drive)
- Interview Experience
Coforge Previous Year Coding Questions
Below is a list of Coforge previous year coding questions commonly reported by candidates in the online assessment and technical interview round. Each question includes a problem statement, input and output format, and a sample explanation.
1. Fractional Knapsack
Problem Statement: Given weights and values of items and a knapsack with a maximum weight capacity, find the maximum total value achievable, where you are allowed to take fractional amounts of an item.
Input Format:
- Arrays of
weightsandvalues, and an integercapacity
Output Format:
- The maximum achievable value, as a decimal
Example:
Input: weights = [10, 20, 30], values = [60, 100, 120], capacity = 50
Output: 240.00
2. Sort an Array Using Bubble Sort
Problem Statement: Given an array of integers, sort it in ascending order using the bubble sort algorithm, and explain each pass.
Input Format:
- An integer array
arr
Output Format:
- The sorted array
Example:
Input: [5, 1, 4, 2, 8]
Output: [1, 2, 4, 5, 8]
3. Print the Fibonacci Series
Problem Statement:
Given a number n, print the first n terms of the Fibonacci series.
Input Format:
- An integer
n
Output Format:
- The first
nFibonacci numbers
Example:
Input: 7
Output: 0, 1, 1, 2, 3, 5, 8
4. Reverse Level Order Traversal of a Binary Tree
Problem Statement: Given a binary tree, print its nodes level by level starting from the bottom level and moving up to the root.
Input Format:
- A binary tree
root
Output Format:
- Node values grouped by level, from the bottom level to the top
Example:
Input: root = [1,2,3,4,5]
Output: [4, 5], [2, 3], [1]
5. Preorder Traversal of a Binary Tree
Problem Statement: Given a binary tree, return its preorder traversal, visiting the root first, then the left subtree, then the right subtree.
Input Format:
- A binary tree
root
Output Format:
- The list of node values in preorder
Example:
Input: root = [1,null,2,3]
Output: [1, 2, 3]
6. Shortest Path Between Two Nodes in a Graph
Problem Statement: Given an unweighted graph and two nodes, find the length of the shortest path between them.
Input Format:
- A list of edges, a source node, and a destination node
Output Format:
- The length of the shortest path, or -1 if no path exists
Example:
Input: edges = [[1,2],[2,3],[1,3]], source = 1, destination = 3
Output: 1
7. Coin Change Problem
Problem Statement: Given a set of coin denominations and a target amount, find the minimum number of coins needed to make that amount, or determine that it is not possible.
Input Format:
- An array of coin denominations and an integer
amount
Output Format:
- The minimum number of coins, or -1 if the amount cannot be made
Example:
Input: coins = [1, 2, 5], amount = 11
Output: 3
8. Submatrix Sum Query
Problem Statement: Given a 2D matrix and multiple queries, each asking for the sum of elements within a rectangular submatrix, answer each query efficiently.
Input Format:
- A 2D integer matrix and a list of queries, each with a top left and bottom right coordinate
Output Format:
- The sum for each query
Example:
Input: matrix = [[1,2],[3,4]], query = (0,0) to (1,1)
Output: 10
9. Topological Sort of a Graph
Problem Statement: Given a directed acyclic graph, return a valid topological ordering of its nodes.
Input Format:
- A list of directed edges
Output Format:
- A valid topological order of the nodes
Example:
Input: edges = [[1,2],[1,3],[2,4],[3,4]]
Output: [1, 2, 3, 4]
10. Check for a Prime Number
Problem Statement: Given an integer, determine whether it is a prime number.
Input Format:
- An integer
n
Output Format:
"Prime"or"Not Prime"
Example:
Input: 17
Output: Prime
11. Convert a Singly Linked List to a Circular Linked List
Problem Statement: Given the head of a singly linked list, convert it into a circular linked list by connecting the last node back to the head.
Input Format:
- A linked list
head
Output Format:
- The head of the resulting circular linked list
Example:
Input: 1 -> 2 -> 3 -> null
Output: 1 -> 2 -> 3 -> (back to 1)
At Last
Coforge weighs clear communication as heavily as correct code, from the SpeechX round through to how you explain your logic in the technical interview. Revise sorting algorithms, tree and graph traversals, and core SQL queries, and practice narrating your thought process out loud so it comes naturally in the actual interview.
Join the Telegram group for more resources and discussions.