def getLargestNumber(num: str) -> str:
    odd = sorted([c for c in num if int(c) % 2 == 1], reverse=True)
    even = sorted([c for c in num if int(c) % 2 == 0], reverse=True)
    oi = ei = 0
    res = []
    for c in num:
        if int(c) % 2 == 1: res.append(odd[oi]); oi += 1
        else: res.append(even[ei]); ei += 1
    return ''.join(res)

class Solution {
    String getLargestNumber(String num) {
        List<Character> odd = new ArrayList<>(), even = new ArrayList<>();
        for (char c : num.toCharArray()) {
            if ((c - '0') % 2 == 1) odd.add(c); else even.add(c);
        }
        odd.sort(Comparator.reverseOrder());
        even.sort(Comparator.reverseOrder());
        StringBuilder sb = new StringBuilder();
        int oi = 0, ei = 0;
        for (char c : num.toCharArray()) {
            if ((c - '0') % 2 == 1) sb.append(odd.get(oi++));
            else sb.append(even.get(ei++));
        }
        return sb.toString();
    }
}

class Solution {
public:
    string getLargestNumber(string num) {
        vector<char> odd, even;
        for (char c : num) (c - '0') % 2 ? odd.push_back(c) : even.push_back(c);
        sort(odd.rbegin(), odd.rend());
        sort(even.rbegin(), even.rend());
        string res;
        int oi = 0, ei = 0;
        for (char c : num) res += (c - '0') % 2 ? odd[oi++] : even[ei++];
        return res;
    }
};

import urllib.request
import json

def getPhoneNumbers(country: str, phoneNumber: str) -> str:
    url = "https://jsonmock.hackerrank.com/api/countries?name=" + urllib.parse.quote(country)
    with urllib.request.urlopen(url) as resp:
        body = json.loads(resp.read())
    if not body.get("data"):
        return "-1"
    codes = body["data"][0].get("callingCodes", [])
    if not codes:
        return "-1"
    return "+" + codes[-1] + " " + phoneNumber

import java.net.URI;
import java.net.http.*;
import java.util.regex.*;

class Solution {
    String getPhoneNumbers(String country, String phoneNumber) throws Exception {
        String url = "https://jsonmock.hackerrank.com/api/countries?name=" + java.net.URLEncoder.encode(country, "UTF-8");
        HttpClient client = HttpClient.newHttpClient();
        HttpRequest req = HttpRequest.newBuilder().uri(URI.create(url)).build();
        String body = client.send(req, HttpResponse.BodyHandlers.ofString()).body();
        Matcher m = Pattern.compile("\"callingCodes\":\\[(.*?)\\]").matcher(body);
        if (!m.find()) return "-1";
        String inner = m.group(1).trim();
        if (inner.isEmpty()) return "-1";
        String[] codes = inner.replaceAll("\"", "").split(",");
        return "+" + codes[codes.length - 1].trim() + " " + phoneNumber;
    }
}

// C++ HTTP requires an external library (libcurl etc.). Pseudocode equivalent:
// fetch URL, JSON-parse "data[0].callingCodes", pick last entry, format result.
class Solution {
public:
    string getPhoneNumbers(string country, string phoneNumber) {
        // Use libcurl or other HTTP client to fetch the JSON; parse callingCodes; return.
        return "-1";  // placeholder; implement HTTP fetch with libcurl in production
    }
};

from typing import List

def minimalOperations(words: List[str]) -> List[int]:
    res = []
    for w in words:
        cnt = 0; i = 0
        while i < len(w):
            j = i
            while j < len(w) and w[j] == w[i]: j += 1
            cnt += (j - i) // 2
            i = j
        res.append(cnt)
    return res

class Solution {
    int[] minimalOperations(String[] words) {
        int[] res = new int[words.length];
        for (int k = 0; k < words.length; k++) {
            String w = words[k];
            int cnt = 0, i = 0;
            while (i < w.length()) {
                int j = i;
                while (j < w.length() && w.charAt(j) == w.charAt(i)) j++;
                cnt += (j - i) / 2;
                i = j;
            }
            res[k] = cnt;
        }
        return res;
    }
}

class Solution {
public:
    vector<int> minimalOperations(vector<string>& words) {
        vector<int> res;
        for (auto& w : words) {
            int cnt = 0, i = 0;
            while (i < (int)w.size()) {
                int j = i;
                while (j < (int)w.size() && w[j] == w[i]) j++;
                cnt += (j - i) / 2;
                i = j;
            }
            res.push_back(cnt);
        }
        return res;
    }
};