Tip 1 : Practice lots of programming.
Tip 2 : Build a nice portfolio on any coding platform like LeetCode, HackerRank, etc.
Tip 3 : Practice of CP using only one Programming language
Tip 1 : Do not put false things and over skills in your resume.
Tip 2 : Put some good and working projects in your resume.
Timing-60 Duration Of Assessment
Test is conducted virtually through HCL test platform. Test contains questions related to DBMS, OOPS concept, programming, SQL, and other questions related to Leadership Principles and workstyles.
1) how many types of joins in SQL(DBMS question)
2) what is the output of below program
3) some behavioral questions like are you open to learn new skills.
4)Are you open to adopt new challenging opportunity or want to stick on the previous work.
5)What is primary and foreign key in SQL?
6)What is the result of given program?
7)What is Polymorphism and explain function overloading and function overriding?
Tip 1: Based upon your knowledge you need to answer.
Tip 2: Need to choose one option.
Tip 3: Need to revise topics related to assessment test.
We need to solve 1 or 2 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 asks some other questions as well like your introduction, some core subjects question related to DBMS, OOPS concept, programming, SQL, and other questions related to Leadership Principles and workstyles.



1. All four numbers should exist at different indices in the given array.
2. The answer is case-sensitive.
Solution in Python-
class Solution:
def fourSum(self, nums: List[int], target: int) -> List[List[int]]:
nums.sort()
res,quad=[],[]
def kSum(k,start,target):
if k!=2:
for i in range(start, len(nums)-k+1):
if i>start and nums[i]==nums[i-1]:
continue
quad.append(nums[i])
kSum(k-1,i+1,target-nums[i])
quad.pop()
return
l,r=start,len(nums)-1
while ltarget:
r-=1
else:
res.append(quad+[nums[l],nums[r]])
l+=1
while l l+=1
kSum(4,0,target)
return res



You must sell the stock before you buy it again.
Solution in Python:
class Solution:
def maxProfit(self, prices: List[int]) -> int:
lowest = prices[0]
mx = 0
for i in range(len(prices)):
if prices[i] < lowest:
lowest = prices[i]
elif prices[i] - lowest > mx:
mx = prices[i] - lowest
return mx
What is OOPS concept and its also explain its types?
Write a query to join 2 tables intersection records?
What is DML and DDL?
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.

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?