Housing.com Interview Questions, Process, and Tips

The function decodes a URL-encoded string by replacing specific characters with their corresponding symbols.

• Iterate through each character in the input string

• If the character is '%', check the next two characters to determine the replacement symbol

• Replace the '%XX' sequence with the corresponding symbol

• Continue until all occurrences of '%XX' are replaced

Check if an array can be partitioned into two subarrays with equal sum.

• Iterate through the array and calculate the total sum of all elements.

• If the sum is odd, return false as it cannot be divided into two equal parts.

• If the sum is even, try to find a subset with sum equal to half of the total sum.

• Use dynamic programming or backtracking to find the subset sum.

The maximum contiguous circular sum in an array is the maximum sum that can be obtained by wrapping the array around in a circular manner.

• To find the maximum contiguous circular sum, we can use Kadane's algorithm twice.

• First, we find the maximum sum using Kadane's algorithm for the non-circular array.

• Then, we find the maximum sum using Kadane's algorithm for the circular array by subtracting the minimum sum subarray fr...read more

Given a binary tree, print sum of each level

• Use a breadth-first search (BFS) algorithm to traverse the tree level by level

• Keep track of the sum of each level using a separate variable for each level

• Print the sum of each level after traversing the entire tree

It is not possible to add two integers that cannot be stored even in long long int.

• The maximum value that can be stored in long long int is 9,223,372,036,854,775,807.

• Any two integers whose sum exceeds this value cannot be stored in long long int.

• In such cases, a different data type or approach is required to handle the large numbers.

Find the length of the longest substring without any repeating characters.

• Use a sliding window approach to iterate through the string.

• Keep track of the characters seen so far using a set.

• Update the maximum length of the substring whenever a repeating character is encountered.