Write a function to check given input string is balanced or not

Input string will contain parenthesis and digits.

Balance Rule

Whenever a digit is occurred, you need to remove that many left-side parentheses in any order.
For example:
If digit is 2, you need to remove 2 parentheses from the left side.
If input is 1(, either ( can be removed (i.e., the one on the left side of 1).

The string is considered balanced if the count of opening parentheses equals the count of closing parentheses after processing all digits.

Examples of balance:

(())
()()
(())

Special Digit Handling

• Each digit is treated separately.
• If 11 is present in input, treat them as two 1s.

Examples

inp = ()1(())
# Output: True

inp = )1(
# Output: True

inp = )(1)
# Output: False

---

Find the Maximum Length of Subsequence with Increasing Consecutive Elements

Problem Statement

Given a list of integers, task is to find the maximum length of subsequence having increasing consecutive elements that increase by value = 1.

Example

Input : 1 0 2 3 2 4 9 6 5
Output : 5  # as the subsequence will be 1 2 3 4 5

Approach and Interview Notes

Started with brute force. For optimized approach, I took a lot of time to come up with the hashmap based approach (~30mins had already passed by the time I came up with this solution).
Presented the optimized approach, coded it and discussed the time and space complexity.
Interviewer didn’t ask any follow up probably as not much time was left.

One edge case I had missed in the code which the interviewer pointed out and then I added that check.

Received feedback that I need more DSA practice. Got rejected.

---

我们长期稳定承接各大科技公司如TikTok、Google、Amazon等的OA笔试代写服务，确保满分通过。如有需求，请随时联系我们。

We consistently provide professional online assessment services for major tech companies like TikTok, Google, and Amazon, guaranteeing perfect scores. Feel free to contact us if you're interested.