ICONMA Technical Recruiter Interview Questions and Answers

Q1. Self introduction
Add your answer
Q2. Knowledge company history and status
Add your answer
Q3. Technical skills knowledge
Add your answer
Q4. About their current targets
Add your answer
Q5. Lifo & fifo method
Add your answer

Q1. Related to their skills mostly asked
Add your answer
Q2. What are the skills set you have worked in technical Recruitment. Explain Related to that.
Add your answer
Q3. What is your roles and responsibilities
Add your answer
Q4. What is Boolean search
Ans. 
Boolean search is a type of search that allows users to combine keywords with operators such as AND, OR, NOT to produce more relevant results.
• Boolean search helps recruiters to narrow down their search results by using specific keywords and operators.

• Operators like AND, OR, NOT can be used to refine search queries.

• Example: Searching for 'Java AND Developer' will return results that include both keywords.

• Example: Search...read more
Answered by AI
Add your answer

Q1. Related to my core Job profile and experience
Add your answer
Q2. About new change in government compliance changes,
Add your answer
Q3. How I can manage those changes
Add your answer

Quantitative Aptitude

Q1. To write syntax for a problem using any programming language.
Add your answer
Q2. Tell me about your projects and Internship experience.
Add your answer

Q1. Questions were related to Hobbies, extra curricular activities and some questions of analytical ability such as color cube, maths, etc. It was in general.
Add your answer

Q1. General introduction about yourself
Add your answer

Q1. Subject knowldge
Add your answer

Q1. Final round with CFO
Add your answer

Round duration - 105 minutes
Round difficulty - Medium

There were 3 problems .
One was easy but the other two were of medium level.

Q1. 
Aggressive Cows Problem Statement
Given an array representing positions of stalls and an integer ‘K’ representing the number of aggressive cows, determine the largest minimum distance between any two cows ...read more
Ans. 
The problem requires assigning aggressive cows to stalls in a way that maximizes the minimum distance between any two cows.
• Sort the array of stall positions in ascending order.

• Use binary search to find the largest minimum distance between cows.

• Check if it is possible to assign cows with this minimum distance by iterating through the sorted array.

• If it is possible, update the maximum distance and continue binary search ...read more
Answered by AI
Add your answer
Q2. 
Shortest Path in an Unweighted Graph
The city of Ninjaland is represented as an unweighted graph with houses and roads. There are 'N' houses numbered 1 to 'N', connected by 'M' bidirectional roads. A road...read more
Ans. 
The problem is to find the shortest path between two houses in an unweighted graph.
• The graph represents the city of Ninjaland with houses connected by roads.

• The input consists of the number of test cases, number of houses and roads, starting and ending house, and the roads between houses.

• The output is a vector of nodes representing the shortest path from the starting house to the ending house.

• If there are multiple shor...read more
Answered by AI
Add your answer
Q3. 
Count Set Bits Problem Statement
Given a positive integer N, compute the total number of '1's in the binary representation of all numbers from 1 to N. Return this count modulo 1e9+7 because the result can...read more
Ans. 
The task is to count the total number of '1' in the binary representation of all numbers from 1 to N.
• Convert each number from 1 to N into its binary representation

• Count the number of '1' bits in each binary representation

• Sum up the counts of '1' bits for all numbers

• Return the sum modulo 1e9+7
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

The interviewer was very polite and straightforward. 
Firstly he introduced himself and then asked me to introduce myself and then he jumped to the coding problems.
After the coding problems, he asked some questions from the OS and DBMS.

Q1. 
Reverse Words in a String: Problem Statement
You are given a string of length N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...read more
Ans. 
The task is to reverse the words in a given string, removing any leading or trailing spaces and replacing multiple spaces between words with a single space.
• Split the string into words using spaces as delimiters

• Reverse the order of the words

• Join the reversed words with a single space between them

• Remove any leading or trailing spaces
Answered by AI
Add your answer
Q2. 
Reverse Linked List in Groups of K
You are provided with a linked list containing 'N' nodes and an integer 'K'. The task is to reverse the linked list in groups of size K, which means reversing the nodes ...read more
Ans. 
The task is to reverse a linked list in groups of size K.
• Iterate through the linked list in groups of size K

• Reverse each group using a helper function

• Connect the reversed groups to form the final reversed linked list
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The interviewer was very polite and straightforward, firstly he introduce himself and then ask me to introduce myself and then ask some ques on my projects and then he jumps to the coding problems.

Q1. 
Remove Consecutive Duplicates From String Problem Statement
Given a string STR consisting of both lower and upper case characters, your task is to remove consecutive duplicate characters from the string a...read more
Ans. 
The task is to remove consecutive duplicate characters from a given string and return the new string.
• Iterate through the characters of the string

• Compare each character with the next character

• If they are the same, skip the next character

• If they are different, add the current character to the new string

• Return the new string
Answered by AI
Add your answer
Q2. 
Maximum Path Sum in a Matrix
Given an N*M matrix filled with integer numbers, determine the maximum sum that can be obtained from a path starting from any cell in the first row to any cell in the last row...read more
Ans. 
The question asks to find the maximum sum that can be obtained from a path starting from any cell in the first row to any cell in the last row of a given matrix.
• Iterate through each cell in the first row and calculate the maximum sum path ending at that cell

• For each cell, calculate the maximum sum path ending at that cell by considering the three possible directions

• Store the maximum sum path ending at each cell in a se...read more
Answered by AI
Add your answer