Ihg Group Intern Interview Questions and Answers

Q1. Tell me about yourself
Ans. 
I am a motivated HR intern with a passion for learning and contributing to a positive work environment.
• Currently pursuing a degree in Human Resources

• Completed relevant coursework in recruitment and employee relations

• Previous internship experience in a corporate HR department

• Strong communication and organizational skills

• Passionate about fostering a diverse and inclusive workplace
Answered by AI
Add your answer

Q1. Introduction of yours ?
Ans. 
I am a motivated and detail-oriented student with a passion for learning and gaining practical experience in the field.
• Currently pursuing a degree in [Your Major] at [Your University]

• Completed relevant coursework in [Specific Subjects]

• Previous internship experience at [Company Name] where I gained skills in [Specific Skills]

• Involved in extracurricular activities such as [Club or Organization]
Answered by AI
Add your answer

Just some random easy topic

Easy questions overall gk

Q1. About Yourself. About work environment and flexibility.
Add your answer

Q1. Tell me about yourself
Add your answer
Q2. Your past experiences
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

Q1. Detect Cycle in a Directed Graph
Given a directed graph, check whether the graph contains a cycle or not. Your function should return true if the given graph contains at least one cycle, else return false.
...read more
Ans. 
I used DFS from every unvisited node. There is a cycle in a graph only if there is a back edge present in the graph.
To find the back edge to any of its ancestor keep a visited array and if there is a back edge to any visited node then there is a loop and return true.
Answered by CodingNinjas
View 1 more answer
Q2.  Next Permutation
You have been given a permutation of ‘N’ integers. A sequence of ‘N’ integers is called a permutation if it contains all integers from 1 to ‘N’ exactly once. Your task is to rearrange the...read more
Ans. 
Traverse from right and find the first item that is not following the descending order.
Swap the found character with closest greater (or smallest greater) element on right side of it.
After swapping, sort the string after the position of character found.
Answered by CodingNinjas
View 2 more answers

Round duration - 60 minutes
Round difficulty - Easy

Q1. Validate BST
Given a binary tree with N number of nodes, check if that input tree is BST (Binary Search Tree) or not. If yes, return true, return false otherwise.
A binary search tree (BST) is a binary t...read more
Ans. 
I gave him two three approaches.
Brute force
using utility class
using in-order traversal:
Answered by CodingNinjas
View 2 more answers