HCL Technologies interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
HCL Technologies
3 rounds | 5 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 2 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip 1 : Prepare some Projects
Tip 2 : Practice At least 250 Questions of DS algo
Tip 3 : Do at least 2 application based projects
Application process
Where: Referral
Eligibility: 7 CGPA and No backlogs
Tip 1 : add some application based projects in your resume.
Tip 2 : Do not put false things on resume.
Interview rounds
01
Round
Medium
Online Coding Interview
Duration60 minutes
Interview date1 Aug 2021
Coding problem1
1. MCQ Questions
ALGO, Aptitude, SQL Questions.
Number Of MCQs - 90
02
Round
Medium
Video Call
Duration60 minutes
Interview date1 Sep 2021
Coding problem3
Interviewer gave me coding problems and I had to code the given problem on the notepad.
1. Merge Sort
Easy
15m average time
85% success
0/40
Asked in companies
Given a sequence of numbers ‘ARR’. Your task is to return a sorted sequence of ‘ARR’ in non-descending order with help of the merge sort algorithm.
Example :
Merge Sort Algorithm -
Merge sort is a Divide and Conquer based Algorithm. It divides the input array into two-parts, until the size of the input array is not ‘1’. In the return part, it will merge two sorted arrays a return a whole merged sorted array.
The above illustrates shows how merge sort works.
Note :
It is compulsory to use the ‘Merge Sort’ algorithm.
Problem approach
MergeSort(arr[], l, r), where l is the index of the first element & r is the index of the last element.
If r > l
1. Find the middle index of the array to divide it in two halves:
m = (l+r)/2
2. Call MergeSort for first half:
mergeSort(array, l, m)
3. Call mergeSort for second half:
mergeSort(array, m+1, r)
4. Recursively, merge the two halves in a sorted manner, so that only one sorted array is left:
merge(array, l, m, r)
2. Majority element
Easy
15m average time
85% success
0/40
Asked in companies
You have been given an array/list 'ARR' consisting of 'N' integers. Your task is to find the majority element in the array. If there is no majority element present, print -1.
Note:
A majority element is an element that occurs more than floor('N' / 2) times in the array.
Problem approach
1. Store all the element in a map. key of a map denotes the element of an array and the value denotes the frequency of that element.
2. then return that element whose frequency is more than n/2 times
3. Reverse Linked List
Moderate
15m average time
85% success
0/80
Asked in companies
Given a singly linked list of integers. Your task is to return the head of the reversed linked list.
For example:
The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then the reverse linked list is 4 -> 3 -> 2 -> 1 -> NULL and the head of the reversed linked list will be 4.
Follow Up :
Can you solve this problem in O(N) time and O(1) space complexity?
Problem approach
1. Initialize three pointers prev as NULL, curr as head and next as NULL.
2. Iterate through the linked list. In loop, do following.
// Before changing next of current,
// store next node
next = curr->next
// Now change next of current
// This is where actual reversing happens
curr->next = prev
// Move prev and curr one step forward
prev = curr
curr = next
03
Round
Easy
HR Round
Duration15 minutes
Interview date1 Oct 2021
Coding problem1
Interviewer asked me basic HR questions.
1. Basic HR Questions
1. Introduction.
2. Why do you want to join HCL?
3. Where do you see yourself in next 5 years?
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
How do you remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
SDE - 1
2 rounds | 6 problems
Interviewed by HCL Technologies
Rejected
1251 views
0 comments
0 upvotes
SDE - 1
3 rounds | 5 problems
Interviewed by HCL Technologies
Selected 1496 views
4 comments
0 upvotes
SDE - 1
2 rounds | 6 problems
Interviewed by HCL Technologies
Rejected
1950 views
0 comments
0 upvotes
SDE - 1
2 rounds | 4 problems
Interviewed by HCL Technologies
Rejected
2260 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
2 rounds | 3 problems
Interviewed by BNY Mellon
Selected 6365 views
3 comments
0 upvotes
SDE - 1
3 rounds | 6 problems
Interviewed by BNY Mellon
Selected 0 views
0 comments
0 upvotes
SDE - 1
3 rounds | 5 problems
Interviewed by CIS - Cyber Infrastructure
Selected 2197 views
0 comments
0 upvotes