Upload Button Icon Add office photos

Housing.com

Compare button icon Compare button icon Compare

Filter interviews by

Housing.com Interview Questions and Answers for Freshers

Updated 14 May 2025
Popular Designations

17 Interview questions

An Assistant Manager Operations was asked
Q. How many Nike shoes are sold in India during the sale season?
Ans. 

The number of Nike shoes sold in India during sale season is not available.

  • Data on the number of Nike shoes sold in India during sale season is not provided.

  • The exact number of Nike shoes sold during sale season can vary each year.

  • Sales data for Nike shoes in India during sale season is not publicly available.

View all Assistant Manager Operations interview questions
An Assistant Manager Operations was asked
Q. How do you think rental real estate works in India?
Ans. 

Rental real estate in India is a thriving market with high demand and various factors influencing its functioning.

  • Rental real estate in India is driven by factors such as location, property type, and market demand.

  • The rental market in India is highly competitive, especially in major cities like Mumbai, Delhi, and Bangalore.

  • Property owners can earn rental income by leasing out residential or commercial properties.

  • R...

View all Assistant Manager Operations interview questions
An Assistant Manager Operations was asked
Q. How do you think financial markets impact real estate?
Ans. 

Financial markets have a significant impact on real estate by influencing interest rates, investment flows, and property values.

  • Interest rates: Changes in interest rates affect mortgage rates, making it more or less affordable for individuals to buy homes.

  • Investment flows: Investors often allocate funds between financial markets and real estate, impacting property prices and demand.

  • Property values: Economic condit...

View all Assistant Manager Operations interview questions
A Software Engineer was asked
Q. Implement a find functionality (similar to Ctrl+F) in a file. What data structure would you use 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...

View all Software Engineer interview questions
A Software Engineer was asked
Q. Create a set of all nodes that can occur in any path from a source to a destination in both directed and undirected graphs. Note that a node can be visited any number of times, not necessarily only once.
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 resulti...

View all Software Engineer interview questions
A Software Engineer was asked
Q. Given two sides of a river having the same cities labeled in characters, find the maximum number of non-crossing bridges that can be connected between the same labels on opposite sides. For example, Side 1:...
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 ad...

View all Software Engineer interview questions
A Software Engineer was asked
Q. Given a binary tree, write code to have each node point to the next node in the same level. The 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.

View all Software Engineer interview questions
Are these interview questions helpful?
A Software Engineer was asked
Q. Given two sorted arrays of size n and m, where the n sized array has m empty spaces at the end, write code to merge these two arrays in a single pass with O(n+m) time complexity.
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

View all Software Engineer interview questions
A Software Engineer was asked
Q. 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.
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

  • Ret...

View all Software Engineer interview questions
A Software Engineer was asked
Q. Given many pairs of intervals with their start and end, find the interval that intersects the maximum number of other intervals. Consider corner cases.
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.

View all Software Engineer interview questions

Housing.com Interview Experiences for Freshers

5 interviews found

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

I applied via Campus Placement and was interviewed in Jul 2023. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Don’t add your photo or details such as gender, age, and address in your resume. These details do not add any value.
View all tips
Round 2 - Aptitude Test 

Mmmmmmmmmmmmmmmmmmmmmmmmmmmmmmm

Round 3 - One-on-one 

(5 Questions)

  • Q1. Introduce yourself
  • Q2. Y should we hire you
  • Q3. Share ahout your working experience
  • Q4. About internship
  • Q5. About family background

Interview Preparation Tips

Interview preparation tips for other job seekers - be prepare for what youmention in resume

Intern Interview Questions & Answers

user image Anonymous

posted on 11 Feb 2021

I applied via Walk-in and was interviewed before Feb 2020. There was 1 interview round.

Interview Questionnaire 

2 Questions

  • Q1. What is your work experience?
  • Q2. What is your qualification?

Interview Preparation Tips

Interview preparation tips for other job seekers - Be precise

I appeared for an interview before May 2016.

Interview Questionnaire 

