<commit_before>package leetcode;

/**
 * https://leetcode.com/problems/minimum-cost-tree-from-leaf-values/
 */
public class Problem1130 {
    public int mctFromLeafValues(int[] arr) {
        // TODO
        return 0;
    }

    public static void main(String[] args) {
        Problem1130 prob = new Problem1130();
    }
}<commit_msg>Update problem 1130<commit_after>package leetcode;

/**
 * https://leetcode.com/problems/minimum-cost-tree-from-leaf-values/
 */
public class Problem1130 {
    public int mctFromLeafValues(int[] arr) {
        // TODO
        return 0;
    }

    public static void main(String[] args) {
        Problem1130 prob = new Problem1130();
        System.out.println(prob.mctFromLeafValues(new int[]{6, 2, 4})); // 32
    }
}
{'fraction_non_alphanumeric': 0.13527851458885942, 'fraction_numerical': 0.046419098143236075, 'mean_word_length': 2.700980392156863, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 2, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '6632660', 'n_tokens_mistral': 274, 'n_tokens_neox': 245, 'n_words': 51}