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

SDE - 1

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

Interview preparation journey

expand-icon
Preparation
Duration: 3 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: CSE IT Branch
Resume Tip
Resume tip

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

Interview rounds

01
Round
Hard
Online Coding Interview
Duration60 Minutes
Interview date1 Mar 2020
Coding problem2

1. First non repeating character

Easy
15m average time
80% success
0/40
Asked in companies
QuikrHCL TechnologiesMakeMyTrip

Ninja is now bored with numbers and is now playing with characters but hates when he gets repeated characters. Ninja is provided a string, and he wants to return the first unique character in the string.The string will contain characters only from the English alphabet set, i.e., ('A' - 'Z') and ('a' - 'z'). If there is no non-repeating character, print the first character of the string. If there is no non-repeating character, return the first character of the string.

Problem approach

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

Try solving now

2. Best Time to Buy and Sell

Moderate
20m average time
80% success
0/80
Asked in companies
HCL TechnologiesGoldman SachsMakeMyTrip

You are given an array(PRICES) of stock prices for N consecutive days. Your task is to find the maximum profit that you can make by completing as many transactions as you like, where a transaction denotes buying one and selling one share of the stock.

Note:

You must sell the stock before you 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
Duration60 Minutes
Interview date19 Mar 2020
Coding problem2

o 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
SDE - 1
2 rounds | 6 problems
Interviewed by HCL Technologies
1251 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by HCL Technologies
1496 views
4 comments
0 upvotes
company logo
SDE - 1
2 rounds | 6 problems
Interviewed by HCL Technologies
1950 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 4 problems
Interviewed by HCL Technologies
2260 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
2 rounds | 3 problems
Interviewed by BNY Mellon
6366 views
3 comments
0 upvotes
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by BNY Mellon
0 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by CIS - Cyber Infrastructure
2198 views
0 comments
0 upvotes