Expected hiring
- Total Hires: 6000+ freshers (expected)
- Process Associate: 5400+ selections (expected)
- Associate: 450+ selections (expected)
- Locations: Pan-India
Use this page to prepare for Genpact placement drives in 2026. It outlines the expected online assessment and interview shape based on recent Genpact hiring cycles, the topics that keep showing up (coding/DSA, core CS, and role-specific rounds), and a practical multi-month study plan. Pair it with the 2024 and 2025 papers on this site so you are drilling current-style questions while tracking what may change next year.
| Section | Questions | Time | Difficulty | Focus Areas |
|---|---|---|---|---|
| Aptitude | 15-18 | 45 min | Medium | Quantitative, Logical Reasoning, Verbal |
| Technical | 5-7 | 20 min | Medium | Programming, Data Structures, DBMS |
| Coding | 1-2 | 25 min | Medium-Hard | Array, String, Basic Algorithms |
Total: 25-30 questions, 90 minutes
Platform: Genpact assessment platform
Languages Allowed: C, C++, Java, Python
Expected Success Rate: ~25-30% cleared OA and advanced to interviews
This section contains expected question types for Genpact placement papers 2026 based on previous year patterns and industry trends.
Solution:
Let Principal = P, Rate = R%
After 3 years: P + (P × R × 3)/100 = 10,500 After 5 years: P + (P × R × 5)/100 = 12,000
Subtracting: (P × R × 2)/100 = 12,000 - 10,500 = 1,500
P × R = 75,000
From first equation: P + (75,000 × 3)/100 = 10,500 P + 2,250 = 10,500 P = 8,250
Rate R = 75,000/8,250 = 9.09% per annum (approximately 9%)
Answer: 9% per annum
Solution:
Let actual CP = x Actual SP = 1.25x (25% profit)
New CP = 0.9x (10% less) New SP = 1.25x - 15 New Profit = (1.25x - 15) - 0.9x = 0.35x - 15 New Profit % = ((0.35x - 15)/0.9x) × 100 = 30
(0.35x - 15)/0.9x = 0.30 0.35x - 15 = 0.27x 0.08x = 15 x = ₹187.50
Answer: ₹187.50
Solution:
Let the total work be LCM of 20 and 30 = 60 units.
Work done in 6 days = 6 × 5 = 30 units Remaining work = 60 - 30 = 30 units
Time for B to complete remaining = 30/2 = 15 days
Answer: 15 days
Solution:
Let milk = 4x, water = x
After adding 5 liters water: Milk = 4x, Water = x + 5
Ratio: 4x/(x + 5) = 4/2 = 2/1 4x = 2(x + 5) 4x = 2x + 10 2x = 10 x = 5
Quantity of milk = 4x = 4 × 5 = 20 liters
Answer: 20 liters
Solution:
Analyzing the statements:
Conclusion I: Some engineers are managers
Conclusion II: All managers are engineers
Answer: Only conclusion I follows
Solution:
Statement I: x² - 6x + 8 = 0 (x - 2)(x - 4) = 0 x = 2 or x = 4
Statement II: x < 5 (both 2 and 4 satisfy this)
Combining both: x = 2 or x = 4 (both < 5)
Answer: Both statements together are not sufficient to determine unique value of x
Problem Statement: Given an array of integers, find the maximum sum of a contiguous subarray.
Example:
Input: nums = [-2, 1, -3, 4, -1, 2, 1, -5, 4]Output: 6 (subarray [4, -1, 2, 1])Solution (Java):
public int maxSubArray(int[] nums) { int maxSum = nums[0]; int currentSum = nums[0];
for (int i = 1; i < nums.length; i++) { currentSum = Math.max(nums[i], currentSum + nums[i]); maxSum = Math.max(maxSum, currentSum); }
return maxSum;}Time Complexity: O(n)
Space Complexity: O(1)
Problem Statement: Given a string, reverse the order of words.
Example:
Input: "the sky is blue"Output: "blue is sky the"Solution (Java):
public String reverseWords(String s) { String[] words = s.trim().split("\\s+"); StringBuilder result = new StringBuilder();
for (int i = words.length - 1; i >= 0; i--) { result.append(words[i]); if (i > 0) result.append(" "); }
return result.toString();}Time Complexity: O(n)
Space Complexity: O(n)
Problem Statement: Given an array of integers and a target sum, find two numbers that add up to the target.
Example:
Input: nums = [2, 7, 11, 15], target = 9Output: [0, 1] (indices of 2 and 7)Solution (Java):
public int[] twoSum(int[] nums, int target) { Map<Integer, Integer> map = new HashMap<>();
for (int i = 0; i < nums.length; i++) { int complement = target - nums[i]; if (map.containsKey(complement)) { return new int[]{map.get(complement), i}; } map.put(nums[i], i); }
return new int[]{};}Time Complexity: O(n)
Space Complexity: O(n)
Expected hiring
Expected salary packages
Expected question trends
Recommended Preparation Steps:
2024 papers
2025 papers
Aptitude questions
Interview experience
HR interview questions
Preparation guide
Genpact hub