Housing.com is a Mumbai-based real estate search portal which allows customers to search for housing based on geography, number of rooms, and various other filters. The company has 6,000 brokers and serves 40 cities in India including Chennai, Mumbai, Bengaluru, Kolkata and Delhi.
It has got a 4.3* rating on Glassdoor and is considered one of the best product-based companies. It is highly regarded for its work-life balance.
They provide good training as well which will be beneficial in future too. You can practice the below questions collected from Housing.com Interview Experience for the interview. We have collected past frequently asked questions from Housing.com Interview Experience for your reference.
Categories of Questions
Housing.com Array Questions
Question 1. Largest Sum Contiguous Subarray Problem Statement You are given an array of integers. The problem statement asks to find out the largest sum contiguous subarray. This means nothing but to find a subarray (continuous elements) which has the largest sum among all other subarrays in the given array. Example arr[] = {1, -3, 4, ...
Housing.com Graph Questions
Question 2. Breadth First Search (BFS) for a Graph Breadth First Search (BFS) for a graph is a traversing or searching algorithm in tree/graph data structure. It starts at a given vertex(any arbitrary vertex) and explores all the connected vertex and after that moves to the nearest vertex and explores all the unexplored nodes and takes care that no ...
Housing.com Queue Questions
Question 3. Breadth First Search (BFS) for a Graph Breadth First Search (BFS) for a graph is a traversing or searching algorithm in tree/graph data structure. It starts at a given vertex(any arbitrary vertex) and explores all the connected vertex and after that moves to the nearest vertex and explores all the unexplored nodes and takes care that no ...
Housing.com Other Questions
Question 4. Minimum number of jumps to reach end Problem Statement Suppose you have an array of integers and each element of an array indicates each number as maximum jumps that can be taken from that point. Your task is to find out the minimum number of jumps to reach end, i.e. minimum of jumps that can be taken ...