Filter interviews by
Clear (1)
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 was interviewed before Feb 2021.
Round duration - 60 minutes
Round difficulty - Easy
Technical round with questions based on data structures and algorithms.
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...
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.
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 ...
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.
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...
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.
Round duration - 60 minutes
Round difficulty - Easy
Technical round with questions based on data structures and algorithms.
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...
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...
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...
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.
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...
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...
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions based on data structures and algorithms.
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...
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.
You are given the start and end times of 'N' intervals. Write a function to determine if any two intervals overlap.
If an interval ends at time T and anothe...
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
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.
The first...
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.
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions based on System design and data structures and algorithms.
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
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.
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
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...
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
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
Housing.com interview questions for designations
I was interviewed before Feb 2021.
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.
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...
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.
Round duration - 60 minutes
Round difficulty - Medium
This round was completely pen and paper coding round. 3 coding questions were asked.
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...
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.
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 beg...
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.
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 ...
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...
Round duration - 20 minutes
Round difficulty - Easy
Only one coding question was asked with time limit of 10 minutes
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...
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.
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.
Get interview-ready with Top Housing.com Interview Questions
I was interviewed before Feb 2021.
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
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
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...
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.
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...
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
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 ...
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.
Round duration - 30 minutes
Round difficulty - Easy
This was a puzzle round. 2 puzzles were given to solve .
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
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.
Top trending discussions
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.
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
I applied via LinkedIn and was interviewed in Jan 2023. There were 3 interview rounds.
It was 2 coding questions of medium level
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.
I applied via Campus Placement and was interviewed before Aug 2022. There were 5 interview rounds.
There were 2 questions to test our basic coding knowledge.
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.
I applied via Referral and was interviewed before Mar 2023. There were 2 interview rounds.
Some of the top questions asked at the Housing.com Software Engineer interview -
based on 1 review
Rating in categories
Senior Accounts Manager
396
salaries
| ₹0 L/yr - ₹0 L/yr |
Accounts Manager
235
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Manager
76
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer
62
salaries
| ₹0 L/yr - ₹0 L/yr |
Key Account Manager
46
salaries
| ₹0 L/yr - ₹0 L/yr |
MagicBricks
NoBroker
PropTiger.com
99acres