Flexcar Interview Questions and Answers

Two DSA question based on dp and recurssion

Q1. Given a string find the depth of string
Ans. 
The depth of a string is the number of nested levels of parentheses in the string.
• Iterate through the characters of the string and keep track of the current depth using a counter variable.

• Increment the counter when an opening parenthesis is encountered and decrement it when a closing parenthesis is encountered.

• Return the maximum depth reached during the iteration as the final depth of the string.
Answered by AI
Add your answer
Q2. Consecutive integer pair expect one find that gfg question
Add your answer

Q1. Right view of binary tree
Ans. 
The right view of a binary tree shows the rightmost nodes at each level from top to bottom.
• Traverse the tree in a level order manner and keep track of the rightmost node at each level.

• Use a queue to store nodes at each level and update the rightmost node as you traverse.

• Example: For a binary tree with root node 1 and right children 3 and 4, the right view would be [1, 3, 4].
Answered by AI
Add your answer
Q2. Question based o n thread synchronization
Add your answer

Q1. Normal family background question
Add your answer