AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Housing.com Software Developer Interview Questions, Process, and Tips
Top Housing.com Software Developer Interview Questions and Answers
- 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 ...read more
- 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. Explana ...read more
- 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 ...read more
Housing.com Software Developer Interview Experiences
8 interviews found
Kashish Babbar
(2 Questions)
- Q1. Given a rotated sorted array, how can you search for a target value efficiently using the binary search algorithm?
- Ans.
Use binary search algorithm with slight modifications to handle rotated sorted array efficiently.
Find the pivot point where the array is rotated.
Determine which half of the array the target value lies in based on the pivot point.
Perform binary search on the appropriate half of the array.
- Q2. Other questions on indexing and other stuff
Anonymous
I applied via Naukri.com and was interviewed in Oct 2024. There was 1 interview round.
(2 Questions)
- Q1. Didnt give interview yet
- Q2. Didnt give interview yet.
Interview Preparation Tips
Anadi Tiwari
1. two sum
2. Easy DP problem
1. Easy LL problem
2. Tree
(2 Questions)
- Q1. Basic question like why do you want to join
- Q2. Why are you leaving current company
- Ans.
Seeking new challenges and growth opportunities
Looking for a new challenge to further develop my skills
Interested in exploring new technologies and projects
Seeking opportunities for career advancement and growth
(1 Question)
- Q1. Rotated sorted array problem
- Ans.
Rotated sorted array problem involves finding a target element in a rotated sorted array.
Use binary search to find the pivot point where the array is rotated.
Divide the array into two subarrays and perform binary search on the appropriate subarray.
Handle cases where the target element is at the pivot point or not present in the array.
Skills evaluated in this interview
Housing.com interview questions for designations
I appeared for an interview before Feb 2021.
(3 Questions)
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 ...
- 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.
- Q2.
Maximum Sum Circular Subarray Problem Statement
Find the maximum possible sum of a non-empty subarray from a given circular array/list
ARRcontainingNintegers.Explanation:
The array is circular, mean...
- 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
- Q3.
Sum of Big Integers Problem Statement
Given two integers,
NUM1andNUM2, as strings, your task is to compute and return the sum of these numbers.Input:
The first line contains an integerT, the number ... - 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.
(2 Questions)
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
Sof lengthL, determine the length of the longest substring that contains no repeating characters.Example:
Input:
"abac...
- 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
- Q2.
Word Break Problem - Generate Sentences
Given a non-empty string
sentencecontaining no spaces and a dictionary of non-empty stringswords, your task is to construct and return all possible meaningful sen... - 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
(2 Questions)
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
STRconsisting 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... - 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.
- 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...
- 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.
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Get interview-ready with Top Housing.com Interview Questions
Interview Questionnaire
8 Questions
- Q1. Input: “kitten%20pic.jpg” output: “kitten pic.jpg” %20 -> ‘ ‘ %3A -> ‘?’ %3D -> ‘:’ modify your input in place. no string library functions. void DecodeURL(string str
- Ans.
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
- Q2. Given an array, return true, if it can be partitioned into two subarrays whose sum of elements are same, else return false Example: Input: {5,1,5,11} Output: true (as it can be divided into {5,1,5} {11} wh...
- Ans.
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.
- Q3. Briefly discussed about projects in resume and questions were completely related to projects mentioned
- Q4. Find out the maximum contiguous circular sum in array, array may contain positive as well as negative numbers?
- Ans.
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...
- Q5. Given a binary tree, print sum of each level ?
- Ans.
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
- Q6. Add two integers which cannot be stored even in long long int?
- Ans.
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.
- Q7. Length of longest substring with no repeating character (Full running code)?
- Ans.
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.
- Q8. There is a function getWord() which takes word as input and checks whether word is present in the dictionary. Given a long word as input find all the meaning full ( i.e getWord() is true ) that can be made...
Interview Preparation Tips
Skills: Algorithm, Data structure
College Name: na
Skills evaluated in this interview
Ankit Silaich
Interview Preparation Tips
Experience: My resume included 12 websites which I have produced during my four years and also reflected some back-end skills.
I was shortlisted in last 55 students for the software developer profile.
Tips: If you are targeting the front-end or back-end profile, then include your projects in the resume.For the front end profile you should have knowledge of intermediate javascript and MVC frameworks.
General Tips: Revise all your material and basic concept of front-end skills to crack the interview round. You should be able to deliver on basic concepts. Questions at interview are a bit tricky, as they don't ask the simpler ones.
Skills: javascript, angular.js, backbone.js, jquery, html, css, php
College Name: IIT KANPUR
Motivation: Housing is a fast growing startup and for someone like me, it's a dream come true.
Funny Moments: They don't consider the CPI during the shortlisting if you have done significant work in that profile. I was selected in housing at 5.2 CPI and I have also answered many questions incorrectly. The interview process is very classy and you will enjoy it :)
Piyush Lahoti
Interview Questionnaire
1 Question
- Q1. LEVEL ORDER TRAVERSAL
Interview Preparation Tips
Experience: 4 FAIRLY STANDARD PROGRAMMING PROBLEMS AND ONE CHALLENGING PROBLEM.
Tips: TRY TO COVER ALL STANDARD AND FAMOUS PROBLEMS IN YOUR PREPARATION.
Duration: 120 minutes
Total Questions: 5
General Tips: KEEP YOUR CALM
Skills: PROGRAMMING ABILITY, PUZZLE SOLVING SKILLS
College Name: IIT INDORE
Motivation: VIBRANT LEARNING ATMOSPHERE AND SMART PEOPLE.
Top trending discussions
Interview questions from similar companies
Interview Questionnaire
10 Questions
- Q1. What do you do when your schedule is interrupted? How you handle it?
- Q2. PreOrder traversal without recursion?
- Ans.
PreOrder traversal without recursion is done using a stack to simulate the function call stack.
Create an empty stack and push the root node onto it.
While the stack is not empty, pop a node from the stack and process it.
Push the right child of the popped node onto the stack if it exists.
Push the left child of the popped node onto the stack if it exists.
- Q3. Build a bst out of the unsorted array by looping over the array and inserting each element to the tree?
- Ans.
Yes
Create an empty binary search tree (BST)
Loop over the unsorted array
For each element, insert it into the BST using the appropriate insertion logic
Repeat until all elements are inserted
The resulting BST will be built from the unsorted array
- Q4. Find 2 elements in array whose sum is equal to given number?
- Ans.
The question asks to find two elements in an array whose sum is equal to a given number.
Iterate through the array and for each element, check if the difference between the given number and the current element exists in the array.
Use a hash set to store the elements as you iterate through the array for efficient lookup.
Return the pair of elements if found, otherwise return a message indicating no such pair exists.
- Q5. How many types of trigger?
- Ans.
There are two types of triggers: DML triggers and DDL triggers.
DML triggers are fired in response to DML (Data Manipulation Language) statements like INSERT, UPDATE, DELETE.
DDL triggers are fired in response to DDL (Data Definition Language) statements like CREATE, ALTER, DROP.
Examples: A DML trigger can be used to log changes made to a table, while a DDL trigger can be used to enforce certain rules when a table is alt
- Q6. Can trigger be used with select statement?
- Ans.
Yes, triggers can be used with select statements in SQL.
Triggers are database objects that are automatically executed in response to certain events, such as insert, update, or delete operations.
While triggers are commonly used with insert, update, and delete statements, they can also be used with select statements.
Using triggers with select statements allows you to perform additional actions or validations before or af...
- Q7. Indexing in mysql? How many types of indexing in mysql?
- Ans.
Indexing in MySQL improves query performance. There are several types of indexing in MySQL.
Indexes are used to quickly locate data without scanning the entire table.
Types of indexing in MySQL include B-tree, hash, full-text, and spatial indexes.
B-tree indexes are the most common and suitable for most use cases.
Hash indexes are used for exact match lookups.
Full-text indexes are used for searching text-based data efficie...
- Q8. Engines in mysql?
- Ans.
Engines in MySQL are the underlying software components that handle storage, indexing, and querying of data.
MySQL supports multiple storage engines, each with its own strengths and features.
Some commonly used engines in MySQL are InnoDB, MyISAM, and Memory.
InnoDB is the default engine in MySQL and provides support for transactions and foreign keys.
MyISAM is known for its simplicity and speed but lacks transaction suppo...
- Q9. Singlton pattern?
- Q10. Can a constructor be private?
- Ans.
Yes, a constructor can be private.
A private constructor can only be accessed within the class itself.
It is often used in singleton design pattern to restrict object creation.
Private constructors are also useful for utility classes that only contain static methods.
Interview Preparation Tips
College Name: na
Skills evaluated in this interview
I appeared for an interview before Dec 2020.
(2 Questions)
Round duration - 120 minutes
Round difficulty - Medium
The Entire Test is held in HackerRank Platform. It has:
2 coding questions (one easy and one medium)
2 output questions(medium)
2 Aptitude(easy)
1 general Computer science(medium)
It took me 30 min for each coding questions. I did not know that general question is related to bash commands.
Tips: Practice the Warmup questions in Hacker Rank.
Do some Basic aptitude questions.
Thorough with the basic C and C++ concepts
- Q1.
Binary Tree to Doubly Linked List
Transform a given Binary Tree into a Doubly Linked List.
Ensure that the nodes in the Doubly Linked List follow the Inorder Traversal of the Binary Tree.
Input:
The fi... - Ans.
Convert a Binary Tree into a Doubly Linked List following Inorder Traversal.
Perform Inorder Traversal of the Binary Tree to get the nodes in order.
Create a Doubly Linked List by linking the nodes in the order obtained from Inorder Traversal.
Return the head of the Doubly Linked List as the output.
- Q2.
Unique Element in Array
Given an arbitrary array
arrconsisting ofNnon-negative integers where every element appears thrice except for one. Your task is to find the element in the array that appears onl... - Ans.
Find the unique element in an array where every other element appears thrice.
Use XOR operation to find the unique element.
Iterate through the array and XOR each element to find the unique one.
Return the unique element as the answer.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
It's completely around the data structures. The questions are a bit tricky but once u think without any tension u can get through easily. The interviewer is helpful and gives u few hints if u catch them at the right point of time u got it.
Tips: got through Data Structures and Algorithms Made Easy by Narasimha Karumanchi. It's a best book for the interviews.
- Q1.
Binary Tree Traversals Problem Statement
Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...
- Ans.
Implement a function to compute In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.
Parse the input level-order tree elements to construct the binary tree.
Implement recursive functions for In-Order, Pre-Order, and Post-Order traversals.
Return the traversals as lists of lists for each test case.
- Q2.
Delete N Nodes After M Nodes in a Linked List
Given a singly linked list and two integers 'N' and 'M', traverse the linked list to retain 'M' nodes and then delete the next 'N' nodes. Continue this proces...
- Ans.
Traverse a linked list to retain 'M' nodes and then delete the next 'N' nodes, repeating until the end of the list.
Create a function that takes the head of the linked list, 'N', and 'M' as input parameters.
Traverse the linked list, retaining 'M' nodes and deleting the next 'N' nodes in each iteration.
Update the pointers accordingly to skip 'N' nodes after retaining 'M' nodes.
Repeat this process until the end of the lin...
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
The interviewer asked to put everything on the blackboard and write down the code of each and everything.
Question : Explain all the search algorithm you know with space and Time complexities.
Answer : Linear search : It is a sequential search algorithm where the entire array is traversed till the desired element is not found. Time complexity is O(N) and auxiliary space is O(1).
Binary search : In this algorithm, a sorted array is searched by repeatedly dividing the search interval in half.
Steps :
1. Initially the interval covers the whole array.
2. If the value to be searched is less than the item in the middle of the interval, narrow the interval to the lower half. Otherwise, narrow it to the upper half.
3. The process is repeated until the value is found or the interval is empty.
Time complexity is O(log n) and auxiliary space is O(1) in case of iterative implementation.
- Q1.
Maximum Frequency Number Problem Statement
Given an array of integers with numbers in random order, write a program to find and return the number which appears the most frequently in the array.
If multip...
- Ans.
Program to find the number with maximum frequency in an array of integers.
Create a dictionary to store the frequency of each number in the array.
Iterate through the array and update the frequency count in the dictionary.
Find the number with the maximum frequency in the dictionary and return it.
If multiple elements have the same maximum frequency, return the one with the lowest index.
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Housing.com Interview FAQs
Some of the top questions asked at the Housing.com Software Developer interview -
Tell us how to improve this page.
Housing.com Interviews By Designations
- Housing.com Accounts Manager Interview Questions
- Housing.com Software Developer Interview Questions
- Housing.com Software Engineer Interview Questions
- Housing.com Senior Accounts Manager Interview Questions
- Housing.com Associate Product Manager Interview Questions
- Housing.com Front end Engineer Interview Questions
- Housing.com Senior Software Engineer Interview Questions
- Housing.com Software Development Engineer Interview Questions
- Show more
Interview Questions for Popular Designations
- Senior Software Developer Interview Questions
- Associate Software Developer Interview Questions
- Lead Software Engineer Interview Questions
- Software Development Engineer II Interview Questions
- Software Engineer Interview Questions
- Software Development Engineer 1 Interview Questions
- Software Engineer Level 1 Interview Questions
- Java Software Developer Interview Questions
- Show more
Housing.com Software Developer Interview Process
based on 4 interviews
1 Interview rounds
- One-on-one Round
Software Developer Interview Questions from Similar Companies
Fast track your campus placements
Housing.com Software Developer Reviews and Ratings
based on 4 reviews
Rating in categories
|
Senior Accounts Manager
398
salaries
|  ₹4.2 L/yr - ₹12 L/yr |
|
Accounts Manager
236
salaries
| ₹3.5 L/yr - ₹9 L/yr |
|
Team Manager
77
salaries
| ₹5.1 L/yr - ₹16.6 L/yr |
|
Software Development Engineer
63
salaries
| ₹10 L/yr - ₹28.5 L/yr |
|
Key Account Manager
46
salaries
| ₹4.2 L/yr - ₹12 L/yr |
MagicBricks
NoBroker
Udaan
Swiggy
- Home >
- Interviews >
- Housing.com Interview Questions >
- Housing.com Software Developer Interview Questions
