Company Name Starts with ...
#  A  B  C  D  E   F  G  H  I  J   K  L  M  N  O   P  Q  R  S  T   U  V  W  X  Y  Z

HCL Interview Questions
Questions Answers Views Company eMail

Tell me about yourself?

229 489466

why you used Java Script? Can it use for both client side and server side validation purpose?

12 29934

what are Implode and Explode functions?

8 29057

What is Win32?

14 35120

How to access or modify the const variable in c ?

16 36535

Difference between Top down and bottom up approaches for a given project ?

14 105217

What is difference between initialization and assignment?

12 59719

What is virtual constructor paradigm?

5 13644

when can we use virtual destructor?

7 24443

What is Difference between thread and process?

28 258907

What is the abbreviation of SMILE

12 30489

what sort of things what u put in Bug Report ?

5 12206

Will you write a test plan in all phases?

11 23963

In Dialog program Syntax of Synchronous and Asynchronous?

2 8675

Domain-use?

4 10179

Post New HCL Interview Questions


HCL Interview Questions


Un-Answered Questions

What is memo?

321


How to scroll down to a particular element?

3156


What is the difference between quick filter, normal filter and context filter?

199


How will you create a updatecascade, deletecascade relation in ms-access? Explain with example.

450


Explain Casting in salesforce?

212






How to make the TDateTimePicker display blank?

1293


How do you highlight specific words?

378


What are cursors and when they are useful?

574


You have given 2 array. You need to find whether they will create the same BST or not. For example: Array1:10 5 20 15 30 Array2:10 20 15 30 5 Result: True Array1:10 5 20 15 30 Array2:10 15 20 30 5 Result: False One Approach is Pretty Clear by creating BST O(nlogn) then checking two tree for identical O(N) overall O(nlogn) ..we need there exist O(N) Time & O(1) Space also without extra space .Algorithm ?? DevoCoder guest Posted 3 months ago # #define true 1 #define false 0 int check(int a1[],int a2[],int n1,int n2) { int i; //n1 size of array a1[] and n2 size of a2[] if(n1!=n2) return false; //n1 and n2 must be same for(i=0;ia1[i+1]) && (a2[i]>a2[i+1]) ) ) return false; } return true;//assumed that each array doesn't contain duplicate elements in themshelves }

2712


What Are The Types Of Commercial Banks?

613


What is difference between visualforce components and lightning components ? : salesforce lightning component

194


The throbbing caused by sounds of slightly different frequencies that results because of periodic constructive and destructive interference is called:

613


How many rows can you have in an access table?

449


How web scraping is done in python, explain in short?

464


How can you access a private method of a class?

507