Xyz Company HR Executive Interview Questions and Answers

Q1. Introduce yourself
Ans. 
I am a seasoned HR professional with 10+ years of experience in recruitment, employee relations, and performance management.
• 10+ years of experience in HR

• Specialize in recruitment, employee relations, and performance management

• Strong communication and interpersonal skills
Answered by AI
Add your answer
Q2. Would you like to relocate?
Ans. 
Yes, I am open to relocating for the right opportunity.
• I am open to exploring new locations for career growth

• I am willing to relocate if it aligns with my career goals

• I have relocated in the past for career advancement
Answered by AI
Add your answer

Q1. Introduce yourself
Ans. 
I am a seasoned HR professional with 10+ years of experience in recruitment, employee relations, and performance management.
• Bachelor's degree in Human Resources Management

• SHRM-CP certification

• Led successful recruitment campaigns resulting in 20% increase in qualified candidates

• Implemented employee engagement initiatives resulting in 15% decrease in turnover rate
Answered by AI
Add your answer
Q2. Would you like to relocate
Ans. 
Yes, I am open to relocating for the right opportunity.
• I am open to exploring new locations for career growth

• I have relocated in the past for job opportunities

• I am willing to consider relocation if it aligns with my career goals
Answered by AI
Add your answer
Q3. Why did you switch from engineering to HR
Ans. 
I switched from engineering to HR because I discovered my passion for working with people and helping them reach their full potential.
• Realized passion for working with people

• Enjoyed helping others reach their potential

• Strong communication and interpersonal skills

• Desire to make a positive impact on organizational culture
Answered by AI
Add your answer

Topic given covid pandemic

Q1. What your strength
Add your answer
Q2. Who founder of bajaj
Ans. 
The founder of Bajaj is Jamnalal Bajaj.
• Jamnalal Bajaj founded Bajaj in 1926.

• He was a prominent Indian industrialist, freedom fighter, and close associate of Mahatma Gandhi.

• Under his leadership, Bajaj Group diversified into various industries like automobiles, finance, and electricals.
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Hard

Q1. 
Find the Duplicate Number Problem Statement
Given an integer array 'ARR' of size 'N' containing numbers from 0 to (N - 2). Each number appears at least once, and there is one number that appears twice. Yo...read more
Ans. 
Find the duplicate number in an integer array containing numbers from 0 to (N - 2).
• Iterate through the array and keep track of the frequency of each number using a hashmap.

• Return the number that appears twice in the array.

• The duplicate number is always present in the given array.
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Easy

Q1. 
Bubble Sort Problem Statement
Sort an unsorted array of non-negative integers using the Bubble Sort algorithm, which swaps adjacent elements if they are not in the correct order to sort the array in non-d...read more
Ans. 
Bubble Sort is used to sort an array of non-negative integers in non-decreasing order by swapping adjacent elements if they are not in the correct order.
• Iterate through the array and compare adjacent elements, swapping them if they are in the wrong order.

• Repeat this process until the array is sorted in non-decreasing order.

• Time complexity of Bubble Sort is O(n^2) in worst case.

• Example: For input [6, 2, 8, 4, 10], the o
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Q1. 
Unweighted Graph Shortest Path Problem
You are tasked with finding the shortest path between two houses in the city of Ninjaland, represented as an unweighted graph. The city has N houses numbered from 1 ...read more
Ans. 
Find the shortest path between two houses in a city represented as an unweighted graph.
• Use breadth-first search (BFS) algorithm to find the shortest path in an unweighted graph.

• Start BFS from the source house and keep track of the shortest path to each house.

• Once the destination house is reached, backtrack to find the shortest path.

• Consider using a queue data structure to implement BFS efficiently.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy