Filter interviews by
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
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.
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
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
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.
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...
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 ...
I applied via Campus Placement
Housing.com interview questions for popular designations
Get interview-ready with Top Housing.com Interview Questions
I applied via Naukri.com and was interviewed in Oct 2024. There was 1 interview round.
I applied via Referral and was interviewed in Jun 2024. There were 3 interview rounds.
I applied via Naukri.com and was interviewed in Mar 2024. There were 2 interview rounds.
I applied via Referral and was interviewed in Oct 2023. There were 2 interview rounds.
Top trending discussions
Some of the top questions asked at the Housing.com interview -
The duration of Housing.com interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 41 interviews
Interview experience
based on 548 reviews
Rating in categories
Senior Accounts Manager
396
salaries
| ₹4.5 L/yr - ₹12 L/yr |
Accounts Manager
236
salaries
| ₹3.5 L/yr - ₹9 L/yr |
Team Manager
76
salaries
| ₹5.1 L/yr - ₹16.6 L/yr |
Software Development Engineer
62
salaries
| ₹10 L/yr - ₹29.2 L/yr |
Key Account Manager
46
salaries
| ₹4.2 L/yr - ₹12 L/yr |
MagicBricks
NoBroker
PropTiger.com
99acres