HCL Technologies interview experience Real time questions & tips from candidates to crack your interview
SDE
HCL Technologies
2 rounds | 4 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 6 months
Topics: Programming Language, Data Structures, Algorithms, OOPS, DBMS, OS
Tip 1 : Practice atleast 250 Programming Questions based on array, srtring, trees, graph, dp, linked lists, etc.
Tip 2 : Practice Programming Questions from coding platform like LeetCode or CodeChef.
Tip 3 : Weekly revise your solved programming question and notes.
Application process
Where: Campus
Eligibility: 7 CGPA, good in programming/DSA
Tip 1 : Do not put false things and over skills in your resume.
Tip 2 : Make your resume short and precise.
Interview rounds
01
Round
Easy
Online Coding Interview
Duration90 minutes
Interview date16 Sep 2021
Coding problem2
Timing-90 minutes is the Duration Of Assessment
Test is conducted virtually through HCL platform. Test covers DSA, OOPS concept, DBMS, SQL, Programming and some general question related to Leadership Principles and workstyles.
1. Set Matrix Zeroes
Easy
30m average time
65% success
0/40
Asked in companies
You are given an N x M integer matrix. Your task is to modify this matrix in place so that if any cell contains the value 0, then all cells in the same row and column as that cell should also be set to 0.
Requirements:
- If a cell in the matrix has the value 0, set all other cells in that cell's row and column to 0.
- You should perform this modification in place (without using additional matrices).
You must do it in place.
For Example:
If the given grid is this:
[7, 19, 3]
[4, 21, 0]
Then the modified grid will be:
[7, 19, 0]
[0, 0, 0]
Problem approach
class Solution:
def setZeroes(self, matrix: List[List[int]]) -> None:
"""
Do not return anything, modify matrix in-place instead.
"""
rows=len(matrix)
cols=len(matrix[0])
#to change those value that are not 0 and are in + flow to "00"
for r in range(rows):
for c in range(cols):
if matrix[r][c]==0:
for col in range(cols):
if matrix[r][col]==0:
continue
else:
matrix[r][col]="00"
for row in range(rows):
if matrix[row][c]==0:
continue
else:
matrix[row][c]="00"
#to change only those "00" to 0
for r in range(rows):
for c in range(cols):
if matrix[r][c]=="00":
matrix[r][c]=0
return matrix
2. Technical Question
We need to answer questions related to DBMS, SQL, programming, OOPS concept, Leadership Principles, candidate behavior questions and workstyles.
For Example-
Do you agree with your seniors whether that guy is correct or not.
Are you open to learn new technology or still want to work on those technologies on which you are familiar.
Problem approach
Tip 1 : Don't panic while giving answers.
Tip 2 : Read question twice before giving answer.
Tip 3 : Revise your notes and concept before attempting the test.
02
Round
Medium
Face to Face
Duration60 minutes
Interview date23 Jul 2021
Coding problem2
We need to solve 1 or 2(based on interviewer) coding question within 1 hour in which we need to explain our approach before writing the code and we need to give optimal solution of the approach.
Interviewer also ask some other question related to DBMS, SQL, OOPS concept and etc.
1. Merge Intervals
Moderate
20m average time
80% success
0/80
Asked in companies
You are given N number of intervals, where each interval contains two integers denoting the start time and the end time for the interval.
The task is to merge all the overlapping intervals and return the list of merged intervals sorted by increasing order of their start time.
Two intervals [A,B] and [C,D] are said to be overlapping with each other if there is at least one integer that is covered by both of them.
For example:
For the given 5 intervals - [1, 4], [3, 5], [6, 8], [10, 12], [8, 9].
Since intervals [1, 4] and [3, 5] overlap with each other, we will merge them into a single interval as [1, 5].
Similarly, [6, 8] and [8, 9] overlap, merge them into [6,9].
Interval [10, 12] does not overlap with any interval.
Final List after merging overlapping intervals: [1, 5], [6, 9], [10, 12].
Problem approach
1)first sort the intervals
2)if interval1 high is more than interval2 low and interval1 high is less then interval2 high then
merge these 2 intervals based to interval1 low and interval2 high and store the interval in list
else do nothing
3) return the list
class Solution:
def merge(self, intervals: List[List[int]]) -> List[List[int]]:
res=[]
intervals.sort()
for interval in intervals:
if res and interval[0] <= res[-1][1]:
res[-1][1]=max(res[-1][1], interval[1])
else:
res.append(interval)
return res
2. Technical Questions
We need to answer questions related to DBMS, SQL, programming, OOPS concept, Leadership Principles, candidate behavior questions and workstyles.
For Example-
Difference between delete, truncate and drop in SQL?
What is foreign key in SQL queries?
What is the output of given program?
What is OPPS concept and its types?
What is Polymorphism?
Difference between function overloading and function overriding?
Write a query to find out second highest salary of an employee.
Do you agree with your seniors whether that guy is correct or not.
Are you open to learn new technology or still want to work on those technologies on which you are familiar.
Problem approach
Tip 1 : Need to answer question as per your knowledge and experience.
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
Software Engineer
2 rounds | 3 problems
Interviewed by HCL Technologies
Selected 
0 views
2 comments
0 upvotes
SDE
2 rounds | 4 problems
Interviewed by HCL Technologies
Rejected
1018 views
0 comments
0 upvotes
System Engineer
3 rounds | 6 problems
Interviewed by HCL Technologies
Rejected
943 views
0 comments
0 upvotes
Software Engineer
2 rounds | 6 problems
Interviewed by HCL Technologies
Selected 1390 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE
4 rounds | 6 problems
Interviewed by HashedIn
Selected 728 views
0 comments
0 upvotes