Whitehat jr HR Executive Interview Questions and Answers

This test contains 4 sections of 20 questions each

Q1. Its a recorded video interview session
Add your answer

Q1. Documents are asked to uplod by candidates
Add your answer

Q1. What is you education
View 5 more answers
Q2. Why do you want to do this job?
Ans. Because I want to learn new things and improve my communication as well
Answered by Bishal Dey
View 1 more answer
Q3. Will you be able to join now ?
Ans. I can but how much time do I have , and they inform me that you have to join within next 10 days but can you join today as a new batch was starting from today , so i agreed
Answered by Bishal Dey
Add your answer
Q4. Are you okay to work on a stipend of 5k till the training period and then we will offer you a permanent job as per your performance?
Ans. I said, okay I can ( thinking let's see what's inside the box for me ).
Answered by Bishal Dey
Add your answer
Q5. The working hours are from 9 to 7 in the evening, are you comfortable with that?
Ans. I said , okay we can get on with it.
Answered by Bishal Dey
Add your answer

So there was one senior executive and 4 others excluding me and there we did mock calls on how to talk with the teaching candidates for the first time and then it was called off for the day as it was out first day.

Q1. Introduce yourself in 3 lines Why you want to join
Add your answer

Q1. Tell me about yourself
Add your answer

Excel based assignment

Q1. Excel, SQL and Google Sheets
Add your answer

There was 2 coding question
One was easy One was very Difficult
20 MCQ question from Operating system and DBMS

Q1. First question was binary search in unsorted arrays So here i have asked about sorting algorithms all sorting algorithms must be clear
Add your answer
Q2. Second question was to find longest consecutive subarray.
Ans. 
Find the longest consecutive subarray.
• Iterate through the array and keep track of the current subarray length.

• Update the maximum length as you iterate.

• Reset the current subarray length when a non-consecutive element is encountered.
Answered by AI
Add your answer

Q1. OOPS related question Heap insertion deletion question Hashing Spanning tree
Add your answer
Q2. Minimum Spanning tree Implementation of MST
Ans. 
Minimum Spanning Tree (MST) is a tree that connects all vertices in a graph with minimum total edge weight.
• MST can be found using Prim's algorithm or Kruskal's algorithm.

• Prim's algorithm starts with a single vertex and adds the closest vertex to the tree until all vertices are included.

• Kruskal's algorithm starts with the edges with the lowest weight and adds them to the tree as long as they don't create a cycle.

• MST has...read more
Answered by AI
Add your answer

Q1. Educational qualification
Add your answer
Q2. What skills i have for the job position
Add your answer

Q1. Direct processing of Excel file & data compilation and some SQL queries
Add your answer