6 Questions

  • Q1. How do you think does the rental real estate work in India
  • Ans. 

    Rental real estate in India is a thriving market with high demand and various factors influencing its functioning.

    • Rental real estate in India is driven by factors such as location, property type, and market demand.

    • The rental market in India is highly competitive, especially in major cities like Mumbai, Delhi, and Bangalore.

    • Property owners can earn rental income by leasing out residential or commercial properties.

    • Rent a...

  • Answered by AI
  • Q2. Case Study 1: How many women travel in a Delhi metro line on a Saturday
  • Ans. 

    The exact number of women traveling in a Delhi metro line on a Saturday is not available.

    • The Delhi metro authorities do not provide real-time data on the number of women passengers.

    • The number of women traveling on a Saturday can vary depending on various factors such as time of day, specific metro line, and events happening in the city.

    • To determine the exact number, a survey or data collection process would be required...

  • Answered by AI
  • Q3. Case Study 2: How many Nike shoes get sold in India during sale season
  • Ans. 

    The number of Nike shoes sold in India during sale season is not available.

    • Data on the number of Nike shoes sold in India during sale season is not provided.

    • The exact number of Nike shoes sold during sale season can vary each year.

    • Sales data for Nike shoes in India during sale season is not publicly available.

  • Answered by AI
  • Q4. How do you think financial markets impact real estate
  • Ans. 

    Financial markets have a significant impact on real estate by influencing interest rates, investment flows, and property values.

    • Interest rates: Changes in interest rates affect mortgage rates, making it more or less affordable for individuals to buy homes.

    • Investment flows: Investors often allocate funds between financial markets and real estate, impacting property prices and demand.

    • Property values: Economic conditions ...

  • Answered by AI
  • Q5. Long term vision
  • Q6. Questions on organizational skills, communication skills, pressure management, team worker or not, salary expectations, preferred date of joining

Interview Preparation Tips

