Tip 1 : Practice at least 250 Programming Questions based on array, string, 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.
Tip 1 : Do not put false things and over skills in your resume.
Tip 2 : Make your resume short and precise.
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.I only remember 1 coding question from this round
Questions were based on OOPS, DBMS, OS and some other computer related topics.
Number Of MCQs - 25



If the given grid is this:
[7, 19, 3]
[4, 21, 0]
Then the modified grid will be:
[7, 19, 0]
[0, 0, 0]
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
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.



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].
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
We need to answer questions related to DBMS, SQL, programming, OOPS concept, Leadership Principles, candidate behavioural 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?
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
How do you remove whitespace from the start of a string?