Add office photos
Filter interviews by
Housing.com Software Engineer Interview Questions, Process, and Tips
Top Housing.com Software Engineer Interview Questions and Answers
- Q1. Fix BST Given a Binary Search Tree, where exactly two nodes of the same tree were swapped by mistake. The task is to restore or fix the BST, without changing its structur ...read more
- Q2. Find Duplicate in Array You are given an array of integers 'ARR' containing N elements. Each integer is in the range [1, N-1], with exactly one element repeated in the ar ...read more
- Q3. Largest subarray with equal number of 0s and 1s You are given an array consisting of 0s and 1s. You need to find the length of the largest subarray with an equal number o ...read more
Housing.com Software Engineer Interview Experiences
6 interviews found
Som Bose
Interview Questionnaire
15 Questions
- Q1. Given a BST and two positions in a bst exchanged to give a violation in bst rule. Find the two elements and exchange them. Corner case to be considered is that root can also be a node which id exchanged
- Q2. Design a system for Bookmyshow.com. When we book seats we the seats must be locked till the time payment gateway is reached. Also consider no payment done and payment failures. This is a question on state ...
- Q3. Given a set of n steps. A person can climb one or two steps at a time. Find the number of ways in which one can reach the nth step. (Easy stuff.. I probably wasn't doing good by this time)
- Ans.
The number of ways to reach the nth step using 1 or 2 steps at a time.
Use dynamic programming to solve this problem
Create an array to store the number of ways to reach each step
Initialize the first two elements of the array as 1, since there is only one way to reach the first and second steps
For each subsequent step, the number of ways to reach it is the sum of the number of ways to reach the previous two steps
Return t
- Q4. Given an array a1, a2...an. Find all pairs such that ai>aj having i
- Q5. Given many pairs intervals with their start and end. Find the maximum interval which intersects the maximum number of intervals. Look for corner cases again!
- Ans.
Find the maximum interval that intersects the maximum number of intervals.
Sort the intervals based on their start times.
Iterate through the sorted intervals and keep track of the current interval with the maximum number of intersections.
Update the maximum interval whenever a new interval intersects more intervals than the current maximum interval.
- Q6. There was one easy string question.. Dont remember.something on trie data structure
- Q7. Given a string (say alpha) and a dictionary database from where I can find if a word is present in the dictionary by a O(1) time look up. Find if there exists a path from the root word(aplha) to leaf node ...
- Q8. Implement an auto suggest in search engine. Like for google when u type max say maximum must be suggested in drop down. This is a problem on Information Retrieval.
- Q9. Easy one. How to make a linked list with for a number like 12345 must be stored in linked list as 1->2->3->4->5.
- Q10. I dont remember again a question. Was on strings again :P. But easy
- Q11. Implement a ctlr+f (find) functionality in a file. Make a data structure for this implementation
- Ans.
Implement a ctlr+f (find) functionality in a file using a data structure.
Create a data structure to store the file content, such as an array of strings.
Implement a function that takes a search query and returns the matching lines from the file.
Use string matching algorithms like Knuth-Morris-Pratt or Boyer-Moore for efficient searching.
Consider optimizing the data structure for faster search operations, like using a tr
- Q12. Given two sorted arrays find of size n and m. The n sized array has m spaces empty at the end. Code to merge these to arrays in single pass O(n+m).
- Ans.
Merge two sorted arrays with empty spaces at the end in a single pass.
Initialize two pointers at the end of each array
Compare the elements at the pointers and place the larger element at the end of the merged array
Decrement the pointer of the array from which the larger element was taken
Repeat until all elements are merged
- Q13. Given a binary tree. Code to have each node point to the next node in the same level. Last element in the level must point to NULL
- Ans.
The code should traverse the binary tree level by level and update the next pointers accordingly.
Use a queue to perform level order traversal of the binary tree.
For each node, update its next pointer to point to the next node in the queue.
If the current node is the last node in the level, update its next pointer to NULL.
- Q14. Make a set of all nodes that can occur in any path from a source to a destination in both directed as well as undirected graph. Note that a node can be visited any number of times not necessarily only onc...
- Ans.
The set of all nodes that can occur in any path from a source to a destination in both directed and undirected graphs.
Perform a depth-first search (DFS) or breadth-first search (BFS) from the source node to the destination node.
During the search, keep track of all visited nodes.
Add each visited node to the set of nodes that can occur in any path.
Repeat the search for both directed and undirected graphs.
The resulting se...
- Q15. Given two sides of a river having the same cities labeled in characters. Bridges are to be drawn from one side to another that can connect the same labels but the bridges shudnt cross each other. Find the...
- Ans.
The maximum number of bridges that can be connected between two sides of a river without crossing each other.
This is a dynamic programming problem.
Create a 2D array to store the maximum number of bridges that can be connected at each position.
Initialize the first row and column of the array with 0.
Iterate through the sides of the river and compare the labels.
If the labels match, update the value in the array by adding ...
Interview Preparation Tips
Experience: I dont really know what special I did. I just put some start up internship ahead of interns in two well established companies and mentioned my web based projects.
General Tips: Make a cv which is appealing, and highlight some key things regarding web development or algorithms or system development
Skill Tips: Be clear with your basics
Skills: Algorithms, Systems
College Name: IIT KHARAGPUR
Motivation: Interest in Software Engineering
Funny Moments: They started speaking in Hindi after a while. It was very friendly.
Skills evaluated in this interview
CodingNinjas
I was interviewed before Feb 2021.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical round with questions based on data structures and algorithms.
- Q1. Count Inversions
For a given integer array/list 'ARR' of size 'N', find the total number of 'Inversions' that may exist.
An inversion is defined for a pair of integers in the arra...
- Ans.
The idea is to use a method similar to the merge sort algorithm. Like merge sort, divide the given array into two parts. For each left and right half, count the inversions, and at the end, sum up the inversions from both halves to get the resultant inversions.
Algorithm:
1. Divide the array into two equal or almost equal halves in each step until the base case is reached.
2. Create a function merge that counts the n... - Q2. Add Two Numbers As Linked Lists
You are given two linked lists representing two non-negative numbers. The digits in the linked list are stored in reverse order, i.e. starting from least significant digit (...
- Ans.
For every digit in the number, make a new node and attach it to the previous node in the list.
Steps:
1. Run a while loop while the number > 0.
2. Extract digit from the number by num%10 and update number to num%10.
3. Make a new node with its value as the digit and attach it at the end of the list created.
4. Return the head of the list created. - Q3. Connect Nodes at Same Level
A binary tree is a tree where each node has at most two children i.e left child and right child.
You are given a binary tree, where the structure of the node is as follow -:
... - Ans.
Level order traversal can be used to solve this problem. Modify queue entries to store the node and the level of nodes. So, the queue node will contain a pointer to a tree node and an integer level. When we deque a node we can check the level of dequeued node. If it is same, set the right pointer of the node to the front node of the queue.
Time Complexity : O(N)
Space Complexity :O(N)
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical round with questions based on data structures and algorithms.
- Q1. Word Ladder
You are given two strings BEGIN and END and an array of strings DICT. Your task is to find the length of the shortest transformation sequence from BEGIN to END such that in every transformation...
- Ans.
BFS can be used to solve this question.
1. Start from the given start word and push it in queue.
2. Maintain a variable to store the steps needed.
3. Run a loop until the queue is empty :
2.1 Traverse all words that are adjacent (differ by one character) to it and push the word in the queue.
4. Keep doing so until we find the target word or we have traversed all words. Keep Incrementing the ste... - Q2. Ninja and Two Sorted Arrays
Ninja has been given two sorted integer arrays/lists ‘ARR1’ and ‘ARR2’ of size ‘M’ and ‘N’. Ninja has to merge these sorted arrays/lists into ‘ARR1’ as one sorted array. You may...
- Ans.
A simple approach would be to create a new arrays with size as sum of the sizes of both the arrays. Copy the elements of both the arrays in the new array and sort the array.
A space optimized approach also exists. While traversing the two sorted arrays parallelly, if we encounter the jth second array element is smaller than ith first array element, then jth element is to be included and replace some kth element in... - Q3. Count Ways To Reach The N-th Stairs
You have been given a number of stairs. Initially, you are at the 0th stair, and you need to reach the Nth stair. Each time you can either climb one step or two steps. Y...
- Ans.
The question can be approached using recursion. The person can reach nth stair from either (n-1)th stair or from (n-2)th stair. Hence, for each stair n, find out the number of ways to reach n-1th stair and n-2th stair and add them to give the answer for the nth stair. Therefore the expression for such an approach comes out to be : ways(n) = ways(n-1) + ways(n-2)
This is an expression for Fibonacci numbers only, where wa...
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions based on data structures and algorithms.
- Q1. Shortest Bridge
Every story has an Endgame. This is another such story.
Tony Stark and Thanos live in two different islands. Tony wants to reach Thanos's island in minimum time to save the world.
Y...
- Ans.
Concept of Longest Increasing Subsequence can be used in this problem.
Steps:
1. Sort the north-south pairs on the basis of increasing order of south x-coordinates. If two south x-coordinates are same, then sort on the basis of increasing order of north x-coordinates.
2. Now , use LIS to find the Longest Increasing Subsequence of the north x-coordinates. Here, in the increasing subsequence , a value can be greater a - Q2. Overlapping Intervals
You have been given the start and end times of 'N' intervals. Write a function to check if any two intervals overlap with each other.
Note :
If an interval ends at time T an... - Ans.
The brute force approach would be to traverse the array and run a nested loop. For each interval, count the number of intervals it intersects and at last, print the maximum number of intervals that an interval can intersect.
The above approach can be optimized counting the number of intervals that do not intersect. The intervals that do not intersect with a particular interval can be divided into two disjoint categories... - Q3. Fix BST
Given a Binary Search Tree, where exactly two nodes of the same tree were swapped by mistake. The task is to restore or fix the BST, without changing its structure.
A binary search tree (BST), al...
- Ans.
Recursion can be used here. Maintain two pointers, first and second to find the 2 nodes that violate the order. At last, change the values of the two nodes by their value.
PseudoCode :
correctBST(Node root) {
help(root);
swap(first->val, second->val);
}
help(Node root){
if(root is NULL) return;
help(root->left);
if(first is NULL and prev->val >= root->val) first=prev;
if(first is not NULL and prev-&...
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions based on System design and data structures and algorithms.
- Q1. System Design Question
Design a system for Bookmyshow.com. When we book seats we the seats must be locked till the time payment gateway is reached. Also consider no payment done and payment failures.
- Ans.
Tip 1: Firstly, remember that the system design round is extremely open-ended and there’s no such thing as a standard answer. Even for the same question, you’ll have a totally different discussion with different interviewers.
Tip 2:Before you jump into the solution always clarify all the assumptions you’re making at the beginning of the interview. Ask questions to identify the scope of the system. This will clear the in... - Q2. System Design Question
Implement an auto suggest in search engine. Like for google when u type max say maximum must be suggested in drop down.
- Ans.
Tip 1:Before you jump into the solution always clarify all the assumptions you’re making at the beginning of the interview. Ask questions to identify the scope of the system. This will clear the initial doubt, and you will get to know what are the specific detail interviewer wants to consider in this service.
Tip 3 : Design your structure and functions according to the requirements and try to convey your thoughts proper... - Q3. System Design Question
Implement a ctlr+f (find) functionality in a file.
- Ans.
Tip 1: Hash map can be used as a data structure to implement this functionality. According to the type of data stored in the file, a combination of data structures can be used to implement insert() and search() functionality.
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 : Make a cv which is appealing, and highlight some key things regarding web development or algorithms or system development
Tip 2 : Have at-least 2 good projects explained in short with all important points covered.
Skills evaluated in this interview
I was interviewed before Feb 2021.
(4 Questions)
Round duration - 60 minutes
Round difficulty - Easy
This was a technical round with questions on CSS and Node js.
Tip : Have a basic knowledge about : SASS,Susy,Jade,npm,grunt,gulp,yeoman,LibSASS
- Q1. CSS Question
What are the different attributes for CSS position property?
- Ans.
The CSS position property has 4 possible attributes: Static, Relative, Absolute and Fixed.
Static : The default or 'natural' position of block elements on the page.
Relative : Relative to the placement of the element within the flow of the document.
Absolute : Removes the element from the flow of content and allows it to be positioned in relation to the HTML document.
Fixed : Removes elements from the flow of the HTM - Q2. Technical Question
List out the Data Types that SassScript supports?
- Ans.
SassScript supports seven main data types
Numbers ( eg; 1,5 ,10px)
Strings of texts ( g., “foo”, ‘bar’, etc.)
Colors (blue, #04a3f9)
Booleans (true or false)
Nulls (e.g; null)
List of values, separated by space or commas (g., 1.5em, Arial, Helvetica etc.)
Maps from one value to another (g., ( key 1: value1, key 2: Value 2)) - Q3. Technical Question
What are Grunt modules/plugins?
- Ans.
Grunt modules are distributed through Node’s NPM directory. Normally, they are prefixed with grunt- and official grunt plugins are prefixed with grunt-contrib.
- Q4. Technical Question
Difference between Sockets and Ajax
- Ans.
1. The job of web sockets is that it enables client-side JavaScript to open a persistent connection to a server. When web sockets are used, data can be exchanged in the form of a fast message due to this established connection. On the other hand, Ajax enables client-side JavaScript application to make a request to access different server-side resources.
2. Secondly, Ajax can send calls only through the string data type....
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
This was a technical round with questions on Java script, Web Fundamentals etc.
Tip : Have knowledge about Closures,Prototypes,Function/variable hoisting,prototypal inheritance,modular pattern,JSONP,this etc
- Q1. Technical Question
How does the server work?
- Ans.
The web browser requests a specific web page – looking for the correct IP address associated with that domain.
The web browser requests a full URL for the site it wants to display – sending this information over to the server.
The web server finds and assembles all the information needed to display the site – including things like ads, dynamic elements, content and more. The server then sends this complete package of inf... - Q2. Technical Question
Difference between function expression and function declaration
- Ans.
1. A function declaration must have a function name. A function Expression is similar to a function declaration without the function name.
2. Function declaration does not require a variable assignment. Function expressions can be stored in a variable assignment.
3.Function declarations are executed before any other code. Function expressions load and execute only when the program interpreter reaches the line of code.
4. ...
(2 Questions)
Round duration - 30 minutes
Round difficulty - Easy
This was a puzzle round. 2 puzzles were given to solve .
- Q1. Puzzle
Bag of Coins
- Ans.
There is only one bag with forgeries. Ishita can use a simple approach to locate that bag. She must take one coin from the first bag, two coins from the second bag, three coins from the third bag, and ten coins from the tenth bag. She should now just add the weights of all the coins she has chosen.
If there are no forgeries, the total weight should be 55 grams (1+2+3+... +10). If the total weight is 55.3, she can safely... - Q2. Puzzle
Josephus problem
- Ans.
Let f(n,k) denote the position of the survivor. After the kth person is killed, we're left with a circle of n-1, and we start the next count with the person whose number in the original problem was (k mod n)+1. The position of the survivor in the remaining circle would be f(n-1,k), if we start counting at 1; shifting this to account for the fact that we're starting at (k mod n)+1 yields the recurrence
f(n, k) = ((f(n-1,
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
What people are saying about Housing.com
I was interviewed before Feb 2021.
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
Resume based and 1 coding question. Briefly discussed about projects in resume and questions were completely related to projects mentioned.
- Q1. Find Duplicate in Array
You are given an array of integers 'ARR' containing N elements. Each integer is in the range [1, N-1], with exactly one element repeated in the array.
Your task is to find...
- Ans.
Concept of indexing can be used to solve this question.
Traverse the array. For every element at index i,visit a[i]. If a[i] is positive, then change it to negative. If a[i] is negative, it means the element has already been visited and thus it is repeated. Print that element.
Pseudocode :
findRepeating(arr[], n)
{
missingElement = 0
for (i = 0; i < n; i++){
element = arr[abs(arr[i])]
if(element < 0){
missingElement = arr...
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
This round was completely pen and paper coding round. 3 coding questions were asked.
- Q1. Sum root to leaf
You are given an arbitrary binary tree consisting of N nodes where each node is associated with a certain integer value from 1 to 9. Consider each root to leaf path as a number.
For exam...
- Ans.
This can be solved using recursion. The basic idea is to subtract the value of current node from sum until it reaches a leaf node and the subtraction equals 0, then we know that we got a hit. Keep checking for left or right child path sum equal to target sum – value at current node.
Time Complexity : O(N) - Q2. Largest subarray with equal number of 0s and 1s
You are given an array consisting of 0s and 1s. You need to find the length of the largest subarray with an equal number of 0s and 1s.
For example:
If the... - Ans.
The brute force approach would be to consider every possible subarray within the given array and count the number of zeros and ones in each subarray. Then, find out the maximum size subarray with equal no. of zeros and ones out of them.
Time Complexity: O(N^2)
To optimise the above approach, the concept of hashing can be used. If we consider 1 in array to be +1 and 0 to be -1, and while traversing the array maintain a va... - Q3. The Skyline Problem
You are given 'N' rectangular buildings in a 2-dimensional city. Your task is to compute the skyline of these buildings, eliminating hidden lines return the skyline formed by th...
- Ans.
The idea here is to first, sort the critical POINTS with respect to their coordinate and height pairs. Make a pair of 'X1' and take a negative of the height for the building so that 'X1' pairs are sorted before 'X2' pairs. Create a dictionary keeping the heights as keys and as soon as a left edge of a building is encountered, we add that building to the dictionary with its height as the key. When we encounter the right...
(1 Question)
Round duration - 20 minutes
Round difficulty - Easy
Only one coding question was asked with time limit of 10 minutes
- Q1. Word Break-1
You are given a non-empty string containing no spaces (say sentence) and a dictionary of list of non-empty strings (say the list of words). You are supposed to construct and return all possibl...
- 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.
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 : Make a cv which is appealing, and highlight some key things regarding web development or algorithms or system development.
Tip 2 : Have at-least 2 good projects explained in short with all important points covered.
Skills evaluated in this interview
Housing.com interview questions for designations
Interview Preparation Tips
Experience: It was a Skype interview. Was questioned on general HR questions and a few technical questions based on coding.
General Tips: Basic knowledge in coding and android development software is definitely helpful.
Will be a good idea to take a course on GIS.
Skills: Coding , Android Development
College Name: IIT MADRAS
Get interview-ready with Top Housing.com Interview Questions
Interview Questionnaire
9 Questions
- Q1. Use of position relative,absolute,fixed and static
- Ans.
Position property in CSS
position: static is the default value
position: relative is relative to its normal position
position: absolute is relative to the nearest positioned ancestor
position: fixed is relative to the viewport
- Q2. AngularJS related questions(basic)
- Q3. SASS,Susy,Jade,npm,grunt,gulp,yeoman,LibSASS (just basic knowledge about them)
- Q4. Sockets vs Ajax
- Ans.
Sockets and Ajax are both used for real-time communication, but sockets are more efficient for continuous data transfer.
Sockets provide a persistent connection between client and server, while Ajax uses HTTP requests.
Sockets are faster and more efficient for real-time data transfer.
Ajax is better suited for occasional data updates or small amounts of data.
Examples of socket-based applications include chat rooms and onl...
- Q5. Why use node?
- Ans.
Node is a popular server-side JavaScript runtime environment.
Node is fast and efficient for handling I/O operations.
It has a large and active community with a vast number of modules available.
Node allows for easy scalability and can handle a large number of concurrent connections.
It is cross-platform and can run on various operating systems.
Node is commonly used for building real-time applications, APIs, and microservi
- Q6. Javascript(Closures,Prototypes,Function/variable hoisting,Function expression vs function declaration,prototypal inheritance,modular pattern,JSONP,this)
- Q7. How the server works?
- Ans.
A server is a computer program that provides services to other computer programs or clients over a network.
A server listens for incoming requests from clients
It processes the requests and sends back the response
Servers can be dedicated or shared
Examples include web servers, email servers, and file servers
- Q8. 2 puzzles(josephus and 10 bags with 10 coins each)
- Q9. NodeJS
Interview Preparation Tips
Experience: The shortlist was based on resume (mainly on projects and knowledge/not much focus on CGPA).
College Name: IIT-ROORKEE
Skills evaluated in this interview
Interview questions from similar companies
I applied via LinkedIn and was interviewed in Oct 2024. There was 1 interview round.
(2 Questions)
- Q1. Find the missing smallest positive integer
- Ans.
Find the missing smallest positive integer in an array of integers
Sort the array to easily identify missing integers
Iterate through the sorted array to find the smallest missing positive integer
Return the missing integer
- Q2. Given an array of 0,1,2, Sort the array
- Ans.
Sort an array of strings containing only 0, 1, and 2.
Use a three-way partitioning algorithm like Dutch National Flag algorithm to sort the array in a single pass.
Keep track of three pointers - low, mid, and high to partition the array into three sections.
Swap elements based on their values to achieve the sorted array.
Skills evaluated in this interview
I applied via campus placement at Maulana Azad National Institute of Technology (NIT), Bhopal and was interviewed in Jul 2024. There were 2 interview rounds.
3 questions easy-medium level leetcode problem I solved 2 completely and 3rd question partially (9/15 test cases passed) to move on to 2nd round
(1 Question)
- Q1. Implement an app similar to splitwise
(2 Questions)
- Q1. Find the leaves of the tree.
- Ans.
Leaves of a tree are the nodes with no children in a tree data structure.
Traverse the tree and identify nodes with no children.
Use depth-first search or breadth-first search algorithms to find leaves.
Examples: In a binary tree, leaves are nodes with no left or right child.
In a general tree, leaves are nodes with no children in their child list.
- Q2. Find the LCA of tree.
- Ans.
The Lowest Common Ancestor (LCA) of a tree is the shared ancestor of two nodes farthest from the root.
Start from the root and traverse the tree to find the paths from the root to the two nodes.
Compare the paths to find the last common node between them, which is the LCA.
If one of the nodes is an ancestor of the other, then the ancestor node is the LCA.
(2 Questions)
- Q1. What projects you worked upon?
- Ans.
I have worked on projects involving web development, mobile app development, and data analysis.
Developed a web application using React and Node.js for a client in the e-commerce industry
Created a mobile app using Flutter for a startup in the healthcare sector
Performed data analysis on customer behavior using Python and SQL for a marketing company
- Q2. What internships you did?
- Ans.
I completed internships at ABC Company and XYZ Company during my undergraduate studies.
Interned at ABC Company working on web development projects
Interned at XYZ Company assisting with software testing and quality assurance
Gained hands-on experience in coding, debugging, and problem-solving
Interview Preparation Tips
Skills evaluated in this interview
Ankit Patra
I applied via Company Website and was interviewed in Nov 2024. There was 1 interview round.
1. PEAK ELEMENT QUESTION.
2. COIN DENOMINATION
Housing.com Interview FAQs
Some of the top questions asked at the Housing.com Software Engineer 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 Associate Product Manager Interview Questions
- Housing.com Senior Accounts Manager Interview Questions
- Housing.com Assistant Manager Operations Interview Questions
- Housing.com Front end Engineer Interview Questions
- Housing.com Senior Software Engineer Interview Questions
- Show more
Interview Questions for Popular Designations
- Senior Software Engineer Interview Questions
- Associate Software Engineer Interview Questions
- Softwaretest Engineer Interview Questions
- Software Engineer Trainee Interview Questions
- Software Developer Intern Interview Questions
- Software Developer Interview Questions
- Software Development Engineer Interview Questions
- Junior Software Developer Interview Questions
- Show more
Top Skills for Housing.com Software Engineer
Software Engineer Interview Questions from Similar Companies
Fast track your campus placements
Housing.com Software Engineer Reviews and Ratings
based on 1 review
Rating in categories
|
Senior Accounts Manager
440
salaries
|  ₹4.2 L/yr - ₹12.5 L/yr |
|
Accounts Manager
222
salaries
| ₹3.5 L/yr - ₹8.8 L/yr |
|
Team Manager
73
salaries
| ₹8 L/yr - ₹17 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
PropTiger.com
99acres
Calculate your in-hand salary
- Home >
- Interviews >
- Housing.com Interview Questions >
- Housing.com Software Engineer Interview Questions
