EPAM 2026 aptitude
Quantitative, reasoning, and verbal drills with solutions
EPAM 2026 Pattern Details
Overview
This page collects EPAM placement papers from 2026 with practice questions, worked solutions, and the exam pattern students reported that cycle. Use it when you want drive history: what the first round looked like, which topics repeated, and how to approach solutions. Work the sets below under a timer, then compare with newer material so your prep matches both established EPAM patterns and recent shifts.
Download / jump links
EPAM 2026 coding
DSA practice aligned to EPAM online assessments
EPAM interview experience
Round structure and tips from student reports
EPAM prep guide
Study plan and weekly schedule
EPAM Aptitude Mock Quiz
Timed placement-style MCQs with score and explanations after you submit. Use it to check speed and accuracy before the real test.
Questions15
Time10 min
Reasoning
Find the next number: 2, 6, 12, 20, 30, ?
Differences +4, +6, +8, +10, +12 → next is 42.
Reasoning
Statements: All cats are dogs. Some dogs are birds. Conclusions: I. Some cats are birds. II. All birds are cats.
Analyzing the statements: - All cats are dogs (A → B) - Some dogs are birds (B → C, some) Conclusion I: Some cats are birds - Since all cats are dogs, and some dogs are birds, we can say some cats are birds. Valid Conclusion II: All birds are cats - This canno
Quantitative
A and B finish a job in 12 and 18 days. Working together they finish in:
1/12 + 1/18 = 5/36 → 36/5 = 7.2 days.
Reasoning
Find next number: 1, 4, 9, 16, 25, ?
Pattern: n² where n = 1, 2, 3, 4, 5... 1²=1, 2²=4, 3²=9, 4²=16, 5²=25 Next: 6² = 36
Verbal
"Break the ice" means:
It means to initiate conversation in a social setting.
Verbal
Antonym of "Benevolent":
Benevolent ↔ malevolent.
Verbal
There _____ many books on the table.
Many books → plural.
Quantitative
A can complete a work in 10 days, B in 15 days. In how many days will they complete the work together?
Let total work = LCM of 10, 15 = 30 units A's efficiency = 30/10 = 3 units/day B's efficiency = 30/15 = 2 units/day Combined efficiency = 3 + 2 = 5 units/day Time taken = 30/5 = 6 days
Quantitative
If "APPLE" is coded as "BQQMF", how is "ORANGE" coded?
Correct answer: PSBOHF
Reasoning
Find the next number: 3, 9, 27, 81, ?
×3 each → 243.
Quantitative
Five people A, B, C, D, E sit in a row. A is not at either end. B sits next to A. C sits at one end. D sits between C and E. Who sits in the middle?
C is at one end. D is between C and E, so: C-D-E or E-D-C A is not at end, B is next to A If C-D-E, then A-B must be before: A-B-C-D-E (A at end, invalid) So: E-D-C, and A-B before: A-B-E-D-C Middle position: E
Verbal
He _____ to school every day.
Singular present.
Quantitative
A shopkeeper marks goods 40% above cost and gives a 10% discount. Profit % is:
SP = 1.4 × 0.9 × CP = 1.26 CP → 26% profit.
Quantitative
Speed 72 km/h. Distance in 20 minutes:
72 × (20/60) = 24 km.
Reasoning
If letter positions are summed (A=1…Z=26), PEN equals:
Sum of positions = 35.
Your score
0/15(0%)
Review
EPAM exam pattern 2026
| Section | What shows up | Prep focus |
|---|---|---|
| Aptitude / logical | Quant, reasoning, sometimes verbal | Timed sectional accuracy |
| Coding / programming logic | Easy-medium DSA or output-style MCQs | Handle tricky inputs |
| Technical interview | OOPs, DBMS, OS, projects | Explain aloud |
| HR | Fit, location, intent | A few real examples ready |
First round: EPAM Codility / Online Test
Skills emphasized: DSA, CS fundamentals, communication
Languages: Java, JavaScript, Python, C#
Sample EPAM questions with solutions
These are practice-style questions aligned to patterns students report for EPAM drives around 2026. They are not leaked live papers. Work them timed, then read the solutions only after you have an answer.
Quantitative aptitude (2026)
Q1: Marked price discount
Problem: A shopkeeper marks goods 20% above cost and then gives a 10% discount. What is the profit percentage?
Solution: Let CP = ₹100. Marked price = ₹120. Discount = 10% of 120 = ₹12. SP = 120 − 12 = ₹108. Profit % = 8%.
Answer: 8%
Q2: Three workers
Problem: A finishes work in 12 days, B in 15 days, and C in 20 days. Working together, how many days do they need?
Solution: Take total work = LCM(12,15,20) = 60 units. A = 5/day, B = 4/day, C = 3/day. Combined = 12 units/day. Time = 60/12 = 5 days.
Answer: 5 days
Q3: Age ratio
Problem: The ratio of ages of A and B is 3:5. After 8 years the ratio becomes 5:7. Find A’s present age.
Solution: Let ages be 3x and 5x. (3x+8)/(5x+8) = 5/7 7(3x+8) = 5(5x+8) 21x + 56 = 25x + 40 4x = 16 → x = 4 A’s age = 12 years.
Answer: 12 years
Q4: Pipe fill
Problem: Pipe A fills a tank in 6 hours and pipe B in 8 hours. How long do they take together to fill it?
Solution: Combined rate = 1/6 + 1/8 = 4/24 + 3/24 = 7/24. Time = 24/7 hours ≈ 3 hours 26 minutes.
Answer: 24/7 hours
Q5: Simple interest
Problem: Find the simple interest on ₹8000 at 10% per annum for 2 years.
Solution: SI = (P × R × T) / 100 = (8000 × 10 × 2) / 100 = ₹1600.
Answer: ₹1600
Q6: Percentage recover
Problem: If 30% of a number is 150, what is the number?
Solution: 0.3x = 150 → x = 150 / 0.3 = 500.
Answer: 500
Q7: Average after replace
Problem: The average of five numbers is 20. One number 30 is replaced by 10. What is the new average?
Solution: Old sum = 5 × 20 = 100. New sum = 100 − 30 + 10 = 80. New average = 80 / 5 = 16.
Answer: 16
Q8: Series n(n+1)
Problem: Find the next term: 2, 6, 12, 20, 30, ?
Solution: Pattern: 1×2, 2×3, 3×4, 4×5, 5×6, 6×7. Next = 6 × 7 = 42.
Answer: 42
Logical reasoning (2026)
Q1: Seating hint
Problem: Five friends sit in a row. A is to the left of B but right of C. D is to the right of B and left of E. Who is in the middle?
Solution: Order from left to right: C, A, B, D, E. The middle seat is B.
Answer: B
Q2: Analogy
Problem: Book is to Reading as Fork is to ?
Solution: A book is used for reading; a fork is used for eating.
Answer: Eating
Q3: Odd one out
Problem: Find the odd one out: 3, 5, 7, 9, 11
Solution: 3, 5, 7, and 11 are prime. 9 = 3×3 is composite, so it is the odd one out.
Answer: 9
Q4: Coding letter shift
Problem: If CAT is coded as DBU, how is DOG coded in the same way?
Solution: Each letter moves +1 in the alphabet: C→D, A→B, T→U. D→E, O→P, G→H → EPH.
Answer: EPH
Coding practice (2026)
Coding Q1: First unique character
Problem: Find the first non-repeating character in a string and return its index, or -1 if none exists.
Approach: Count frequencies in one pass (hash map or array of 26 for lowercase). Second pass returns the first index with count 1.
Complexity: O(n) time
EPAM 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: Stack with min
Problem: Design a stack that supports push, pop, top, and getMin in average O(1) time.
Approach: Keep a parallel min-stack (or store pairs). When pushing, also push the new minimum. When popping, pop both stacks.
Complexity: O(1) per operation amortized
EPAM 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: Maximum subarray sum (Kadane)
Problem: Given an integer array, find the contiguous subarray with the largest sum and return that sum. Example: [-2,1,-3,4,-1,2,1,-5,4] → 6 (from [4,-1,2,1]).
Approach: Keep a running sum. If the running sum drops below 0, reset it to 0 before taking the next element (or track the best ending-here value). Track the global maximum as you scan once from left to right.
Complexity: O(n) time, O(1) extra space
EPAM 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: Reverse a string in place
Problem: Given a mutable character array representing a string, reverse it in place without allocating another array of the same size.
Approach: Use two pointers at the start and end. Swap characters, then move inward until the pointers meet. Watch empty and single-character inputs.
Complexity: O(n) time, O(1) extra space
EPAM 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 Q5: Check prime
Problem: Write a function that returns true if n is prime and false otherwise. Handle n < 2 correctly.
Approach: Return false for n < 2. Trial-divide from 2 to floor(sqrt(n)). If any divisor divides n evenly, it is composite; otherwise prime.
Complexity: O(√n) time
EPAM 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 Q6: Valid parentheses
Problem: Given a string containing only ‘()[]’, decide whether the brackets are balanced and correctly nested.
Approach: Scan left to right with a stack. Push opening brackets. On a closing bracket, the stack top must be the matching opener. At the end the stack must be empty.
Complexity: O(n) time, O(n) space
EPAM 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 Q7: Two Sum
Problem: Given an array of integers and a target, return indices of two numbers that add up to the target. Assume exactly one solution and you may not use the same element twice.
Approach: Walk the array once. For each value x, check whether target − x was seen earlier in a hash map of value → index. If yes, return both indices; else store x.
Complexity: O(n) time, O(n) space
EPAM 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 Q8: Longest substring without repeating characters
Problem: Given a string s, find the length of the longest substring without repeating characters. Example: ‘abcabcbb’ → 3 (‘abc’).
Approach: Sliding window with a map (or last-seen index) of characters. Expand the right pointer; when a duplicate appears inside the window, move the left pointer past the previous occurrence.
Complexity: O(n) time
EPAM 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.
Deep prep notes for EPAM
How the EPAM Codility / online test usually feels
Students usually say the first round is time-tight - easy marks vanish if you sit too long on one hard question. For EPAM, skim the paper in a couple of minutes, mark what you can finish cleanly, and protect accuracy. Languages people commonly use: Java, JavaScript, Python, C#.
Topic weight hints
| Area | Why it matters at EPAM |
|---|---|
| DSA | What usually helps you clear the first round |
| Core CS (OOPs / DBMS / OS) | Technical interview depth |
| Software Engineering, Digital Platforms awareness | Helps in managerial / HR conversations |
| Communication | Explain your approach clearly; keep a few real examples ready for HR |
14-Day sprint
- Days 1-3: Learn the 2026 pattern and take two sectional mocks
- Days 4-7: Closed practice on weak topics from your error log
- Days 8-10: Full mocks every other day; review the same day
- Days 11-14: Practice explaining projects out loud, light revision, sleep and IDs ready
Comments & Suggestions
Related
Similar companies
Nagarro · Thoughtworks · Globant · Publicis Sapient · GlobalLogic