WeWork India Management Front end Developer Interview Questions and Answers

Q1. Sql related questions
Add your answer

It was quite good and easy to crack

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

Clock problem blood relation