Hiring volume
- Total Hires: 5000+ freshers
- Process Associate: 4500+ selections
- Growth: 10% from 2023
- Locations: Pan-India
This page collects Genpact placement papers from 2024 with previous-year questions, solutions, and the 2024 exam pattern. It is useful when you want real drive history: what the OA looked like, which question types repeated, and how solutions were approached. Work through the papers below to build speed and accuracy, then compare against newer 2025 material so your prep matches both established Genpact patterns and the latest shifts.
| 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
Success Rate: ~25-30% cleared OA and advanced to interviews
This section contains real questions from Genpact placement papers 2024 based on candidate experiences from GeeksforGeeks, IndiaBix, and interview forums.
Solution:
Let the total work be LCM of 8, 24, and 40 = 120 units.
Therefore:
Answer: 60 days
Solution:
Let the original number be 100.
After 20% increase: 100 + 20 = 120 After 20% decrease: 120 - (20% of 120) = 120 - 24 = 96
Net change = 100 - 96 = 4 Net percentage change = (4/100) × 100 = 4% decrease
Answer: 4% decrease
Solution:
Let present ages be 3x and 5x.
After 10 years:
Given: (3x + 10)/(5x + 10) = 5/7
7(3x + 10) = 5(5x + 10) 21x + 70 = 25x + 50 4x = 20 x = 5
Present age of A = 3x = 3 × 5 = 15 years
Answer: 15 years
Solution:
Pattern analysis:
Pattern: Position of letter in alphabet
For “RAT”:
Answer: “18120”
Solution:
Pattern analysis:
Next term = 6 × 7 = 42
Answer: 42
Problem Statement: Given an array of integers, find the second largest element.
Example:
Input: [12, 35, 1, 10, 34, 1]Output: 34Solution (Java):
public int findSecondLargest(int[] arr) { if (arr.length < 2) return -1;
int largest = Integer.MIN_VALUE; int secondLargest = Integer.MIN_VALUE;
for (int num : arr) { if (num > largest) { secondLargest = largest; largest = num; } else if (num > secondLargest && num != largest) { secondLargest = num; } }
return secondLargest == Integer.MIN_VALUE ? -1 : secondLargest;}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 a number n, check if it is prime.
Example:
Input: 17Output: trueSolution (Java):
public boolean isPrime(int n) { if (n <= 1) return false; if (n <= 3) return true; if (n % 2 == 0 || n % 3 == 0) return false;
for (int i = 5; i * i <= n; i += 6) { if (n % i == 0 || n % (i + 2) == 0) { return false; } }
return true;}Time Complexity: O(√n)
Space Complexity: O(1)
Hiring volume
Salary packages
Question difficulty