First Unique Character

import java.util.*;
class Solution {
    public int first_unique_character(String s) {
        Map<Character, Integer> count = new LinkedHashMap<>();
        for (char c : s.toCharArray()) count.merge(c, 1, Integer::sum);
        for (int i = 0; i < s.length(); i++) {
            if (count.get(s.charAt(i)) == 1) return i;
        }
        return -1;
    }
}

function first_unique_character(...args) {
    const s = args.length === 1 ? args[0] : args.join("");
    const count = {};
    for (const c of s) count[c] = (count[c] || 0) + 1;
    for (let i = 0; i < s.length; i++) {
        if (count[s[i]] === 1) return i;
    }
    return -1;
}

<?php
function first_unique_character(...$args) {
    $s = count($args) === 1 ? $args[0] : implode("", $args);
    $count = array_count_values(str_split($s));
    for ($i = 0; $i < strlen($s); $i++) {
        if ($count[$s[$i]] === 1) return $i;
    }
    return -1;
}
?>

def first_unique_character(*args) -> int:
    s = args[0] if len(args) == 1 else "".join(args)
    count = {}
    for c in s:
        count[c] = count.get(c, 0) + 1
    for i, c in enumerate(s):
        if count[c] == 1:
            return i
    return -1

use std::collections::HashMap;
fn first_unique_character(s: String) -> i32 {
    let mut count: HashMap<char, i32> = HashMap::new();
    for c in s.chars() {
        *count.entry(c).or_insert(0) += 1;
    }
    for (i, c) in s.chars().enumerate() {
        if *count.get(&c).unwrap_or(&0) == 1 {
            return i as i32;
        }
    }
    -1
}

function first_unique_character(...args: any[]): number {
    var s: string = args.length === 1 ? args[0] : args.join("");
    var count: { [key: string]: number } = {};
    var i: number;
    for (i = 0; i < s.length; i++) {
        var ch = s.charAt(i);
        count[ch] = (count[ch] || 0) + 1;
    }
    for (i = 0; i < s.length; i++) {
        if (count[s.charAt(i)] === 1) return i;
    }
    return -1;
}