Question d’entretien chez DP World
1. Project related 2. Generate well formed parenthesis recursion problem. 3. Nearest Smaller element in an array - Just use a stack I had done all this before but was not prepared well at that point.
1. Project related 2. Generate well formed parenthesis recursion problem. 3. Nearest Smaller element in an array - Just use a stack I had done all this before but was not prepared well at that point.