Problem 1: Visit All Locked Rooms with Keys

There are n rooms, labeled 0 to n-1. All rooms are initially locked except for room 0.

When you enter a room i, you will find a set of keys, represented by rooms[i]. Each key k is an integer that unlocks room k. You are allowed to collect and carry all keys you find.

Task: Given rooms: List[List[int]], where rooms[i] is the list of keys found in room i, determine if you can eventually visit every room, starting from room 0. Return true if all rooms can be visited, otherwise return false.

Constraints (Typical):

• 1 <= n <= 10^4
• 0 <= rooms[i].length <= 10^4
• Keys are integers in the range 0 to n-1 (duplicate keys may exist).

Problem 2: Compute the Score of a Balanced Parentheses String

You are given a balanced parentheses string s consisting only of '(' and ')' characters.

Define the score of a balanced parentheses string recursively as follows:

1. The string "()" has a score of 1.
2. If A and B are balanced parentheses strings, then score(A + B) = score(A) + score(B).
3. If A is a balanced parentheses string, then score("(" + A + ")") = 2 * score(A).

Task: Return the score(s) for the given balanced parentheses string s.

Constraints (Typical):

• 1 <= s.length <= 10^5
• The string s is guaranteed to be balanced.