CrewScale Interview Questions and Answers

Q1. Low level design for a product including designing classes and database
Ans. 
Designing classes and database for a product
• Identify the entities and relationships in the system

• Create a class diagram with attributes and methods

• Design the database schema with tables and relationships

• Consider performance, scalability, and security

• Use appropriate design patterns and principles
Answered by AI
Add your answer

Medium level DSA problems related to tree and arrays.

Q1. High level design for 3 products
Ans. 
High level design for 3 products
• Identify user needs and requirements

• Create a conceptual design for each product

• Define the architecture and components

• Consider scalability, security, and performance

• Document the design and review with stakeholders
Answered by AI
Add your answer

Medium level DSA problem and leadership principles situational questions.

Q1. Gas station problem
Ans. 
Gas station problem
• The gas station problem involves finding the minimum starting point from where a circular route can be completed without running out of gas.

• The solution can be obtained using the concept of cumulative sum and tracking the minimum sum encountered.

• If the total sum of gas is greater than or equal to the total sum of cost, a solution exists.

• If there are multiple valid starting points, return the one with
Answered by AI
Add your answer
Q2. Max area in the histogram
Ans. 
Find the maximum area in a histogram.
• Iterate through the histogram and calculate the area for each bar.

• Keep track of the maximum area encountered so far.

• The area of a bar is calculated by multiplying its height with the width (number of consecutive bars) it can extend to.

• Consider using a stack to efficiently calculate the area for each bar.
Answered by AI
Add your answer

Q1. Simplify path problem
Ans. 
The Simplify path problem involves simplifying a given absolute path to its canonical form.
• Use a stack to keep track of the directories in the path.

• Split the path by '/' and process each directory.

• Ignore empty directories and '.'.

• If encountering '..', pop the top directory from the stack.

• Join the remaining directories in the stack to form the simplified path.
Answered by AI
Add your answer
Q2. N-ary tree DFS problem
Ans. 
The question is about solving a problem related to N-ary tree using Depth First Search (DFS).
• Understand the concept of N-ary tree and Depth First Search (DFS)

• Implement the DFS algorithm to traverse the N-ary tree

• Handle the tree nodes and perform necessary operations during traversal
Answered by AI
Add your answer

Q1. LLD round with design patterns
Add your answer
Q2. Leadership principle discussion
Add your answer

Q1. HLD round for notification system
Add your answer
Q2. Leadership principle discussion
Add your answer

Q1. Medium complex problems
Add your answer

Q1. Medium complex problems
Add your answer

Q1. System design questions
Add your answer

Q1. Behavioural questions
Add your answer