Special Binary String solution and explanation

def makeLargestSpecial(s: str) -> str:
    count = i = 0
    res = []
    for j, c in enumerate(s):
        if c == '1':
            count += 1
        else:
            count -= 1
        if count == 0:
            res.append('1' + makeLargestSpecial(s[i + 1:j]) + '0')
            i = j + 1
    return ''.join(sorted(res, reverse=True))

import java.util.ArrayList;
import java.util.Collections;

class Solution {
    public String makeLargestSpecial(String s) {
        int count = 0, i = 0;
        ArrayList<String> res = new ArrayList<>();
        for (int j = 0; j < s.length(); j++) {
            if (s.charAt(j) == '1') count++;
            else count--;
            if (count == 0) {
                res.add('1' + makeLargestSpecial(s.substring(i + 1, j)) + '0');
                i = j + 1;
            }
        }
        Collections.sort(res, Collections.reverseOrder());
        return String.join("", res);
    }
}

#include <vector>
#include <string>
#include <algorithm>

class Solution {
public:
    std::string makeLargestSpecial(std::string s) {
        int count = 0, i = 0;
        std::vector<std::string> res;
        for (int j = 0; j < s.size(); ++j) {
            s[j] == '1' ? ++count : --count;
            if (count == 0) {
                res.push_back("1" + makeLargestSpecial(s.substr(i + 1, j - i - 1)) + "0");
                i = j + 1;
            }
        }
        std::sort(res.begin(), res.end(), std::greater<std::string>());
        return std::accumulate(res.begin(), res.end(), std::string(""));
    }
};

var makeLargestSpecial = function(s) {
    let count = 0, i = 0;
    let res = [];
    for (let j = 0; j < s.length; j++) {
        s.charAt(j) === '1' ? count++ : count--;
        if (count === 0) {
            res.push('1' + makeLargestSpecial(s.substring(i + 1, j)) + '0');
            i = j + 1;
        }
    }
    res.sort((a, b) => b.localeCompare(a));
    return res.join('');
};

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <stdbool.h>

// Function prototypes
char* makeLargestSpecial(const char* s);

// Utility function
int compare(const void* a, const void* b) {
    return strcmp(*(const char**)b, *(const char**)a);
}

char* makeLargestSpecial(const char* s) {
    int len = strlen(s);
    int count = 0, i = 0, subIndex = 0;
    char** substrings = (char**)malloc(len / 2 * sizeof(char*));
    char* res = (char*)malloc(len + 1);

    for (int j = 0; j < len; j++) {
        s[j] == '1' ? count++ : count--;
        if (count == 0) {
            int size = j - i + 1;
            char* sub = (char*)malloc(size + 1);
            snprintf(sub, size + 1, "1%s0", makeLargestSpecial(s + i + 1));
            substrings[subIndex++] = sub;
            i = j + 1;
        }
    }

    qsort(substrings, subIndex, sizeof(char*), compare);

    res[0] = '\0';
    for (int k = 0; k < subIndex; k++) {
        strcat(res, substrings[k]);
        free(substrings[k]);
    }
    free(substrings);
    return res;
}

using System;
using System.Collections.Generic;
using System.Linq;

public class Solution {
    public string MakeLargestSpecial(string s) {
        int count = 0, i = 0;
        List<string> res = new List<string>();
        for (int j = 0; j < s.Length; j++) {
            if (s[j] == '1') count++;
            else count--;
            if (count == 0) {
                res.Add('1' + MakeLargestSpecial(s.Substring(i + 1, j - i - 1)) + '0');
                i = j + 1;
            }
        }
        res.Sort((a, b) => string.Compare(b, a));
        return string.Concat(res);
    }
}

function makeLargestSpecial(s: string): string {
    if (s.length === 0) {
        return '';
    }

    const ans: string[] = [];
    let cnt = 0;

    for (let i = 0, j = 0; i < s.length; ++i) {
        cnt += s[i] === '1' ? 1 : -1;
        if (cnt === 0) {
            const t = '1' + makeLargestSpecial(s.substring(j + 1, i)) + '0';
            ans.push(t);
            j = i + 1;
        }
    }

    ans.sort((a, b) => b.localeCompare(a));
    return ans.join('');
}

func makeLargestSpecial(s string) string {
	if s == "" {
		return ""
	}
	ans := sort.StringSlice{}
	cnt := 0
	for i, j := 0, 0; i < len(s); i++ {
		if s[i] == '1' {
			cnt++
		} else {
			cnt--
		}
		if cnt == 0 {
			ans = append(ans, "1"+makeLargestSpecial(s[j+1:i])+"0")
			j = i + 1
		}
	}
	sort.Sort(sort.Reverse(ans))
	return strings.Join(ans, "")
}