Strobogrammatic Number

class Solution {
public:
    bool isStrobogrammatic(string num) {
        unordered_map<char,char> rot = {{'0','0'},{'1','1'},{'8','8'},{'6','9'},{'9','6'}};
        int l = 0, r = num.size() - 1;
        while (l <= r) {
            auto it = rot.find(num[l]);
            if (it == rot.end() || it->second != num[r]) return false;
            ++l; --r;
        }
        return true;
    }
};

func isStrobogrammatic(num string) bool {
    rot := map[byte]byte{'0': '0', '1': '1', '8': '8', '6': '9', '9': '6'}
    l, r := 0, len(num)-1
    for l <= r {
        p, ok := rot[num[l]]
        if !ok || p != num[r] {
            return false
        }
        l++
        r--
    }
    return true
}

class Solution:
    def isStrobogrammatic(self, num: str) -> bool:
        rot = {'0': '0', '1': '1', '8': '8', '6': '9', '9': '6'}
        l, r = 0, len(num) - 1
        while l <= r:
            if num[l] not in rot or rot[num[l]] != num[r]:
                return False
            l += 1
            r -= 1
        return True

function isStrobogrammatic(num) {
    const rot = { '0': '0', '1': '1', '8': '8', '6': '9', '9': '6' };
    let l = 0, r = num.length - 1;
    while (l <= r) {
        if (!(num[l] in rot) || rot[num[l]] !== num[r]) return false;
        l++;
        r--;
    }
    return true;
}

class Solution {
    public boolean isStrobogrammatic(String num) {
        Map<Character, Character> rot = new HashMap<>();
        rot.put('0', '0');
        rot.put('1', '1');
        rot.put('8', '8');
        rot.put('6', '9');
        rot.put('9', '6');
        int l = 0, r = num.length() - 1;
        while (l <= r) {
            Character p = rot.get(num.charAt(l));
            if (p == null || p != num.charAt(r)) return false;
            l++;
            r--;
        }
        return true;
    }
}

function isStrobogrammatic(num: string): boolean {
    const rot: Record<string, string> = { '0': '0', '1': '1', '8': '8', '6': '9', '9': '6' };
    let l = 0, r = num.length - 1;
    while (l <= r) {
        if (!(num[l] in rot) || rot[num[l]] !== num[r]) return false;
        l++;
        r--;
    }
    return true;
}