Upload Button Icon Add office photos

Housing.com

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

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

Updated 7 Feb 2022

Top Housing.com Software Engineer Interview Questions and Answers

  • Q1. Subarray Challenge: Largest Equal 0s and 1s Determine the length of the largest subarray within a given array of 0s and 1s, such that the subarray contains an equal numb ...read more
  • Q2. 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 ...read more
  • Q3. Connect Nodes at the Same Level Given a binary tree where each node has at most two children, your task is to connect all adjacent nodes at the same level. You should po ...read more
View all 34 questions

Housing.com Software Engineer Interview Experiences

6 interviews found

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

  • Answered by AI
  • 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.

  • Answered by AI
  • 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

  • Answered by AI
  • 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

  • Answered by AI
  • 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.

  • Answered by AI
  • 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...

  • Answered by AI
  • 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 ...

  • Answered by AI

Interview Preparation Tips

Round: Resume Shortlist
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

I was interviewed before Feb 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical round with questions based on data structures and algorithms.

  • Q1. 

    Count Inversions Problem Statement

    Given an integer array ARR of size N, your task is to find the total number of inversions that exist in the array.

    An inversion is defined for a pair of integers in the...

  • Ans. 

    Count the total number of inversions in an integer array.

    • Iterate through the array and for each pair of indices, check if the conditions for inversion are met.

    • Use a nested loop to compare each pair of elements in the array.

    • Keep a count of the inversions found and return the total count at the end.

  • Answered by AI
  • Q2. 

    Add Two Numbers Represented as Linked Lists

    Given two linked lists representing two non-negative integers, where the digits are stored in reverse order (i.e., starting from the least significant digit to ...

  • Ans. 

    Add two numbers represented as linked lists in reverse order and return the sum as a linked list.

    • Traverse both linked lists simultaneously while keeping track of carry.

    • Create a new linked list to store the sum digits.

    • Handle cases where one list is longer than the other.

    • Remember to consider the carry in the last step of addition.

  • Answered by AI
  • Q3. 

    Connect Nodes at the Same Level

    Given a binary tree where each node has at most two children, your task is to connect all adjacent nodes at the same level. You should populate each node's 'next' pointer t...

  • Ans. 

    Connect adjacent nodes at the same level in a binary tree by populating each node's 'next' pointer.

    • Traverse the tree level by level using a queue.

    • For each node, connect it to the next node in the queue.

    • If there is no next node, set the 'next' pointer to NULL.

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical round with questions based on data structures and algorithms.

  • Q1. 

    Word Ladder Problem Statement

    Given two strings, BEGIN and END, along with an array of strings DICT, determine the length of the shortest transformation sequence from BEGIN to END. Each transformation inv...

  • Ans. 

    The Word Ladder problem involves finding the shortest transformation sequence from one word to another by changing one letter at a time.

    • Use breadth-first search to find the shortest transformation sequence.

    • Create a graph where each word is a node and edges connect words that differ by one letter.

    • Keep track of visited words to avoid cycles and optimize the search process.

    • Return -1 if no transformation sequence is possib...

  • Answered by AI
  • Q2. 

    Ninja and Sorted Array Merging Problem

    Ninja is tasked with merging two given sorted integer arrays ARR1 and ARR2 of sizes 'M' and 'N', respectively, such that the merged result is a single sorted array w...

  • Ans. 

    Merge two sorted arrays into one sorted array within the first array.

    • Create a pointer for the end of each array to compare and merge elements.

    • Start from the end of the first array and compare elements from both arrays to merge.

    • Continue merging elements until all elements from the second array are merged into the first array.

  • Answered by AI
  • Q3. 

    Count Ways to Reach the N-th Stair Problem Statement

    You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or tw...

  • Ans. 

    The problem involves determining the number of distinct ways to climb from the 0th to the Nth stair, with the ability to climb one or two steps at a time.

    • Use dynamic programming to solve this problem efficiently.

    • Consider the base cases where N=0 and N=1 separately.

    • For N>1, the number of ways to reach the Nth stair is the sum of the number of ways to reach the (N-1)th stair and the number of ways to reach the (N-2)th...

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical round with questions based on data structures and algorithms.

  • Q1. 

    Shortest Bridge Problem Statement

    Two characters, Tony Stark and Thanos, reside on two separate islands within a 2-D binary matrix of dimensions N x M. Each matrix cell has a value of either 1 (land) or 0...

  • Ans. 

    The task is to find the shortest path of transformed 0s that connects two islands in a 2-D binary matrix.

    • Identify the two islands in the matrix as distinct connected components of 1s.

    • Construct a bridge by converting some 0s to 1s to connect the two islands.

    • Output the minimal length of the bridge needed to connect the two islands for each test case.

  • Answered by AI
  • Q2. 

    Overlapping Intervals Problem Statement

    You are given the start and end times of 'N' intervals. Write a function to determine if any two intervals overlap.

    Note:

    If an interval ends at time T and anothe...

  • Ans. 

    Determine if any two intervals overlap based on start and end times.

    • Iterate through intervals and check for any overlapping intervals

    • Consider edge cases where intervals end and start at the same time

    • Return true if any two intervals overlap, otherwise false

  • Answered by AI
  • Q3. 

    Fixing a Swapped Binary Search Tree

    Given a Binary Search Tree (BST) where two nodes have been swapped by mistake, your task is to restore or fix the BST without changing its structure.

    Input:

    The first...
  • Ans. 

    Restore a Binary Search Tree by fixing two swapped nodes without changing its structure.

    • Identify the two swapped nodes by performing an inorder traversal of the BST.

    • Swap the values of the two identified nodes.

    • Perform another inorder traversal to restore the BST structure.

    • Ensure no extra space is used other than the recursion stack.

  • Answered by AI
Round 4 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

Technical round with questions based on System design and data structures and algorithms.

  • Q1. How would you implement a Ctrl+F (find) functionality in a file?
  • Ans. 

    Implement Ctrl+F functionality in a file using string search algorithms.

    • Read the file content into a string variable

    • Implement a string search algorithm like Knuth-Morris-Pratt or Boyer-Moore

    • Allow user input for the search query and display the results

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAHousing.com interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Software Engineer Interview Questions Asked at Other Companies

asked in Qualcomm
Q1. Bridge and torch problem : Four people come to a river in the nig ... read more
asked in Capgemini
Q2. In a dark room,there is a box of 18 white and 5 black gloves. You ... read more
asked in TCS
Q3. Find the Duplicate Number Problem Statement Given an integer arra ... read more
Q4. Tell me something about yourself. Define encapsulation. What is i ... read more
asked in Paytm
Q5. Puzzle : 100 people are standing in a circle .each one is allowed ... read more

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

  • Answered by AI
  • 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...

  • Answered by AI
  • 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

  • Answered by AI
  • 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

  • Answered by AI
  • Q8. 2 puzzles(josephus and 10 bags with 10 coins each)
  • Q9. NodeJS

Interview Preparation Tips

Round: Resume Shortlist
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 Preparation Tips

Round: Interview
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

Housing.com interview questions for designations

 Senior Software Engineer

 (2)

 Software Development Engineer

 (2)

 Software Development Engineer III

 (1)

 Software Developer

 (8)

 SDE (Software Development Engineer)

 (1)

 Devops Engineer

 (1)

 QA Engineer

 (1)

 Front end Engineer

 (2)

I was interviewed before Feb 2021.

Round 1 - Face to Face 

(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 Problem Statement

    You are provided with an array of integers 'ARR' consisting of 'N' elements. Each integer is within the range [1, N-1], and the array contains exactly one duplica...

  • Ans. 

    Find the duplicate element in an array of integers.

    • Iterate through the array and keep track of seen elements using a set or hashmap.

    • If an element is already in the set, it is the duplicate element.

    • Return the duplicate element once found.

  • Answered by AI
Round 2 - Face to Face 

(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 Numbers

    You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...

  • Ans. 

    Calculate the total sum of all root to leaf paths in an arbitrary binary tree.

    • Traverse the tree from root to leaf nodes, keeping track of the current path sum.

    • Add the current node value to the path sum and multiply by 10 for each level.

    • When reaching a leaf node, add the final path sum to the total sum.

    • Return the total sum modulo (10^9 + 7) as the final result.

  • Answered by AI
  • Q2. 

    Subarray Challenge: Largest Equal 0s and 1s

    Determine the length of the largest subarray within a given array of 0s and 1s, such that the subarray contains an equal number of 0s and 1s.

    Input:

    Input beg...

  • Ans. 

    Find the length of the largest subarray with equal number of 0s and 1s in a given array.

    • Iterate through the array and maintain a count of 0s and 1s encountered so far.

    • Store the count difference in a hashmap with the index as key.

    • If the same count difference is encountered again, the subarray between the two indices has equal 0s and 1s.

  • Answered by AI
  • Q3. 

    The Skyline Problem

    Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette when viewed from a distance. Each building is ...

  • Ans. 

    Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette.

    • Iterate through the buildings and create a list of critical points (x, y) where the height changes.

    • Sort the critical points based on x-coordinate and process them to form the skyline.

    • Merge consecutive horizontal segments of equal height into one to ensure no duplicates.

    • Return the fin...

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 20 minutes
Round difficulty - Easy

Only one coding question was asked with time limit of 10 minutes

  • Q1. 

    Word Break Problem Statement

    You are provided with a continuous non-empty string (referred to as 'sentence') which contains no spaces and a dictionary comprising a list of non-empty strings (known as 'wor...

  • Ans. 

    Given a dictionary of words and a continuous string, generate all possible sentences by inserting spaces.

    • Iterate through the continuous string and check all possible substrings to see if they are in the dictionary.

    • Use recursion to generate all possible sentences by inserting spaces at different positions.

    • Return the valid sentences formed using the words from the dictionary.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Delhi Technological University. Eligibility criteriaAbove 7 CGPAHousing.com interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Get interview-ready with Top Housing.com Interview Questions

I was interviewed before Feb 2021.

Round 1 - Face to Face 

(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. What are the different attributes of the CSS position property?
  • Ans. 

    The CSS position property defines the positioning method of an element.

    • Static: Default position, elements are positioned according to the normal flow of the document.

    • Relative: Positioned relative to its normal position.

    • Absolute: Positioned relative to the nearest positioned ancestor.

    • Fixed: Positioned relative to the viewport, does not move when the page is scrolled.

    • Sticky: Acts like a combination of relative and fixed

  • Answered by AI
  • Q2. What are the data types that SassScript supports?
  • Ans. 

    SassScript supports data types like numbers, strings, colors, booleans, lists, and maps.

    • Numbers: Can be integers or decimals, with or without units (e.g. 10, 2.5px)

    • Strings: Can be enclosed in single or double quotes (e.g. 'Hello', "World")

    • Colors: Represented in various formats like hex, RGB, or named colors (e.g. #FF0000, rgb(255, 0, 0), red)

    • Booleans: Represented as true or false values

    • Lists: Ordered collection of valu...

  • Answered by AI
  • Q3. What are Grunt modules or plugins?
  • Ans. 

    Grunt modules or plugins are extensions that provide additional functionality to the Grunt task runner.

    • Grunt modules or plugins are used to automate tasks in web development.

    • They can be used for tasks like minification, compilation, unit testing, etc.

    • Examples of Grunt plugins include grunt-contrib-uglify for minifying JavaScript files and grunt-sass for compiling Sass files.

  • Answered by AI
  • Q4. What is the difference between Sockets and Ajax?
  • Ans. 

    Sockets allow real-time bidirectional communication between client and server, while Ajax enables asynchronous communication for updating parts of a web page without reloading.

    • Sockets provide a continuous connection for real-time data exchange, while Ajax makes asynchronous requests to update specific parts of a web page.

    • Sockets are commonly used in applications requiring real-time updates like chat applications, onlin...

  • Answered by AI
Round 2 - Face to Face 

(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. How does a server work?
  • Ans. 

    A server is a computer or software that provides functionality for other programs or devices, typically over a network.

    • A server receives requests from clients and processes them to provide the requested services or data.

    • Servers can host websites, store files, manage databases, or perform other specialized tasks.

    • Examples of servers include web servers like Apache or Nginx, database servers like MySQL or PostgreSQL, and ...

  • Answered by AI
  • Q2. What is the difference between a function expression and a function declaration?
  • Ans. 

    Function expression is assigned to a variable, while function declaration is hoisted to the top of the scope.

    • Function expression is not hoisted, while function declaration is hoisted.

    • Function expression can be anonymous, while function declaration must have a name.

    • Function expression can be assigned to a variable, while function declaration cannot.

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 30 minutes
Round difficulty - Easy

This was a puzzle round. 2 puzzles were given to solve .

  • Q1. You have a bag of coins, and you need to determine which coins are of different denominations. What strategy would you use to identify the coins?
  • Ans. 

    Use a combination of weighing and counting to identify coins of different denominations.

    • Separate coins by weight to identify different denominations (e.g. pennies, nickels, dimes, quarters)

    • Count the number of each denomination to confirm the identification

    • Use a scale to measure weight differences between coins

  • Answered by AI
  • Q2. The Josephus problem is a theoretical problem related to a certain counting-out game. In this problem, a group of people stands in a circle and every k-th person is eliminated until only one person remains...

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAHousing.com interview preparation:Topics to prepare for the interview - Node JS, Javascript, CSS, Angular JS, PuzzlesTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview questions from similar companies

Interview Questionnaire 

10 Questions

  • Q1. General question on database
  • Q2. Few algorithm based questions
  • Q3. Detailed discussion about my projects
  • Q4. Discussion on my projects
  • Q5. Three or four puzzles
  • Q6. Few dynamic programming problems
  • Q7. One sorting based questions
  • Q8. What is the most important thing you are taking with you from IIT Kgp?
  • Ans. 

    The importance of problem-solving skills and teamwork.

    • Developed problem-solving skills through challenging coursework and projects.

    • Collaborated with diverse teams to complete group projects.

    • Participated in hackathons and coding competitions to enhance skills.

    • Learned to manage time effectively and prioritize tasks.

    • Developed a strong work ethic and dedication to excellence.

  • Answered by AI
  • Q9. What do you know about commonfloor?
  • Ans. 

    CommonFloor is a real estate platform that helps people find and rent/buy properties.

    • CommonFloor was founded in 2007 and is based in Bangalore, India.

    • It offers a range of services including property listings, property management, and home loans.

    • The platform has over 5 million registered users and lists properties in over 200 cities in India.

    • In 2016, CommonFloor was acquired by Quikr, another Indian online classifieds p

  • Answered by AI
  • Q10. Detailed discussion on all my projects

Interview Preparation Tips

Round: Test
Experience: Multiple choice questions were not that difficult, mostly on database and operating system. Coding question was good and i think that made the whole difference , it was on graph theory (distance between two nodes).
Tips: In general prepare all the concepts of Dynamic programming for the tests during placements not only for commonfloor they are the most generally asked questions.
Duration: 60 minutes
Total Questions: 6

Round: Technical Interview
Experience: I stuck in one of the database question , but my knowledge on my project and algorithm was good , finally they remarked me with good technical knowledge.
Tips: Prepare your projects ,i think that is most vital part in your selection . I had friends who had good technical knowledge but didn't prepare there projects well they had to face failure at many places because of that.

Round: Technical Interview
Experience: This round of mine i think was flawless i answered every questions. Step by step discussion with the panel on every question presented my point well .
Tips: Try to discuss your every doubt with interviewer about the questions and even if don't know the answer try to solve the problem interviewer will help you .

Round: HR Interview
Experience: I didn't prepare the HR question so i was bit scared before the interview but i gone with the flow and answered all the questions as i actually felt . I had good knowledge on all my projects so i had no problem there.
Tips: Prepare the hr questions because i n many interviews it could have made the difference i was shortlisted in VISA and i think finally hr round made the difference. All the above rounds were elimination.

General Tips: Be focused every time , placement time in IIT can be very difficult . Don't get depressed if you don't get selected there are lot of companies.
Skills: Database, Algorithm, Operating System, C, C++ , JAVA
College Name: IIT KHARAGPUR
Funny Moments: I did not slept for 3 days because of the schedule , my three test gone bad because of that.

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via LinkedIn and was interviewed in Jan 2023. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Coding Test 

It was 2 coding questions of medium level

Round 3 - Technical 

(2 Questions)

  • Q1. Longest substring with non repeating characters
  • Ans. 

    Find the longest substring in a given string that does not contain 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 start and end indices of the window to find the longest substring.

    • Return the length of the longest substring.

  • Answered by AI
  • Q2. Candy problem. There is similar question in geeks for geeks

Interview Preparation Tips

Interview preparation tips for other job seekers - Keep practising data structures and algorithms. Do some projects

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Aug 2022. There were 5 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Coding Test 

There were 2 questions to test our basic coding knowledge.

Round 3 - One-on-one 

(1 Question)

  • Q1. Some basic introduction followed by sort 2 arrays into a single array.
Round 4 - One-on-one 

(1 Question)

  • Q1. Applications of various data structures.
  • Ans. 

    Data structures are used in various applications like search algorithms, storage systems, and graph algorithms.

    • Search algorithms like binary search use arrays and trees for efficient searching.

    • Storage systems use data structures like hash tables and linked lists for organizing and accessing data.

    • Graph algorithms like Dijkstra's algorithm use graphs and trees for solving complex problems.

  • Answered by AI
Round 5 - HR 

(1 Question)

  • Q1. Some basic hr questions like tell me about yourself, what do you know about magicbricks,where do you see yourself in 5 years etc

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
More than 8 weeks
Result
Selected Selected

I applied via Referral and was interviewed before Mar 2023. There were 2 interview rounds.

Round 1 - Technical 

(1 Question)

  • Q1. JavaScript question
Round 2 - Technical 

(1 Question)

  • Q1. Coding questions
Contribute & help others!
anonymous
You can choose to be anonymous

Housing.com Interview FAQs

What are the top questions asked in Housing.com Software Engineer interview?

Some of the top questions asked at the Housing.com Software Engineer interview -

  1. Given two sides of a river having the same cities labeled in characters. Bridge...read more
  2. Given a set of n steps. A person can climb one or two steps at a time. Find the...read more
  3. Make a set of all nodes that can occur in any path from a source to a destinati...read more

Recently Viewed

JOBS

Browse jobs

Discover jobs you love

DESIGNATION

INTERVIEWS

Housing.com

No Interviews

SALARIES

Housing.com

INTERVIEWS

Housing.com

No Interviews

JOBS

Fractal Analytics

No Jobs

REVIEWS

Intellect Design Arena

No Reviews

INTERVIEWS

C2fo

No Interviews

INTERVIEWS

Infogain

No Interviews

INTERVIEWS

Blinkit

No Interviews

Tell us how to improve this page.

Housing.com Software Engineer Salary
based on 13 salaries
₹11 L/yr - ₹24 L/yr
118% more than the average Software Engineer Salary in India
View more details

Housing.com Software Engineer Reviews and Ratings

based on 1 review

1.0/5

Rating in categories

1.0

Skill development

1.0

Work-life balance

1.0

Salary

1.0

Job security

1.0

Company culture

1.0

Promotions

1.0

Work satisfaction

Explore 1 Review and Rating
Senior Accounts Manager
396 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Accounts Manager
235 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Team Manager
76 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Development Engineer
62 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Key Account Manager
46 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Housing.com with

MagicBricks

3.6
Compare

NoBroker

3.2
Compare

PropTiger.com

4.0
Compare

99acres

3.9
Compare
Did you find this page helpful?
Yes No
write
Share an Interview