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

SDE

HCL Technologies
upvote
share-icon
2 rounds | 4 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 4 months
Topics: Quant , Aptitude , Coding questions , HR Questions and Resume
Tip
Tip

Tip 1 : Practice Quant questions
Tip 2 : Prepare your resume
Tip 3 : Be confident

Application process
Where: Campus
Eligibility: No
Resume Tip
Resume tip

Tip 1 : Keep your resume clear
Tip 2 : Highlight what you have accomplished

Interview rounds

01
Round
Easy
Online Coding Test
Duration60 minutes
Interview date9 Sep 2021
Coding problem2

Coding questions based on array and stack

1. Find Non - Repeating Numbers

Easy
15m average time
85% success
0/40
Asked in companies
HCL TechnologiesSamsung R&D InstituteGoldman Sachs

You are given an array of integers ‘A’ having ‘N’ number of elements. It is given that all the numbers in the array occur twice except the two numbers that appear only one time. You need to find those two non-repeating numbers.

For Example:
If the given array is [ 4, 7, 3, 2, 7, 2 ], you have to find ‘4’ and ‘3’ as 4 and 3 occur one time, and the rest of the elements ( 7 and 2 ) are occurring twice.
Problem approach

unordered_mapm;
for( int i=0;im[arr[i]]++;
}
for( int i=0;iif( m[arr[i]]==1)return arr[i];
}
// Complete the function
return 0;

Try solving now

2. Best Time to Buy and Sell Stock II

Moderate
22m average time
0/80
Asked in companies
Goldman SachsPhonePeLinkedIn

You have been given stock values/prices for N number of days. Every i-th day signifies the price of a stock on that day. Your task is to find the maximum profit which you can make by buying and selling the stocks.

 Note :
You may make as many transactions as you want but can not have more than one transaction at a time i.e, if you have the stock, you need to sell it first, and then only you can buy it again.
Problem approach

class Solution{
public:
//Function to find the days of buying and selling stock for max profit.
vector > stockBuySell(vector A, int n)
{
vector> v;
vector temp;
int low=0,high=0;

for(int i=0;i<(n-1);i++)
{
low=i;
high=i;
while(A[i+1]>A[i] && i<(n-1))
{
++high;
++i;
}
if(low!=high)
v.push_back({low,high});
}
return v;
}
};

Try solving now
02
Round
Medium
Face to Face
Duration45 minutes
Interview date24 Sep 2021
Coding problem2

consolidate your knowledge and concepts in DBMS

1. DBMS Question

Explain different languages present in DBMS.

Problem approach

Tip 1 : DDL DML
Tip 2 : Practice
Tip 3 : Confidence

2. DBMS Question

What is meant by ACID properties in DBMS?

Problem approach

Tip 1 : ACID stands for Atomicity, Consistency, Isolation, and Durability in a DBMS these are those properties that ensure a safe and secure way of sharing data among multiple users.
Tip 2 : Read DBMS Concepts
Tip 3 : Practice

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
company logo
Software Engineer
2 rounds | 3 problems
Interviewed by HCL Technologies
0 views
2 comments
0 upvotes
company logo
SDE
2 rounds | 4 problems
Interviewed by HCL Technologies
0 views
0 comments
0 upvotes
company logo
System Engineer
3 rounds | 6 problems
Interviewed by HCL Technologies
943 views
0 comments
0 upvotes
company logo
Software Engineer
2 rounds | 6 problems
Interviewed by HCL Technologies
1390 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE
4 rounds | 6 problems
Interviewed by HashedIn
727 views
0 comments
0 upvotes