AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Housing.com Devops Interview Questions and Answers
8 Interview questions
Ruby program to check directory existence and write permissions.
Use File.exist? method to check if directory exists.
Use File.writable? method to check if directory has write permissions.
Combine both methods to get the desired result.
Chef is a configuration management tool used for automating infrastructure deployment and management.
Chef helps in automating the process of configuring and managing servers and applications.
It allows for consistent and repeatable infrastructure deployments.
Chef can be used to manage both on-premises and cloud-based infrastructure.
It provides a centralized platform for managing configurations and enforcing policie...
Optimise SQL query by identifying bottlenecks and improving indexing and query structure.
Identify slow performing queries using profiling tools
Improve indexing by adding or removing indexes
Rewrite query structure to reduce complexity and improve performance
Use query optimisation techniques like subqueries and joins
Consider caching frequently accessed data
Use inotifywait command to monitor file changes in Linux.
Install inotify-tools package
Use inotifywait command with options like -m for continuous monitoring and -e for specific events
Example: inotifywait -m /var/log/messages -e modify
Output will show the file path, event type and timestamp
Yes, by using regular expressions to match phone number patterns.
Use regular expressions to match phone number patterns
Common phone number patterns include (XXX) XXX-XXXX and XXX-XXX-XXXX
Consider international phone number formats as well
Use a programming language with regex support, such as Python or JavaScript
Linux boot process involves several stages including BIOS, bootloader, kernel initialization, and user space initialization.
BIOS performs a power-on self-test and loads the bootloader from the boot device.
Bootloader loads the kernel into memory and initializes it.
Kernel initializes hardware, mounts the root file system, and starts the init process.
Init process starts user space processes and services.
Linux boot pr...
Use 'pkill' command with '-f' option to kill all java processes.
Open terminal or command prompt
Type 'pkill -f java' and press enter
All java processes will be terminated
A process in Linux is a running instance of a program or command.
A process is identified by a unique process ID (PID)
Processes can be started, stopped, and managed using commands like ps, kill, and top
Processes can run in the foreground or background
Processes can communicate with each other through inter-process communication (IPC)
Examples of processes include web servers, database servers, and user applications
Housing.com Devops Interview Experiences
1 interview found
swapnil rastogi
I applied via Referral
Interview Questionnaire
8 Questions
- Q1. How will you kill all java process in one command ?
- Ans.
Use 'pkill' command with '-f' option to kill all java processes.
Open terminal or command prompt
Type 'pkill -f java' and press enter
All java processes will be terminated
- Q2. How will you monitor file change in linux ?
- Ans.
Use inotifywait command to monitor file changes in Linux.
Install inotify-tools package
Use inotifywait command with options like -m for continuous monitoring and -e for specific events
Example: inotifywait -m /var/log/messages -e modify
Output will show the file path, event type and timestamp
- Q3. What is a process in linux ?
- Ans.
A process in Linux is a running instance of a program or command.
A process is identified by a unique process ID (PID)
Processes can be started, stopped, and managed using commands like ps, kill, and top
Processes can run in the foreground or background
Processes can communicate with each other through inter-process communication (IPC)
Examples of processes include web servers, database servers, and user applications
- Q4. How does a linux boot ?
- Ans.
Linux boot process involves several stages including BIOS, bootloader, kernel initialization, and user space initialization.
BIOS performs a power-on self-test and loads the bootloader from the boot device.
Bootloader loads the kernel into memory and initializes it.
Kernel initializes hardware, mounts the root file system, and starts the init process.
Init process starts user space processes and services.
Linux boot process...
- Q5. Given a file with random content, could you find out all the phone numbers ?
- Ans.
Yes, by using regular expressions to match phone number patterns.
Use regular expressions to match phone number patterns
Common phone number patterns include (XXX) XXX-XXXX and XXX-XXX-XXXX
Consider international phone number formats as well
Use a programming language with regex support, such as Python or JavaScript
- Q6. Usecase for chef and why do you need it ?
- Ans.
Chef is a configuration management tool used for automating infrastructure deployment and management.
Chef helps in automating the process of configuring and managing servers and applications.
It allows for consistent and repeatable infrastructure deployments.
Chef can be used to manage both on-premises and cloud-based infrastructure.
It provides a centralized platform for managing configurations and enforcing policies.
Che...
- Q7. Ruby program to find out if a directory exists and you write permissions to it ?
- Ans.
Ruby program to check directory existence and write permissions.
Use File.exist? method to check if directory exists.
Use File.writable? method to check if directory has write permissions.
Combine both methods to get the desired result.
- Q8. How would you optimise a given sql query ?
- Ans.
Optimise SQL query by identifying bottlenecks and improving indexing and query structure.
Identify slow performing queries using profiling tools
Improve indexing by adding or removing indexes
Rewrite query structure to reduce complexity and improve performance
Use query optimisation techniques like subqueries and joins
Consider caching frequently accessed data
Interview Preparation Tips
Experience: I was referred by a friend already working at Housing.com.
Tips: I find it best to keep yourself updated with what other people with same job profile are doing. That way you can learn new things and make it shine on your resume even if you have no work ex on the same.
Round: Technical Interview
Experience: First round was skype based technical interview.
You are connected through screen on the terminal and basic to advanced shell scripting is asked.
They will ask basic to advanced shell commands, some shell scripting tasks and about linux kernel.
Tips: You have to be really sure in a skype interview that you know the question being asked, as you can't take much time.
Round: Technical Interview
Experience: This round was also on skype.
This round was more DevOps tools oriented and language programming.
They asked me about Chef, Ansible and some other tools used for configuration management and deployment.
They ask if your familiar with AWS and other cloud services.
Also you will get to show that you can code in any scripting languages like ruby or python.
Also some database related things.
Tips: Only mention the tools you really know inside out in the resume.
General Tips: You should be updated with whats going on with latest devops developments.
Skills: Confidence, Database, Programming, Linux
College Name: BITS Pilani - Hyderabad
Motivation: My motivation was to learn scalability on things as its a big platform with millions of users for mobile and web app.
Skills evaluated in this interview
Top trending discussions
Interview questions from similar companies
Anonymous
I applied via Naukri.com and was interviewed before Jun 2021. There were 2 interview rounds.
(2 Questions)
- Q1. Skills of current company
- Q2. Language test and communication skills
Interview Preparation Tips
- Communication Skills
I applied via Naukri.com and was interviewed in Nov 2020. There was 1 interview round.
Interview Questionnaire
1 Question
- Q1. Tell about your self, Education,work experience,key skill,next desire in life, future plans
Interview Preparation Tips
Interview Questionnaire
1 Question
- Q1. About my experience & activities & responsibilities.
- Ans. I told my experience, & handling activities
I appeared for an interview in Jan 2021.
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Easy
4 Questions which were of Easy, Medium, and Hard level.
- Q1.
Lowest Common Ancestor of a Binary Tree III
The structure of a binary tree has been modified so that each node includes a reference to its parent node.
Problem Statement
You are provided with two nodes,...
- Ans.
This question is about finding the lowest common ancestor of two nodes in a binary tree with parent references.
Traverse from the given nodes to their respective root nodes and store the paths in two separate lists.
Compare the two lists and find the last common node.
Return the last common node as the lowest common ancestor.
- Q2.
Maximum Subarray Problem Statement
Ninja has been given an array, and he wants to find a subarray such that the sum of all elements in the subarray is maximum.
A subarray 'A' is considered greater than a...
- Ans.
The problem is to find a subarray with the maximum sum in a given array.
Iterate through the array and keep track of the maximum sum and the current sum.
If the current sum becomes negative, reset it to 0.
Update the maximum sum if the current sum is greater.
Also keep track of the start and end indices of the subarray with the maximum sum.
Return the subarray using the start and end indices.
(2 Questions)
Round duration - 50 Minutes
Round difficulty - Easy
- Q1.
Next Greater Element Problem Statement
Given a list of integers of size
N, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an elementXis the firs... - Ans.
The task is to find the next greater element for each element in an array.
Iterate through the array from right to left.
Use a stack to keep track of the elements that have a greater element to their right.
For each element, pop elements from the stack until a greater element is found or the stack is empty.
If a greater element is found, it is the next greater element for the current element.
If the stack becomes empty, the...
- Q2.
Trapping Rain Water Problem Statement
You are given a long type array/list
ARRof sizeN, representing an elevation map. The valueARR[i]denotes the elevation of theithbar. Your task is to determine th... - Ans.
The question asks to find the total amount of rainwater that can be trapped in the given elevation map.
Iterate through the array and find the maximum height on the left and right side of each bar.
Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on both sides and subtracting the height of the bar.
Sum up the amount of water trapped at each bar to get the total amo...
Round duration - 30 Minutes
Round difficulty - Easy
It is just a formality round, asked basic questions like relocation and joining date etc
Interview Preparation Tips
Tip 1 : Be good with all data structures and algorithms
Tip 2 : Able to explain your projects well
Tip 3 : focus on basics
Tip 1 : Try to make a single-page resume.
Tip 2 : Don't write unnecessary details like hobbies, family, etc.
Skills evaluated in this interview
Aditya Sundaram
Interview Preparation Tips
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...
- 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.
- 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
- 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.
- 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...
- 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...
- 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...
- 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...
- 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...
- 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.
Interview Preparation Tips
College Name: na
Skills evaluated in this interview
I applied via Recruitment Consultant and was interviewed before Jun 2019. There were 5 interview rounds.
Interview Questionnaire
2 Questions
- Q1. No relevant questions to the job
- Q2. Basic English tests
Interview Preparation Tips
I appeared for an interview before Dec 2020.
(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
STR1andSTR2, 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.
(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
(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
- Q2.
DFS Traversal Problem Statement
Given an undirected and disconnected graph
G(V, E), whereVis the number of vertices andEis 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
- 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...
Interview Preparation Tips
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.
Skills evaluated in this interview
Thommandru Vishnu
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.
- 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 ...
- 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
- 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
- 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
- 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.
- 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) ...
- 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...
- 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
Interview Preparation Tips
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
Housing.com Interview FAQs
Tell us how to improve this page.
Housing.com Interviews By Designations
- Housing.com Accounts Manager Interview Questions
- Housing.com Software Developer Interview Questions
- Housing.com Software Engineer Interview Questions
- Housing.com Senior Accounts Manager Interview Questions
- Housing.com Associate Product Manager Interview Questions
- Housing.com Front end Engineer Interview Questions
- Housing.com Senior Software Engineer Interview Questions
- Housing.com Software Development Engineer Interview Questions
- Show more
Interview Questions from Similar Companies
|
Senior Accounts Manager
381
salaries
|  ₹5.4 L/yr - ₹12.5 L/yr |
|
Accounts Manager
225
salaries
| ₹4.5 L/yr - ₹8.8 L/yr |
|
Team Manager
75
salaries
| ₹8.6 L/yr - ₹16 L/yr |
|
Software Development Engineer
68
salaries
| ₹15 L/yr - ₹27.1 L/yr |
|
Senior Manager
45
salaries
| ₹8.3 L/yr - ₹13.1 L/yr |
MagicBricks
NoBroker
Udaan
Swiggy
- Home >
- Interviews >
- Housing.com Interview Questions
