HCL 2024 papers
Previous year HCL placement papers with questions and solutions
This page is a working set of HCL placement papers from 2025: from student reports questions, the 2025 online assessment pattern, and step-by-step solutions. Use it to see what HCL actually asked in the latest cycle, how hard the rounds were, and which themes (DSA, system design, aptitude, or role-specific topics) mattered most. Practice the problems below under timed conditions, then cross-check with the interview and preparation guides if you are targeting an upcoming HCL drive.
| Section | Typical PYQ content | 2025 timing cue |
|---|---|---|
| Aptitude | Quant + logical reasoning MCQs | ~45 min |
| Technical | CS fundamentals / programming MCQs | ~20 min |
| Coding | 1-2 problems (arrays, strings, basics) | ~25 min |
How to use the PDF / this page: Print or keep the practice PDF side-by-side, solve under 90 minutes, then check solutions in the sections below. Aim to clear each section - HCL drives commonly apply sectional as well as overall filters (from student reports ~60-65% overall).
| Section | Questions | Time | Difficulty |
|---|---|---|---|
| Aptitude | 15-18 | 45 min | Medium |
| Technical | 5-7 | 20 min | Medium |
| Coding | 1-2 problems | 25 min | Medium-Hard |
Total: 25-30 questions, 90 minutes
This section contains practice questions styled on HCL placement papers 2025 (recent-cycle pattern), with worked solutions. Use them as timed sectional drills - from student reports drives vary by college and role, so treat this as a high-signal practice bank, not an official paper dump.
Solution:
Speed = distance/time = 180/12 m/s = (180/12) × (18/5) = 54 km/h.
Answer: 54 km/h
Solution:
Together rate = 1/8. B’s rate = 1/24.
A’s rate = 1/8 − 1/24 = (24−8)/(8×24) = 16/192. Days for A alone = 192/16 = 12 days.
Answer: 12 days
Solution:
Combined rate = 1/12 + 1/18 = (12+18)/(12×18). Time = 12×18/(12+18) = 7.2 hours.
Answer: 7.2 hours
Solution:
Old sum = 5 × 20 = 100. New sum = 100 − 15 + 25 = 110. New average = 110/5 = 22.
Answer: 22
Solution:
From the statements, pens⊆goods and some goods overlap new. That does not force some pens to be new, and ‘all goods are pens’ reverses the first statement wrongly.
Neither conclusion follows.
Answer: Neither I nor II follows
Solution:
Grandfather’s only son = Ravi’s father. Son of Ravi’s father = Ravi himself (or his brother).
In standard puzzle framing with one son implied for the speaker context: the person is Ravi’s brother (or Ravi). Most campus keys take Brother.
Answer: Brother
Solution:
‘Expand’ means roughly the opposite of Contract.
Answer: Contract
Solution:
In placement verbal sections, ‘Fragile’ is closest in meaning to Delicate among common options.
Answer: Delicate
Problem Statement: Find the longest common prefix string amongst an array of strings.
Example:
Input: ["flower","flow","flight"]Output: "fl"Solution (Java):
public String longestCommonPrefix(String[] strs) { if (strs.length == 0) return ""; String pref = strs[0]; for (int i = 1; i < strs.length; i++) { while (!strs[i].startsWith(pref)) { pref = pref.substring(0, pref.length() - 1); if (pref.isEmpty()) return ""; } } return pref;}Time Complexity: O(S)
Space Complexity: O(1)
Problem Statement: Given an array of integers and a target, return indices of two numbers that add up to target.
Example:
Input: nums = [2, 7, 11, 15], target = 9Output: [0, 1]Solution (Java):
public int[] twoSum(int[] nums, int target) { Map<Integer, Integer> map = new HashMap<>(); for (int i = 0; i < nums.length; i++) { int need = target - nums[i]; if (map.containsKey(need)) return new int[]{map.get(need), i}; map.put(nums[i], i); } return new int[]{};}Time Complexity: O(n)
Space Complexity: O(n)
Problem Statement: Rotate the array to the right by k steps.
Example:
Input: [1,2,3,4,5,6,7], k = 3Output: [5,6,7,1,2,3,4]Solution (Java):
public void rotate(int[] nums, int k) { k %= nums.length; reverse(nums, 0, nums.length - 1); reverse(nums, 0, k - 1); reverse(nums, k, nums.length - 1);}void reverse(int[] a, int l, int r) { while (l < r) { int t = a[l]; a[l++] = a[r]; a[r--] = t; }}Time Complexity: O(n)
Space Complexity: O(1)
Key Observations:
Based on recent candidate experiences from 2025 HCL online assessment and interviews:
2025 Interview Process:
2025 Interview Trends:
Common 2025 Interview Topics:
Success Tips:
For detailed interview experiences from 2025, visit HCL Interview Experience page.
HCL 2024 papers
Previous year HCL placement papers with questions and solutions
HCL coding questions
HCL coding problems with detailed solutions
HCL interview experience
Real interview experiences from candidates who cleared HCL placement
HCL preparation guide
Comprehensive preparation strategy for HCL placement process
HCL main page
Complete HCL placement guide with eligibility, process, and salary
TCS · Wipro · Infosys · Accenture · Cognizant · Capgemini
Ready to practice? Use these 2025 HCL placement papers to understand the current exam pattern and prepare effectively.