Recruitment Cell HR Recruiter Interview Questions and Answers

They will ask us to give our self introduction or we need to discuss on any topic for few mins, through that they will check our communication skills.

Q1. Why Recruitment role?
Add your answer

30 mins English Literacy test

Percentages,reasoning,logics based on problems

Addition,logics of programming

Q1. Educational qualification
Add your answer
Q2. Family background,character
Add your answer
Q3. Communication skills
Add your answer

Q1. What is your total year's of experience?
Add your answer
Q2. What is the stratgies for sourcing candidates?
Ans. 
Strategies for sourcing candidates involve utilizing various channels such as job boards, social media, employee referrals, and networking events.
• Utilize job boards like Indeed, Glassdoor, and LinkedIn to post job openings

• Leverage social media platforms such as Facebook, Twitter, and Instagram to reach a wider audience

• Encourage employee referrals by offering incentives for successful hires recommended by current employ...read more
Answered by AI
Add your answer
Q3. Why should i hire you?
Add your answer
Q4. Why we want you to work for Time Lease? If you know answer for this question please do needful for the Senior Hiring Manager from Time Lease...!!!!
Add your answer

It was more into critical thinking more of English assessments things like that

Q1. Tell me about yourself
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

In first round they asked me 2 coding questions where he asked me to code as close as possible to the actual one.

Q1. 
Ninja and Sorted Array Merging Problem
Ninja is tasked with merging two given sorted integer arrays ARR1 and ARR2 of sizes 'M' and 'N', respectively, such that the merged result is a single sorted array w...read more
Ans. 
Merge two sorted arrays into one sorted array in place.
• Use two pointers to compare elements from both arrays and place them in the correct position in ARR1.

• Start from the end of ARR1 and compare elements from both arrays, placing the larger element at the end of ARR1.

• Continue this process until all elements from ARR2 are merged into ARR1.
Answered by AI
Add your answer
Q2. 
Word Distance Calculation
Given a document represented as an array/list ARR of words with length N, find the smallest distance between two given words for multiple queries. The distance is defined as the ...read more
Ans. 
Find the smallest distance between two words in a document for multiple queries.
• Iterate through the document array to find the indices of the two words in each query.

• Calculate the absolute difference between the indices to get the distance.

• If a word from the query is not present in the document, return the length of the document array.

• Repeat the process for each query and output the smallest distance for each.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Then in the second round they asked a little about tree and told me to code 2 codes.

Q1. 
Level Order Traversal Problem Statement
Given a binary tree of integers, return the level order traversal of the binary tree.
Input:
The first line contains an integer 'T', representing the number of te...read more
Ans. 
The problem requires implementing a function to return the level order traversal of a binary tree.
• Implement a function that takes the root of the binary tree as input and returns the level order traversal of the tree.

• Use a queue data structure to perform level order traversal.

• Process each level of the tree one by one, starting from the root node.

• Print the node values at each level in the order they appear from left to ...read more
Answered by AI
Add your answer
Q2. 
Combination Sum Problem Statement
Given an array of distinct positive integers ARR and a non-negative integer 'B', find all unique combinations in the array where the sum is equal to 'B'. Numbers can be c...read more
Ans. 
Find all unique combinations in an array where the sum is equal to a given target sum, with elements in non-decreasing order.
• Use backtracking to generate all possible combinations.

• Sort the array to ensure elements are in non-decreasing order.

• Track the current combination and sum while backtracking.

• Terminate recursion when the sum equals the target sum.

• Avoid duplicates by skipping elements that have been used in previou
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.