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. 
Find the maximum level sum in a binary tree with integer nodes.
• Traverse the binary tree level by level and calculate the sum of nodes at each level.

• Keep track of the maximum level sum encountered so far.

• Return the maximum level sum as the output.
Answered by AI
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. 
Find the maximum sum of a non-empty subarray from a circular array.
• Identify the maximum sum of a non-empty subarray within the circular array

• Consider both normal and circular subarrays to find the maximum sum

• Implement a function to solve the problem efficiently
Answered by AI
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. 
Implement a function to compute the sum of two large integers given as strings.
• Convert the input strings to integers and add them digit by digit from right to left, considering carry over.

• Handle cases where one number is longer than the other by padding with zeros.

• Return the final sum as a string.
Answered by AI
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. 
Find the length of the longest substring without repeating characters in a given string.
• Use a sliding window approach to keep track of the longest substring without repeating characters.

• Use a hashmap to store the index of each character in the string.

• Update the start index of the window when a repeating character is encountered.

• Calculate the maximum length of the substring as you iterate through the string.

• Return the m
Answered by AI
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. 
Given a string without spaces and a dictionary of words, generate all possible sentences by inserting spaces.
• Use backtracking to generate all possible combinations of words from the dictionary to form sentences

• Iterate through the string and try to match substrings with words from the dictionary

• Recursively build sentences by adding words that match the substrings

• Return all valid sentences formed
Answered by AI
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. 
Replace spaces in a string with '@40'.
• Iterate through the string and replace spaces with '@40'.

• Use string manipulation functions to achieve the desired output.

• Handle multiple test cases by looping through each input string.
Answered by AI
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. 
The problem involves determining the minimum time required to paint all boards with a given number of painters.
• Iterate through the array to find the maximum board length.

• Use binary search to find the minimum time required to paint all boards.

• Optimize the painting process by assigning continuous sections of boards to painters.
Answered by AI
Add your answer