<commit_before>/***
 * Divide two integers without using multiplication, division and mod operator.
 *
 * If it is overflow, return MAX_INT.
 */
public class Solution {
    public int divide(int dividend, int divisor) {
        long a = dividend >= 0 ? dividend : - (long) dividend;
        long b = divisor >= 0 ? divisor : - (long) divisor;<commit_msg>add DivideTwoIntegers.java<commit_after>/***
 * Divide two integers without using multiplication, division and mod operator.
 *
 * If it is overflow, return MAX_INT.
 */
public class Solution {
    // T O(long n), S(1)
    public int divide(int dividend, int divisor) {
        long a = dividend >= 0 ? dividend : - (long) dividend;
        long b = divisor >= 0 ? divisor : - (long) divisor;
{'fraction_non_alphanumeric': 0.11528150134048257, 'fraction_numerical': 0.006702412868632708, 'mean_word_length': 3.0597826086956523, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 7, 'https://': 0, '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': '1838927', 'n_tokens_mistral': 232, 'n_tokens_neox': 205, 'n_words': 84}