Filter interviews by
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.
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...
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...
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...
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...
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...
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.
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 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...
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.
I applied via Campus Placement and was interviewed in Jul 2023. There were 3 interview rounds.
Mmmmmmmmmmmmmmmmmmmmmmmmmmmmmmm
I applied via Walk-in and was interviewed before Feb 2020. There was 1 interview round.
I appeared for an interview before May 2016.
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...
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...
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.
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 ...
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...
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...
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 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.
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.
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'...
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...
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.
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 ...
Top trending discussions
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...
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.
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
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.
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...
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...
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...
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...
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...
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.
I appeared for an interview before Dec 2020.
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.
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...
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.
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.
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 ...
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
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.
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 ...
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
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...
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
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,...
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...
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.
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.
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.
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 ...
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
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
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
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.
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) ...
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...
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
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
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.
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
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
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...
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, ...
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...
Some of the top questions asked at the Housing.com interview for freshers -
The duration of Housing.com interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 1 interview experience
Difficulty level
Duration
based on 611 reviews
Rating in categories
Bangalore / Bengaluru
4-9 Yrs
₹ 7.5-11 LPA
Senior Accounts Manager
384
salaries
| ₹5.5 L/yr - ₹12.5 L/yr |
Accounts Manager
224
salaries
| ₹3.5 L/yr - ₹9 L/yr |
Team Manager
75
salaries
| ₹8.6 L/yr - ₹16 L/yr |
Software Development Engineer
68
salaries
| ₹10 L/yr - ₹29.2 L/yr |
Senior Manager
45
salaries
| ₹5.3 L/yr - ₹18.2 L/yr |
MagicBricks
NoBroker
Udaan
Swiggy