WeWork India Management Front end Developer Interview Questions and Answers

Q1. How do you design metro line for new station
Ans. 
Designing a metro line for a new station involves planning routes, considering passenger flow, and ensuring connectivity.
• Conduct a feasibility study to determine the need for a new station

• Consider factors such as population density, traffic patterns, and potential future growth

• Plan the route to optimize connectivity with existing stations and transportation hubs

• Design the station layout to accommodate passenger flow an...read more
Answered by AI
Add your answer

Q1. How do you learn about our company
Add your answer
Q2. What should one do in tough times
Add your answer

Q1. Sql related questions
Add your answer

It was easy to crack,simple questions asked

They will ask only general topics

Q1. Basic dsa questions asked
Add your answer
Q2. Sql queries and also about joins
Add your answer

It was quite good and easy to crack

Data structure - rainwater trapping

Q1. OOPs concept, core java, sql
Add your answer
Q2. Car parking lot problem - system design
Ans. 
Design a car parking lot system
• Determine the size and capacity of the parking lot

• Create a database to store information about available spots and occupied spots

• Develop a system to track the entry and exit of vehicles

• Implement a payment system for parking fees

• Incorporate security measures such as CCTV cameras and security personnel

• Provide a user-friendly interface for customers to locate available spots and make payment
Answered by AI
Add your answer

Q1. Rapid fire questions
Add your answer
Q2. More java springboot
Add your answer

2 coding question easy to medium level

It was easy based on topic andriod vs ios

Q1. Question on resume and project
Add your answer

It was quite easy with basic topics like percentage, profit and loss.

Internet censorship should be implemented or not

90 min, DSA, hacker platform 3 question

Q1. 2D DP WITH SPACE OPTIMIZATION
Ans. 
2D DP with space optimization is a technique to reduce memory usage while solving dynamic programming problems.
• Use a 1D array instead of a 2D array to store values in dynamic programming problems.

• Update the values in the 1D array based on the dependencies between subproblems.

• Example: Solving the longest common subsequence problem using 2D DP with space optimization.
Answered by AI
Add your answer
Q2. GRAPH WITH BFS ON TREE
Ans. 
Breadth First Search (BFS) on a tree involves visiting nodes level by level starting from the root.
• Start by visiting the root node, then visit all its children before moving on to the next level

• Use a queue data structure to keep track of nodes to visit next

• Repeat the process until all nodes have been visited
Answered by AI
Add your answer