Coding questions
Coforge Online Assessment
Overview
Here is how public prep guides and student write-ups describe the Coforge online assessment. This is not an official company brochure.
Services-style multi-stage filter; published exact sectional counts are scarce - check your college placement email or official notification for exact section counts.
Usual selection rounds
Rounds students usually mention: Aptitude → Technical screen → Interview
| Item | From student reports |
|---|---|
| Platform | Online assessment (varies) |
| Online test summary | PapersAdda rough estimate from public reports: aptitude + technical screen then interview; ~60-120 minutes when online stages combine. Exact platform/timing/cutoff must come from your college placement email. |
| Eligibility notes | Verify role page / drive mail |
| Branches (reported) | Drive-specific |
Online test sections
| Section | Questions | Time | Notes |
|---|---|---|---|
| Aptitude | - | - | Accuracy without over-attempting emphasised |
| Technical MCQ / coding layer | - | - | Present in many student reports |
Extra notes from sources
- College placement email overrides blog defaults.
Sample practice question styles
These are practice questions for speed - not claimed to be from a real Coforge live paper.
Coding Q1: Coin change (min coins)
Problem: Given coin denominations and an amount, return the fewest coins needed to make that amount, or -1 if it is impossible.
Approach: Unbounded knapsack DP: let dp[x] be the minimum coins for amount x. For each coin, update dp[c..amount]. Initialize dp[0] = 0 and the rest to a large sentinel.
Complexity: O(amount × coins)
Coforge tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q2: Binary search
Problem: Given a sorted array of distinct integers and a target, return the index of target or -1 if missing.
Approach: Maintain lo/hi. Compare mid with target and shrink the half that cannot contain it. Careful with overflow-free mid and empty arrays.
Complexity: O(log n) time
Coforge tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q3: Move zeros
Problem: Move all zeros in an array to the end while keeping the relative order of non-zero elements.
Approach: Two pointers: write non-zeros toward the front, then fill the remainder with zeros. Or swap zeros as you scan.
Complexity: O(n) time, O(1) space
Coforge tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q4: Rotate array
Problem: Rotate an array to the right by k steps. Example: [1,2,3,4,5,6,7], k = 3 → [5,6,7,1,2,3,4].
Approach: Normalize k %= n. Reverse the whole array, reverse the first k elements, then reverse the rest. That yields the rotation in place.
Complexity: O(n) time, O(1) space
Coforge tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Prep tips from those student reports
- Full selection process prep: aptitude + tech MCQ + light coding + project sheet
- 2 full mocks before drive week
Sources
These notes come from public reports and can differ by campus, year, and role. If your college placement email or the official careers/notification PDF says something different, follow that.