String str = "eeksforGeeks";
String str2 = '[' + '[' + str;// first two operands is char so it becomes an int
System.out.println(str2);
str2 = '[' + str;// string gets concatenated with char and returns a string
System.out.println(str2);
str2 = 'a' + "" + 'b';// Trick to convert concatenated chars to a string where "" has to be put among the first two operands
System.out.println(str2);
str2 = 'a' + 'b' + "";// chars get converted to int instead because "" is not among the first two operands
System.out.println(str2);
str2 = str + 's' + 's';// concatenated successfully to string str
System.out.println(str2);
str2 = "" + 's' + 'a' + 'd';// Once it is converted to a string through "" we can add multiple chars to it in the same statement
System.out.println(str2);

String str = "eeksforGeeks";
String str2 = '[' + '[' + str;// first two operands is char so it becomes an int
System.out.println(str2);
str2 = '[' + str;// string gets concatenated with char and returns a string
System.out.println(str2);
str2 = 'a' + "" + 'b';// Trick to convert concatenated chars to a string where "" has to be put among the first two operands
System.out.println(str2);
str2 = 'a' + 'b' + "";// chars get converted to int instead because "" is not among the first two operands
System.out.println(str2);
str2 = str + 's' + 's';// concatenated successfully to string str
System.out.println(str2);
str2 = "" + 's' + 'a' + 'd';// Once it is converted to a string through "" we can add multiple chars to it in the same statement
System.out.println(str2);

public static int divide(int dividend, int divisor) {
        int answer = 0, negative = 0;
        if ((dividend < 0) && (divisor > 0))
            negative = 1;
        if ((dividend == (1 << 31)) && (divisor == -1))
            answer = ((1 << 31) - 1);
        else {
            dividend = Math.abs(dividend);
            divisor = Math.abs(divisor);
            while (dividend - divisor > 0) {// we cannot do dividend>divisor for the dividend = int_min and divisor = 1
                                            // case
                int temp_divisor = divisor, counter = 0;
                for (; (counter <= 31) && (dividend - temp_divisor >= 0); counter++) {
                    if (counter == 30) {
                        System.out.println("Edge case executed");
                        counter++;
                        temp_divisor = dividend + 1;
                        break;
                    }
                    temp_divisor = temp_divisor << 1;
                    System.out.println("temp_divisor is: " + temp_divisor + " power of 2 is: " +
                            (counter + 1) + " counter is: " + counter);
                }
                if (temp_divisor != Integer.MAX_VALUE) {
                    counter--;
                    temp_divisor = temp_divisor >> 1;
                }
                dividend -= temp_divisor;
                answer += (Math.pow((int) 2, (int) counter));
                System.out.println(temp_divisor);
                System.out.println(dividend);
                System.out.println(answer);
                System.out.println(counter + "\n");
            }
        }
        if (negative == 1) {
            System.out.println("negated");
            answer *= -1;
        }
        return answer;
    }

public static int divide(int dividend, int divisor) {
        int answer = 0, negative = 0;
        if ((dividend < 0) && (divisor > 0))
            negative = 1;
        if ((dividend == (1 << 31)) && (divisor == -1))
            answer = ((1 << 31) - 1);
        else {
            dividend = Math.abs(dividend);
            divisor = Math.abs(divisor);
            while (dividend - divisor > 0) {// we cannot do dividend>divisor for the dividend = int_min and divisor = 1
                                            // case
                int temp_divisor = divisor, counter = 0;
                for (; (counter <= 31) && (dividend - temp_divisor >= 0); counter++) {
                    if (counter == 30) {
                        System.out.println("Edge case executed");
                        counter++;
                        temp_divisor = dividend + 1;
                        break;
                    }
                    temp_divisor = temp_divisor << 1;
                    System.out.println("temp_divisor is: " + temp_divisor + " power of 2 is: " +
                            (counter + 1) + " counter is: " + counter);
                }
                if (temp_divisor != Integer.MAX_VALUE) {
                    counter--;
                    temp_divisor = temp_divisor >> 1;
                }
                dividend -= temp_divisor;
                answer += (Math.pow((int) 2, (int) counter));
                System.out.println(temp_divisor);
                System.out.println(dividend);
                System.out.println(answer);
                System.out.println(counter + "\n");
            }
        }
        if (negative == 1) {
            System.out.println("negated");
            answer *= -1;
        }
        return answer;
    }