HCL Technologies interview experience Real time questions & tips from candidates to crack your interview

Software Engineer

HCL Technologies

2 rounds | 2 Coding problems

Vishal Kumar

Fresher | Feb 2022

Selected

Interview preparation journey

Preparation

Duration: 6 Months

Topics: Data Structures, OOPS, DBMS, Algorithms, Aptitude

Tip

Tip 1 : Start with easy questions later move to medium and hard
Tip 2 : Always revise the concepts learned earlier and try to solve questions from old topics
Tip 3 : Give equal importance to all kind of structures

Application process

Where: Other

Eligibility: 60%

Resume tip

Tip 1 : Mention your projects
Tip 2 : Try to cover your field of interest projects and certifications in the resume bio.

Interview rounds

Round

Easy

Online Coding Interview

Duration90 minutes

Interview date2 Feb 2022

Coding problem1

In the first round, the questions are around verbal reasoning and quantitative ability and two easy level coding problem.

1. Modulo Calculation

Moderate

30m average time

60% success

0/80

Asked in companies

You are given four integers ‘A’, ‘B’, ‘C’, ‘M’ your task is to find ( ‘A’ ^ ‘B’ / ‘C’) % ‘M’.

Note: Greatest Common Divisor (gcd) of ‘C’ and ‘M’ will always be 1.

For Example:

For ‘A’ = 4, ‘B’ = 2, ‘C’ = 4, ‘M’ = 3,
‘A’ ^ ‘B’ / ‘C’ = 16 / 4, which is 4.
So, 4 % 3 is 1, hence the output will be 1.

Try solving now

Round

Easy

Video Call

Duration20 Minutes

Interview date9 Feb 2022

Coding problem1

Asked me to insert a node in linked list just asked me the approach.
As I was electronics background asked me about 4G and 5G

1. Insertion In A Singly Linked List

Easy

15m average time

90% success

0/40

Asked in companies

You are given a Singly Linked List of ‘N’ positive integers. Your task is to add a node having the value ‘VAL’ at position ‘POS’ in the linked list.

Note:

Assume that the Indexing for the linked list starts from 0.

EXAMPLE:

Input: ‘N’ = 5, 'LIST' = [1, 1, 2, 3, 4, -1], ‘VAL’ = 2, ‘POS’ = 1.

Output: 1 -> 2 -> 1 -> 2 -> 3 -> 4 

Here in the given list we can see that the node having value 2 is inserted at position 1.

Try solving now