Housing.com Software Developer Interview Questions, Process, and Tips

Round duration - 60 minutes
Round difficulty - Medium

Technical round with questions based on DSA.

Q1. 
Maximum Level Sum Problem Statement
Given a binary tree with integer nodes, your task is to determine the maximum level sum among all the levels in the binary tree. The sum at any level is the sum of all ...read more
Ans. 
This question can be solved by doing a level order traversal of the tree. While doing the traversal, process nodes of different levels separately. For every level being processed, calculate the sum of nodes in each level and keep track of the maximum sum. At the end, return the maximum sum. 
Time Complexity: O(N)
Auxiliary Space: O(w) where w is the maximum width of the tree
Answered Anonymously
Add your answer
Q2. 
Maximum Sum Circular Subarray Problem Statement
Find the maximum possible sum of a non-empty subarray from a given circular array/list ARR containing N integers.
Explanation:
The array is circular, mean...read more
Ans. 
A modified Kadane’s algorithm can be used for this problem. Using kadane’s, find the minimum contiguous subarray sum and the maximum contiguous subarray sum in the array and then check for the maximum value between the max_value and the value left after subtracting min_value from the total sum. 
Example 1:-
A = [1, -2, 3, -2]
Max_value = 3 (This means max subarray sum for normal array)
Min_value = -2 (This means min s...read more
Answered Anonymously
Add your answer
Q3. 
Sum of Big Integers Problem Statement
Given two integers, NUM1 and NUM2, as strings, your task is to compute and return the sum of these numbers.
Input:
The first line contains an integer T, the number ...read more
Ans. 
Since the numbers are large, we store the numbers in string type. To add the two numbers, basic school mathematics can be applied. 
Traverse both the strings from end, one by one add digits and keep track of carry. 
Steps : 
1) Reverse both strings. 
2) Keep adding digits one by one from 0’th index (in reversed strings) to end of smaller string, append the sum % 10 to end of result and keep track of car...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Briefly discussed about projects in resume and questions were completely related to projects mentioned. And then he asked questions based on DSA.

Q1. 
Longest Substring Without Repeating Characters Problem Statement
Given a string S of length L, determine the length of the longest substring that contains no repeating characters.
Example:
Input:
"abac...read more
Ans. 
The brute force approach would be to consider all substrings one by one and check for each substring whether it contains all unique characters or not. There will be n*(n+1)/2 substrings. Time complexity of this solution would be O(n^3).

For an efficient solution, a hashmap can be used. Maintain a hashmap which stores the characters in string as keys and their indexes(positions) as values, and keep two pointers which def...read more
Answered Anonymously
Add your answer
Q2. 
Word Break Problem - Generate Sentences
Given a non-empty string sentence containing no spaces and a dictionary of non-empty strings words, your task is to construct and return all possible meaningful sen...read more
Ans. 
Hashing can be used to solve this question. Keep the count of words of the dictionary in a hash map. Iterate the string and for each word, check if is present in the map. If present, then decrease the count of that word in the map. If it is not present, then it is not possible to make the given string from the given dictionary of words.
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Technical round where the interviewer asked me 2 DSA problems.

Q1. 
Replace Spaces in a String
Given a string STR consisting of words separated by spaces, your task is to replace all spaces between words with the characters "@40".
Input:
The first line contains an integ...read more
Ans. 
One approach could be to calculate the number of spaces in the given string. Calculate the new length of the string as original length + 2*(number of spaces). Create a new string of the length calculated. Traverse the original string and keep appending all characters except spaces in the new string. As soon as a space is encountered, append '%20' in the string. Return the new string created.
Answered Anonymously
Add your answer
Q2. 
Painter's Partition Problem Statement
Given an array/list representing boards, where each element denotes the length of a board, and a number ‘K’ of available painters, determine the minimum time required...read more
Ans. 
Firstly, we calculate the sum of all the elements in the array. If the sum is odd (sum%2!=0), then we cannot divide the array elements into 2 subsets with equal sum, but if the sum is even, we might be able to divide the array into 2 equal subsets. If the sum is even, we check if there is a subset with the sum of elements = sum/2. If it exists, that means the other subset also has elements with sum = sum/2, so we retur...read more
Answered Anonymously
Add your answer