Round: Technical Interview
Experience: It was a 1 hour long interview with questions on educational background, my understanding of real estate market, soft skills (skill set needed to solve a crisis situation and lead a team) and analytical abilities (case studies and judgement on various hypothetical events to test decision-making abilities.
Tips: - Be honest
- Think smart
-Take a few seconds before responding to a question so that you dont end up rambling
- Ask the interviewer a questions; shows your interest in knowing about the company
- Know beforehand about the company and the sector in which it falls
- Practice a few case studies because one can really go wrong under pressure; Do not be concerned about the right answer, have the right approach
- Take the interview as an interaction than a formal discussion to ease out the pressure
- Be completely thorough with your resume and have an anecdote/incidence ready in your head for all the major points you have mentioned in the resume
- Be aware of what you want to do in the long term- dont be blank when you are asked about your long term vision

Round: HR Interview
Experience: This was any basic HR round where the interviewer mainly checks if the person will fit in the organization's culture or not
Tips: -Talk about how you like working and leading a team
- Give examples of all the ECA you have done in college
- Be sporty, relaxed and honest in terms of your salary expectation

Software Developer Interview Questions & Answers

user image Ankit Silaich

posted on 24 Mar 2015

Interview Preparation Tips

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

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
  • Ans. 

    Identify and correct two swapped nodes in a Binary Search Tree (BST) to restore its properties.

    • In a BST, for any node, left children are smaller and right children are larger.

    • Perform an in-order traversal to identify the two swapped nodes.

    • During traversal, keep track of the previous node to find violations.

    • Example: For BST [4, 2, 6, 1, 3, 5, 7], if 1 and 6 are swapped, in-order gives [6, 2, 4, 1, 3, 5, 7].

    • Swap the iden...

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

    Design a seat booking system that locks seats until payment is confirmed, handling failures and timeouts effectively.

    • Implement a state machine with states: Available, Locked, Paid, and Cancelled.

    • When a user selects seats, transition from Available to Locked state.

    • Set a timer for the payment process; if payment is not completed in time, transition to Available.

    • Handle payment failures by transitioning from Locked to Avai...

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

    Find all pairs (i, j) in an array where ai > aj and i < j using an efficient nlogn approach.

    • Use a modified merge sort to count inversions while sorting the array.

    • During the merge step, count how many elements from the right half are less than the current element from the left half.

    • Example: For array [3, 1, 2], pairs are (3, 1), (3, 2), (2, 1).

    • The algorithm runs in O(n log n) time complexity.

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

    Check if a path exists from a word to a single letter by removing one letter at a time, ensuring all intermediate words are valid.

    • Use a recursive function to explore all possible paths by removing one letter at a time.

    • Utilize a set for the dictionary for O(1) lookups.

    • Base case: If the current word is a single letter and exists in the dictionary, return true.

    • Example: For 'alpha', valid path could be 'alpha' -> 'plha'...

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

    Implementing an auto-suggest feature for search engines to enhance user experience by predicting search queries.

    • Use a trie data structure for efficient prefix searching.

    • Store a list of common queries and their frequencies to prioritize suggestions.

    • Implement a backend service that queries the database for suggestions based on user input.

    • Consider using machine learning models to improve suggestion accuracy over time.

    • Exam...

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

    Create a linked list from a number by storing each digit as a node in sequence.

    • Define a Node class with properties for value and next node.

    • Convert the number to a string to iterate through each digit.

    • Create the head of the linked list with the first digit.

    • Iterate through the remaining digits, creating new nodes and linking them.

    • Example: For number 12345, nodes will be created as 1 -> 2 -> 3 -> 4 -> 5.

  • Answered by AI
  • 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&#44; 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

Top trending discussions

View All
Indian Startups
2w
a senior executive
One of the best sources for Startup investment: DAHEJ(DOWRY)
You won't believe my senior has a good corporate job with over 10 years of experience. But suddenly resigned just a few days after his wedding. We all thought maybe he got married and wants to spend his time with his wife, and decided to go to his place to give him a proper farewell. All of us got shocked after knowing that he left because his father-in-law gifted him a fat cash amount and a car in the name of "blessings." He’s using the money to fund his startup and the car for "business movement." I mean seriously? People are now using dowry as startup capital and walking around acting like CEOs, playing boss with someone else’s money. Bas, shaadi karo aur apne sapne chalu karo, courtesy sasural. I don't know feeling inspired? Or disgusted?
Got a question about Housing.com?
Ask anonymously on communities.

Interview questions from similar companies

Interview Preparation Tips

Round: Test
Experience: First round was a simple round which involved 10 multiple choice questions and 3 coding questions on hackerrank platform.

Round: Technical Interview
Experience: Mainly on topics like networks, data structures and algorithms, operating systems. The interviewers looked for people who have had prior experience in web development and asked questions regarding web development in depth too.
Tips: I recommend everyone to read the book titled, 'Cracking the Coding Interview' as it was helpful in my approach to an interview.

General Tips: The one major thing that would give you the edge in joining Myntra would definitely be exposure to web development. Since it is not a part of the curriculum , it's all the more important for you to familiarize yourself with web development. In fact, a few projects in the same field would put you in a very advantageous position to get the job.
Skill Tips: 1. Start your placement preparations well ahead, no point regretting later.
2. Keep a concise resume. Do not take your resume to several pages.
3. Do not neglect aptitude preparation. Many people do this mistake and end up not clearing the first round for several companies.
4. Be thorough with your basics across all subjects. (Do not neglect any subject, even they you may like a few and dislike the others.)
5. Keep in mind, the interviewers are really friendly and try to make sure that you're not nervous during the interview. All they want to do is to test you. Be confident and give it your best shot.
Skills:
College Name: NIT Surathkal

Interview Questionnaire 

10 Questions

  • Q1. What do you do when your schedule is interrupted? How you handle it?
  • Ans. 

    I prioritize tasks, communicate effectively, and adapt my plans to manage interruptions while maintaining productivity.

    • Assess the interruption: Determine its urgency and importance. For example, if a team member needs immediate help, I prioritize that.

    • Reorganize my tasks: I create a new plan that accommodates the interruption while ensuring critical deadlines are met.

    • Communicate with stakeholders: I inform my team or m...

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

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

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

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

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

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

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

  • Answered by AI
  • Q9. Singlton pattern?
  • Ans. 

    The Singleton pattern ensures a class has only one instance and provides a global point of access to it.

    • Restricts instantiation of a class to a single object.

    • Useful for managing shared resources, like database connections.

    • Implemented using private constructors and static methods.

    • Example in Java: public class Singleton { private static Singleton instance; private Singleton() {} public static Singleton getInstance() { if...

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

  • Answered by AI

Interview Preparation Tips

Skills: Algorithm, Data structure
College Name: na

Skills evaluated in this interview

Are these interview questions helpful?

I appeared for an interview before Dec 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Easy

Myntra had conducted a coding test on campus before the start of the placement season with 2 questions, one on stack and other on DP.
Tips : For the test, the DP question asked was pretty standard, on Longest Common Subsequence. The question on stacks, I don't remember what it was but it was also pretty straight forward. For the test, I would recommend to solve problem from GFG. If they do come to resume shortlisting, they are looking for people who have done good projects and internships.

  • Q1. 

    Longest Common Subsequence Problem Statement

    Given two strings STR1 and STR2, determine the length of their longest common subsequence.

    A subsequence is a sequence that can be derived from another sequen...

  • Ans. 

    The task is to find the length of the longest common subsequence between two given strings.

    • Implement a function to find the longest common subsequence between two strings.

    • Use dynamic programming to solve this problem efficiently.

    • Iterate through the strings and build a matrix to store the lengths of common subsequences.

    • Return the length of the longest common subsequence found.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

The interview started off with questions on my general interest in Software Development. The first round had two coding questions, I was supposed to write the code on paper. 
For the questions, they asked me to code the solution first. And then gave a specific input and asked me to demonstrate step by step in my code, how it would lead to the correct answer.
Tips: It's ok if you can't code a general solution, if you can write a code which works for the particular input they have given then also it's ok with them. But be thorough with Data structures.

  • Q1. 

    Add Two Numbers as Linked Lists

    You are given two singly linked lists, where each list represents a positive number without any leading zeros.

    Your task is to add these two numbers and return the sum as ...

  • Ans. 

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

    • Traverse both linked lists simultaneously while keeping track of carry from previous sum

    • Create a new linked list to store the sum, updating the value and carry as needed

    • Handle cases where one linked list is longer than the other by adding remaining digits with carry

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

I wasn't asked to write any code in this interview. They asked me some questions on Machine Learning, because of my projects in them. Then they asked me if I knew graph algorithms. Since I knew BFS and DFS, I told them. They asked the difference between the two. Then they asked me if I knew how to find the shortest distance between two points in a graph. I didn't know Dijkstra's properly but I knew it worked on the greedy approach so was able to tell that. Then they asked me how would I find the second shortest path. I tried to answer it with the same greedy approach, but couldn't arrive at the complete solution.
Tips: They ask a tough theoretical question. It's ok if you don't know the answer, they only look for your approach.

  • Q1. 

    BFS Traversal in a Graph

    Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...

  • Ans. 

    BFS traversal in a disconnected graph starting from vertex 0.

    • Use a queue to keep track of nodes to visit next in BFS traversal

    • Start traversal from vertex 0 and explore its neighbors first

    • Continue exploring neighbors level by level until all nodes are visited

    • Ensure to print connected nodes in numerical sort order

  • Answered by AI
  • Q2. 

    DFS Traversal Problem Statement

    Given an undirected and disconnected graph G(V, E), where V is the number of vertices and E is the number of edges, the connections between vertices are provided in the 'GR...

  • Ans. 

    DFS traversal to find connected components in an undirected and disconnected graph.

    • Perform DFS traversal on each vertex to find connected components

    • Maintain a visited array to keep track of visited vertices

    • Print the vertices of each connected component in ascending order

  • Answered by AI
  • Q3. 

    Dijkstra's Shortest Path Problem

    Given an undirected graph with ‘V’ vertices (labeled 0, 1, ... , V-1) and ‘E’ edges, where each edge has a weight representing the distance between two connected nodes (X,...

  • Ans. 

    Dijkstra's algorithm is used to find the shortest path from a source node to all other nodes in a graph with weighted edges.

    • Implement Dijkstra's algorithm to find the shortest path distances from the source node to all other nodes in the graph.

    • Use a priority queue to efficiently select the next node with the shortest distance.

    • Update the distances of neighboring nodes based on the current node's distance and edge weight...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPA, Eligible branches : Computer Science & Engineering, Mathematics & Computing, Electrical Engineering and Electronics & Communication Engineering.Myntra 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 : Be thorough with Data Structures and Algorithms and also with your resume.
Tip 2 : Must do Previously asked Interview as well as Online Test Questions.
Tip 3 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 4 : 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

Software Developer Interview Questions & Answers

Myntra user image Thommandru Vishnu

posted on 10 Mar 2015

Interview Questionnaire 

9 Questions

  • Q1. All the leaf nodes of tree are doubly linked,print only the leaf nodes of a tree
  • Ans. 

    Print only the leaf nodes of a doubly linked tree.

    • Traverse the tree and check if a node has no children and both left and right pointers are null.

    • If yes, then it is a leaf node and print it.

    • If no, then continue traversing the tree.

    • Use recursion to traverse the tree in a depth-first manner.

  • Answered by AI
  • Q2. LRU page Replacement Algorithm for large data
  • Ans. 

    LRU page replacement algorithm is used to replace the least recently used page in memory with a new page.

    • LRU stands for Least Recently Used

    • It is a cache eviction algorithm

    • It is used to manage memory in operating systems

    • It works by keeping track of the pages that are used recently and the ones that are not

    • When a new page is to be loaded into memory, the algorithm checks which page has not been used for the longest time ...

  • Answered by AI
  • Q3. Given a linked list with 2 parameters m,n. Now start reversing the m nodes and leave n nodes and continue it till u reach the end
  • Ans. 

    Reverse m nodes and leave n nodes in a linked list till the end.

    • Traverse the linked list till m nodes and reverse them

    • Traverse n nodes and continue reversing m nodes

    • Repeat the above step till the end of the linked list

    • Handle edge cases like m or n being greater than the length of the linked list

  • Answered by AI
  • Q4. Inorder Traversal of a tree
  • Ans. 

    Inorder traversal is a way of visiting all nodes in a binary tree by visiting the left subtree, then the root, and then the right subtree.

    • Start at the root node

    • Traverse the left subtree recursively

    • Visit the root node

    • Traverse the right subtree recursively

    • Repeat until all nodes have been visited

  • Answered by AI
  • Q5. Inorder Travesal of a tree without recursion(write the code)
  • Ans. 

    Inorder traversal of a tree without recursion

    • Create an empty stack and initialize current node as root

    • Push the current node to stack and set current = current.left until current is NULL

    • If current is NULL and stack is not empty, pop the top item from stack, print it and set current = popped_item.right

    • Repeat step 2 and 3 until stack is empty

  • Answered by AI
  • Q6. Given an array of numbers in which duplicates are there and one triplicate is there. find that number
  • Ans. 

    Find the triplicate number in an array of duplicates.

    • Iterate through the array and keep track of the frequency of each number.

    • Return the number that appears three times.

    • If no number appears three times, return null.

  • Answered by AI
  • Q7. Explain all the serach algorithm you know with space and Time complexities
  • Ans. 

    Explanation of search algorithms with their space and time complexities.

    • Linear Search - O(n) time complexity, O(1) space complexity

    • Binary Search - O(log n) time complexity, O(1) space complexity

    • Jump Search - O(√n) time complexity, O(1) space complexity

    • Interpolation Search - O(log log n) time complexity, O(1) space complexity

    • Exponential Search - O(log n) time complexity, O(1) space complexity

    • Fibonacci Search - O(log n) ...

  • Answered by AI
  • Q8. Given a situation and asks you which search algorithm suits the best in that situation
  • Ans. 

    Choosing the right search algorithm depends on data structure, size, and specific requirements like speed or memory usage.

    • Binary Search: Efficient for sorted arrays, O(log n) time complexity. Example: Finding a number in a sorted list.

    • Linear Search: Simple and works on unsorted arrays, O(n) time complexity. Example: Searching for a name in an unsorted list.

    • Depth-First Search (DFS): Suitable for tree/graph traversal, ex...

  • Answered by AI
  • Q9. Given an array of length n and in which numbers from 1-n will be there and each number can repeat any number of times find out which repeated more number of times
  • Ans. 

    Find the most repeated number in an array of length n with numbers 1-n.

    • Create a dictionary to store the count of each number in the array

    • Iterate through the array and update the count in the dictionary

    • Find the key with the highest count in the dictionary

  • Answered by AI

Interview Preparation Tips

Round: Resume Shortlist
Experience: Basically, it's not resume shortlist, it's a 9 pointer shortlist

Round: Test
Experience: 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 was not known 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
Duration: 120 minutes
Total Questions: 7

Round: Technical Interview
Experience: 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.There are 2 more questions which I haven't mentioned.
Tips: got through Data Structures and Algorithms Made Easy by Narasimha Karumanchi. It's a best book for the interviews.

Round: Technical Interview
Experience: The interviewer asked to put everything on the blackboard and write down the code of each and everything.
Tips: Go to the website -----/ and study all the interview questions and modules

Round: HR Interview
Experience: It's Technical+ HR interview all the technical questions went around resume. it went around 45 minutes they are very particular about what you wrote in the resume.HR questions are general like
whats your future plans
where will u see yourself in the office after 5 years?
Tips: please make sure that whatever you write in resume should be known to you very well.Don't write false things about yourself.And make sure you know completely about the projects you are going to write in resume(atleast the part you worked)

General Tips: Be sure of what you are saying. Don't be tensed and answer to your best.
Skills: Programming, Data Structures
College Name: VIT VELLORE

Skills evaluated in this interview

Interview Questionnaire 

10 Questions

  • Q1. Change Binary tree so that parent node is the sum of root nodes
  • Ans. 

    Change binary tree to make parent node the sum of root nodes

    • Traverse the tree in post-order

    • For each node, update its value to the sum of its children

    • Return the updated root node

  • Answered by AI
  • Q2. Reverse a linkedlist ?
  • Ans. 

    Reverse a linkedlist by changing the direction of pointers.

    • Iterate through the linkedlist and change the direction of pointers.

    • Keep track of previous, current and next nodes.

    • Set the next pointer of current node to previous node.

    • Move to next node and repeat until end of list is reached.

  • Answered by AI
  • Q3. Given an array of +ve and -ve numbers , have to rearrange them ( like +ve numbers to left and -ve numbers to right of the array)
  • Ans. 

    Rearrange an array of positive and negative numbers with positive numbers on the left and negative numbers on the right.

    • Create two empty arrays, one for positive numbers and one for negative numbers

    • Loop through the original array and add positive numbers to the positive array and negative numbers to the negative array

    • Concatenate the positive and negative arrays to create the rearranged array

  • Answered by AI
  • Q4. Singleton pattern, observer pattern?
  • Q5. String pool and how garbage collection functionality works?
  • Ans. 

    String pool is a cache of string literals in memory. Garbage collection frees up memory by removing unused objects.

    • String pool is a cache of string literals in memory

    • Strings are immutable and can be shared among multiple objects

    • Garbage collection removes unused objects to free up memory

    • String objects that are no longer referenced are eligible for garbage collection

  • Answered by AI
  • Q6. HashMap , how can you synchronize ?
  • Ans. 

    Synchronizing a HashMap ensures thread safety when multiple threads access it concurrently.

    • Use Collections.synchronizedMap(): Wrap the HashMap with this method to create a synchronized version.

    • Example: Map<String, String> syncMap = Collections.synchronizedMap(new HashMap<>());

    • Use ConcurrentHashMap: This is a thread-safe alternative to HashMap that allows concurrent access.

    • Example: ConcurrentHashMap<Strin...

  • Answered by AI
  • Q7. Process vs Thread differences and synchronization,deadlock examples?
  • Ans. 

    Process vs Thread differences and synchronization, deadlock examples

    • Process is an instance of a program while thread is a subset of a process

    • Processes are independent while threads share the same memory space

    • Synchronization is used to coordinate access to shared resources

    • Deadlock occurs when two or more threads are blocked waiting for each other to release resources

    • Examples of synchronization include mutex, semaphore, ...

  • Answered by AI
  • Q8. Database: Design with one-one mapping, one-many mapping…some basic questions, I don’t remember all
  • Q9. Design a website where after user request. A bunch of processes need to be executed and then a mail is sent to user with the result. Take care of scalability etc?
  • Ans. 

    Design a scalable website to process user requests and send email results asynchronously.

    • Use a microservices architecture to handle different processes independently.

    • Implement a message queue (e.g., RabbitMQ, Kafka) to manage requests and responses.

    • Utilize cloud services (e.g., AWS Lambda) for scalable processing of tasks.

    • Send emails using a reliable service (e.g., SendGrid, Amazon SES) to ensure delivery.

    • Implement loa...

  • Answered by AI
  • Q10. CTO round

Interview Preparation Tips

Round: HR Interview
Experience: This was CTO round, if you make this round…you are doing pretty good. 
He asked a lot on what I worked on and asked questions relevant to that. Process thread, stacks heaps. A minor system design on component in their system. How they are shared between and trade-off. We discussed about scalability and challenge.

General Tips: Process:5 technical ( 3 rounds+ SVP round + CTO round ) + 1 HR
I got almost the same package that I am currently getting (Myntra gave stock options&#44; which I don’t have in my current company) but I am looking for a change so accepted the offer.
Skills: Algorithm, data structure, database
College Name: na

Skills evaluated in this interview

Housing.com Interview FAQs

How many rounds are there in Housing.com interview for freshers?
Housing.com interview process for freshers usually has 3 rounds. The most common rounds in the Housing.com interview process for freshers are Resume Shortlist, Aptitude Test and One-on-one Round.
How to prepare for Housing.com interview for freshers?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Housing.com. The most common topics and skills that interviewers at Housing.com expect are Analytics, Internship, Transaction Services, Advertising and CMS.
What are the top questions asked in Housing.com interview for freshers?

Some of the top questions asked at the Housing.com interview for freshers -

  1. Given a string (say alpha) and a dictionary database from where I can find if a...read more
  2. Given two sides of a river having the same cities labeled in characters. Bridge...read more
  3. Given a BST and two positions in a bst exchanged to give a violation in bst rul...read more
How long is the Housing.com interview process?

The duration of Housing.com interview process can vary, but typically it takes about less than 2 weeks to complete.

Tell us how to improve this page.

Overall Interview Experience Rating

3/5

based on 1 interview experience

Difficulty level

Moderate 100%

Duration

Less than 2 weeks 100%
View more

Interview Questions from Similar Companies

Swiggy Interview Questions
3.8
 • 474 Interviews
Meesho Interview Questions
3.7
 • 368 Interviews
Udaan Interview Questions
3.9
 • 347 Interviews
Blinkit Interview Questions
3.8
 • 241 Interviews
Oyo Rooms Interview Questions
3.2
 • 230 Interviews
Myntra Interview Questions
3.9
 • 229 Interviews
BlackBuck Interview Questions
3.7
 • 194 Interviews
FirstCry Interview Questions
3.6
 • 187 Interviews
Tata 1mg Interview Questions
3.6
 • 186 Interviews
Spinny Interview Questions
3.7
 • 184 Interviews
View all

Housing.com Reviews and Ratings

based on 611 reviews

3.7/5

Rating in categories

3.6

Skill development

3.6

Work-life balance

4.0

Salary

3.2

Job security

3.8

Company culture

3.2

Promotions

3.4

Work satisfaction

Explore 611 Reviews and Ratings
Account Manager - Broker Acquisition

Delhi/Ncr

2-7 Yrs

₹ 3-8 LPA

Enterprise Sales - Account Manager - B2B - Housing.com

Hyderabad / Secunderabad

4-9 Yrs

₹ 7-12 LPA

Explore more jobs
Senior Accounts Manager
384 salaries
unlock blur

₹5.5 L/yr - ₹12.5 L/yr

Accounts Manager
224 salaries
unlock blur

₹3.5 L/yr - ₹9 L/yr

Team Manager
75 salaries
unlock blur

₹8.6 L/yr - ₹16 L/yr

Software Development Engineer
68 salaries
unlock blur

₹10 L/yr - ₹29.2 L/yr

Senior Manager
45 salaries
unlock blur

₹5.3 L/yr - ₹18.2 L/yr

Explore more salaries
Compare Housing.com with

MagicBricks

4.2
Compare

NoBroker

3.1
Compare

Udaan

3.9
Compare

Swiggy

3.7
Compare
write
Share an Interview