AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Housing.com Software Development Engineer Interview Questions and Answers
Housing.com Software Development Engineer Interview Experiences
2 interviews found
Anonymous
I applied via Campus Placement
Aptitude plus 2 basic DSA
(2 Questions)
- Q1. DSA (binary tree traversal)
- Q2. DSA (array questions)
(2 Questions)
- Q1. OOPs( design calculator)
- Q2. Design Heap( tree)
- Ans.
Design a heap tree data structure
A heap is a complete binary tree where the value of each node is greater than or equal to the values of its children
There are two types of heaps: min heap (parent node is smaller than children) and max heap (parent node is larger than children)
Heap can be implemented using arrays where parent node at index i has children at indices 2i+1 and 2i+2
Skills evaluated in this interview
Selected
I applied via Recruitment Consulltant and was interviewed before Apr 2023. There were 2 interview rounds.
(1 Question)
- Q1. Easy to medium level questions asked. Overall it was good
(1 Question)
- Q1. Medium to difficult level conceptual questions asked
Software Development Engineer Jobs at Housing.com
Top trending discussions
Interview questions from similar companies
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
- 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
Interview Questionnaire
12 Questions
- Q1. What is the difference between get and post?
- Ans.
GET is used to retrieve data from a server, while POST is used to send data to a server.
GET requests are idempotent, meaning they can be repeated without changing the result
POST requests are not idempotent and can have side effects on the server
GET requests can be cached by the browser, while POST requests cannot
GET requests have limitations on the amount of data that can be sent, while POST requests have no limitation...
- Q2. What is session in php?
- Ans.
Session in PHP is a way to store and retrieve data for a user across multiple requests.
Sessions are used to maintain user-specific data on the server side.
A session is created for each user and is identified by a unique session ID.
Session data can be stored in server files or in a database.
Session variables can be accessed and modified throughout the user's session.
Sessions can be used to implement features like user a
- Q3. Where does session id is stored in php? How server identifies request has come from which client and many other related questions?
- Ans.
Session ID is stored in PHP as a cookie or a query parameter.
Session ID can be stored as a cookie in the client's browser.
Session ID can also be stored as a query parameter in the URL.
The server identifies the client by retrieving the session ID from the cookie or query parameter.
The session ID is then used to retrieve the corresponding session data stored on the server.
The server can also use other methods like IP add
- Q4. Cookie in php? Size of the cookie, expiry etc?
- Ans.
A cookie in PHP is a small piece of data stored on the client's computer. It has a size limit and an expiry date.
A cookie is used to store information on the client's computer for future use.
In PHP, cookies are set using the setcookie() function.
The size of a cookie is limited to 4KB.
Cookies can have an expiry date, after which they are no longer valid.
The expiry date can be set using the 'expires' parameter in the set...
- Q5. Memcache?
- Q6. Myisam and Innnodb?
- Q7. Triggers in mysql?
- Ans.
Triggers in MySQL are database objects that are automatically executed in response to specified events.
Triggers are used to enforce business rules, maintain data integrity, and automate tasks.
They can be defined to execute before or after an INSERT, UPDATE, or DELETE operation.
Triggers can be written in SQL or in a programming language like PL/SQL.
Examples of trigger events include inserting a new record, updating a re...
- Q8. Overriding and Overloading?
- Q9. Static class and static variable?
- Q10. Singleton pattern and factory pattern?
- Q11. Can constructor be declared as private?
- Ans.
Yes, a constructor can be declared as private.
Declaring a constructor as private restricts its accessibility to only the class itself.
This can be useful in scenarios where you want to control the creation of objects of that class.
Private constructors are commonly used in singleton design pattern implementations.
Example: private constructor in a singleton class:
class Singleton { private Singleton() {} }
- Q12. Indexing in mysql?
- Ans.
Indexing in MySQL improves the performance of database queries by creating a data structure that allows for faster data retrieval.
Indexes are created on one or more columns of a table.
They help in speeding up the search, sorting, and joining of data.
Indexes can be created using the CREATE INDEX statement.
Common types of indexes include B-tree, hash, and full-text indexes.
Indexes should be used judiciously as they consu...
Interview Preparation Tips
College Name: NA
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
- 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.
- 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
- 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
- Q6. HashMap , how can you synchronize ?
- 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, ...
- 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?
- Q10. CTO round
Interview Preparation Tips
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, 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
I appeared for an interview before Dec 2020.
(2 Questions)
Round duration - 120 minutes
Round difficulty - Medium
This was a 2 hour round consisting of 5 mcqs and 2 codes. The mcqs were pretty much simple based on DS, DBMS, OS, OOP, and C.
- Q1.
Rabbit Jumping Problem
Consider 'n' carrots numbered from 1 to 'n' and 'k' rabbits. Each rabbit jumps to carrots only at multiples of its respective jumping factor Aj (i.e., Aj, 2Aj, 3Aj, ...), for all ra...
- Ans.
Calculate uneaten carrots by rabbits with specific jumping factors.
Iterate through each carrot and check if any rabbit jumps on it.
Use the jumping factors to determine which carrots are eaten.
Subtract the eaten carrots from the total to get the uneaten count.
- Q2.
Flip Bits Problem Explanation
Given an array of integers
ARRof size N, consisting of 0s and 1s, you need to select a sub-array and flip its bits. Your task is to return the maximum count of 1s that can b... - Ans.
Given an array of 0s and 1s, find the maximum count of 1s by flipping a sub-array at most once.
Iterate through the array and keep track of the maximum count of 1s obtained by flipping a sub-array.
Consider flipping a sub-array from index i to j by changing 0s to 1s and vice versa.
Update the maximum count of 1s if the current count after flipping is greater.
Return the maximum count of 1s obtained by flipping a sub-array
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
Started with a brief discussion on my projects and internships. A thorough discussion on whichever languages, frameworks I had used in my projects. Followed by discussion on coding questions. Apart from the codes there were some questions on OS, process stack, heap memory in Java, Garbage collection, OOP principles and comparison based sorting
- Q1.
Sum of Maximum and Minimum Elements Problem Statement
Given an array
ARRof sizeN, your objective is to determine the sum of the largest and smallest elements within the array.Follow Up:
Can you achie...
- Ans.
Find sum of maximum and minimum elements in an array with least number of comparisons.
Iterate through the array and compare each element with current maximum and minimum to update them.
Initialize max as smallest possible value and min as largest possible value.
Return the sum of max and min after iterating through the array.
- Q2.
Invert a Binary Tree Problem Statement
Given a Binary Tree and one of its leaf nodes, invert the binary tree by following these guidelines:
• The given leaf node becomes the root after the inversion. • F...
- Ans.
Invert a binary tree based on a given leaf node as the root.
Start by finding the leaf node in the binary tree.
Move the left child of the leaf node to the right side of the leaf node.
Make the parent of the leaf node the left child of the leaf node.
Repeat the process for each test case.
Return the inverted binary tree in level order format.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
Questions based on programming, DBMS and puzzles were asked in this round.
- Q1.
Rearrange Array to Form Largest Number
Given an array
ARRconsisting of non-negative integers, rearrange the numbers to form the largest possible number. The digits within each number cannot be changed....
- Ans.
Rearrange the array elements to form the largest possible number by concatenating them.
Sort the array elements in a custom way where the concatenation of two numbers results in a larger number.
Use a custom comparator function while sorting the array elements.
Convert the sorted array elements to a single string to get the largest possible number.
- Q2. What is indexing in the context of databases?
- Ans.
Indexing in databases is a technique used to improve the speed of data retrieval by creating a data structure that allows for quick lookups.
Indexes are created on columns in a database table to speed up the retrieval of rows that match a certain condition.
They work similar to the index in a book, allowing the database to quickly find the relevant data without having to scan the entire table.
Examples of indexes include ...
- Q3. What are the advantages of B+ Trees in database management systems?
- Ans.
B+ Trees are advantageous in database management systems due to their ability to efficiently store and retrieve data.
B+ Trees have a high fanout, allowing for more keys to be stored in each node, reducing the height of the tree and improving search performance.
B+ Trees are balanced trees, ensuring that operations like search, insertion, and deletion have a predictable time complexity of O(log n).
B+ Trees are optimized ...
Round duration - 45 minutes
Round difficulty - Medium
Puzzles and HR based questions were asked in this round.
He asked questions like : what are my career goals, what do you look forward to in a boss , how do you see yourself in 5 years ,etc etc .
Interview Preparation Tips
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
Skills evaluated in this interview
I appeared for an interview before Dec 2020.
(2 Questions)
Round duration - 120 minutes
Round difficulty - Medium
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 did not know 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
- Q1.
Binary Tree to Doubly Linked List
Transform a given Binary Tree into a Doubly Linked List.
Ensure that the nodes in the Doubly Linked List follow the Inorder Traversal of the Binary Tree.
Input:
The fi... - Ans.
Convert a Binary Tree into a Doubly Linked List following Inorder Traversal.
Perform Inorder Traversal of the Binary Tree to get the nodes in order.
Create a Doubly Linked List by linking the nodes in the order obtained from Inorder Traversal.
Return the head of the Doubly Linked List as the output.
- Q2.
Unique Element in Array
Given an arbitrary array
arrconsisting ofNnon-negative integers where every element appears thrice except for one. Your task is to find the element in the array that appears onl... - Ans.
Find the unique element in an array where every other element appears thrice.
Use XOR operation to find the unique element.
Iterate through the array and XOR each element to find the unique one.
Return the unique element as the answer.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
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.
Tips: got through Data Structures and Algorithms Made Easy by Narasimha Karumanchi. It's a best book for the interviews.
- Q1.
Binary Tree Traversals Problem Statement
Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...
- Ans.
Implement a function to compute In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.
Parse the input level-order tree elements to construct the binary tree.
Implement recursive functions for In-Order, Pre-Order, and Post-Order traversals.
Return the traversals as lists of lists for each test case.
- Q2.
Delete N Nodes After M Nodes in a Linked List
Given a singly linked list and two integers 'N' and 'M', traverse the linked list to retain 'M' nodes and then delete the next 'N' nodes. Continue this proces...
- Ans.
Traverse a linked list to retain 'M' nodes and then delete the next 'N' nodes, repeating until the end of the list.
Create a function that takes the head of the linked list, 'N', and 'M' as input parameters.
Traverse the linked list, retaining 'M' nodes and deleting the next 'N' nodes in each iteration.
Update the pointers accordingly to skip 'N' nodes after retaining 'M' nodes.
Repeat this process until the end of the lin...
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
The interviewer asked to put everything on the blackboard and write down the code of each and everything.
Question : Explain all the search algorithm you know with space and Time complexities.
Answer : Linear search : It is a sequential search algorithm where the entire array is traversed till the desired element is not found. Time complexity is O(N) and auxiliary space is O(1).
Binary search : In this algorithm, a sorted array is searched by repeatedly dividing the search interval in half.
Steps :
1. Initially the interval covers the whole array.
2. If the value to be searched is less than the item in the middle of the interval, narrow the interval to the lower half. Otherwise, narrow it to the upper half.
3. The process is repeated until the value is found or the interval is empty.
Time complexity is O(log n) and auxiliary space is O(1) in case of iterative implementation.
- Q1.
Maximum Frequency Number Problem Statement
Given an array of integers with numbers in random order, write a program to find and return the number which appears the most frequently in the array.
If multip...
- Ans.
Program to find the number with maximum frequency in an array of integers.
Create a dictionary to store the frequency of each number in the array.
Iterate through the array and update the frequency count in the dictionary.
Find the number with the maximum frequency in the dictionary and return it.
If multiple elements have the same maximum frequency, return the one with the lowest index.
Interview Preparation Tips
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.
Skills evaluated in this interview
I appeared for an interview before Jan 2016.
Interview Preparation Tips
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
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 Associate Product Manager Interview Questions
- Housing.com Senior Accounts 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 for Popular Designations
- Software Engineer Interview Questions
- Senior Software Engineer Interview Questions
- Associate Software Engineer Interview Questions
- Softwaretest Engineer Interview Questions
- Software Engineer Trainee Interview Questions
- Software Developer Intern Interview Questions
- Software Developer Interview Questions
- Junior Software Developer Interview Questions
- Show more
Housing.com Software Development Engineer Interview Process
based on 2 interviews
Interview experience
Software Development Engineer Interview Questions from Similar Companies
Fast track your campus placements
Housing.com Software Development Engineer Reviews and Ratings
based on 5 reviews
Rating in categories
2-4 Yrs
₹ 10.5-25 LPA
|
Senior Accounts Manager
395
salaries
|  ₹4.2 L/yr - ₹12 L/yr |
|
Accounts Manager
235
salaries
| ₹3.5 L/yr - ₹9 L/yr |
|
Team Manager
77
salaries
| ₹5.1 L/yr - ₹16.6 L/yr |
|
Software Development Engineer
63
salaries
| ₹10 L/yr - ₹28.5 L/yr |
|
Key Account Manager
46
salaries
| ₹4.2 L/yr - ₹12 L/yr |
MagicBricks
NoBroker
Udaan
Swiggy
- Home >
- Interviews >
- Housing.com Interview Questions >
- Housing.com Software Development Engineer Interview Questions
