Openhouse Manager Interview Questions and Answers

Q1. Asked each and every thing from cv and some estimate questions
Add your answer

Q1. Guesstimates on no. of air travellers in Delhi
Add your answer
Q2. Case study on profitability
Add your answer
Q3. Normal HR questions
Add your answer

Q1. Tell me something about your self
Add your answer
Q2. How you lead your ledger ship in real estate
Ans. 
I lead my ledger ship in real estate by setting clear goals, empowering my team, and staying updated on market trends.
• Setting clear goals and objectives for the team to work towards

• Empowering team members to make decisions and take ownership of their work

• Staying updated on market trends and adapting strategies accordingly

• Building strong relationships with clients and stakeholders

• Implementing efficient processes and sys
Answered by AI
Add your answer

Q1. About ur self, n experience
Add your answer

Q1. My self n, how much experience do you have and why u want to join real estate
Add your answer

Q1. My self n experience
Add your answer

Q1. Mybm self n experience
Add your answer

1. They asked puzzles

Q1. They ask some mind questions and calculation, how good you are in logic along with Excel knowledge
Add your answer

Q1. Puzzles are the way to go with interviews here
Add your answer
Q2. General popular puzzles on net
Add your answer

Q1. Relevance to the role
Add your answer
Q2. How is your experience relevant?
Add your answer

Q1. About my experience & personal life.
Add your answer

Q1. About my past experience & how will I manage Jaipur market.
Add your answer

Q1. Final round with same questions.
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

It comprised of general aptitude questions and two coding questions. It was an offline test.

Q1. 
N Queens Problem
Given an integer N, find all possible placements of N queens on an N x N chessboard such that no two queens threaten each other.
Explanation:
A queen can attack another queen if they ar...read more
Ans. 
The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard where no two queens threaten each other.
• Use backtracking algorithm to explore all possible configurations.

• Keep track of rows, columns, and diagonals to ensure queens do not attack each other.

• Generate and print valid configurations where queens are placed safely.

• Consider constraints and time limit for efficient solution.

• Exam...read more
Answered by AI
Add your answer
Q2. 
Sort 0 1 2 Problem Statement
Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
Input:
The first line contains an integer 'T' representing the n...read more
Ans. 
Sort an integer array containing only 0s, 1s, and 2s in linear time complexity.
• Use three pointers to keep track of the positions of 0s, 1s, and 2s in the array.

• Iterate through the array and swap elements based on the values encountered.

• Achieve sorting in a single scan over the array without using any extra space.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

After having a technical discussion about my CV. He gave me two questions to code.

Q1. 
Ninja and Substrings Problem Statement
Ninja has to determine all the distinct substrings of size two that can be formed from a given string 'STR' comprising only lowercase alphabetic characters. These su...read more
Ans. 
Find all unique contiguous substrings of size two from a given string.
• Iterate through the string and extract substrings of size two

• Use a set to store unique substrings

• Return the set as an array of strings
Answered by AI
Add your answer
Q2. 
Cycle Detection in a Singly Linked List
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next points back to a previous node in the ...read more
Ans. 
Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.
• Traverse the linked list using two pointers, one moving one step at a time and the other moving two steps at a time.

• If the two pointers meet at any point, there is a cycle in the linked list.

• If one of the pointers reaches the end of the list (null), there is no cycle.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This was supposed to be the HR round but out of surprise the interviewer started by giving me a question to code. 
After I approached this question with the right solution he just asked about my family. After that he said to wait. After half an hour the results were announced. A total of three students were hired and I was amongst one of them.

Q1. 
Balanced Parentheses Combinations
Given an integer N representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.
Explanati...read more
Ans. 
Generate all possible combinations of balanced parentheses for a given number of pairs.
• Use recursion to generate all possible combinations of balanced parentheses.

• Keep track of the number of open and close parentheses used in each combination.

• Return the valid combinations as an array of strings.
Answered by AI
Add your answer