1807. Evaluate the Bracket Pairs of a String

class Solution {
    public String evaluate(String s, List<List<String>> knowledge) {
        Map<String, String> map = new HashMap<>();
        for (List<String> pair : knowledge) {
            map.put(pair.get(0), pair.get(1));
        }
        StringBuilder result = new StringBuilder();
        int i = 0;
        while (i < s.length()) {
            if (s.charAt(i) == '(') {
                int j = i + 1;
                while (s.charAt(j) != ')') {
                    j++;
                }
                String key = s.substring(i + 1, j);
                result.append(map.getOrDefault(key, "?"));
                i = j + 1;
            } else {
                result.append(s.charAt(i));
                i++;
            }
        }
        return result.toString();
    }
}

class Solution:
    def evaluate(self, s, knowledge):
        mp = {key: value for key, value in knowledge}

        result = []
        i = 0

        while i < len(s):
            if s[i] == '(':
                j = i + 1

                while s[j] != ')':
                    j += 1

                key = s[i + 1:j]
                result.append(mp.get(key, '?'))

                i = j + 1
            else:
                result.append(s[i])
                i += 1

        return ''.join(result)

class Solution {
public:
    string evaluate(string s, vector<vector<string>>& knowledge) {
        unordered_map<string, string> mp;

        for (auto& pair : knowledge) {
            mp[pair[0]] = pair[1];
        }

        string result;
        int i = 0;

        while (i < s.size()) {
            if (s[i] == '(') {
                int j = i + 1;

                while (s[j] != ')') {
                    j++;
                }

                string key = s.substr(i + 1, j - i - 1);

                if (mp.count(key))
                    result += mp[key];
                else
                    result += '?';

                i = j + 1;
            } else {
                result += s[i];
                i++;
            }
        }

        return result;
    }
};

class Solution {
    evaluate(s, knowledge) {
        const map = new Map();

        for (const [key, value] of knowledge) {
            map.set(key, value);
        }

        let result = "";
        let i = 0;

        while (i < s.length) {
            if (s[i] === '(') {
                let j = i + 1;

                while (s[j] !== ')') {
                    j++;
                }

                const key = s.substring(i + 1, j);
                result += map.has(key) ? map.get(key) : "?";

                i = j + 1;
            } else {
                result += s[i];
                i++;
            }
        }

        return result;
    }
}