For this Question: Given a string s of lower and upper case English letters.

A good string is a string which doesn't have two adjacent characters s[i] and s[i + 1] where:

0 <= i <= s. length - 2
s[i] is a lower- case letter and s[i + 1] is the same letter but in upper- case or vice- versa.
To make the string good, you can choose two adjacent characters that make the string bad and remove them. You can keep doing this until the string becomes good.

Return the string after making it good. The answer is guaranteed to be unique under the given constraints.

Notice that an empty string is also good.There is an string s is given in first line of input.
1 <= s. length <= 100
s contains only lower and upper case English lettersReturn the string after making it good. 
The answer is guaranteed to be unique under the given constraints.Sample Input:
leEeetcode
Sample Output:
leetcode

Explanation: In the first step, either you choose i = 1 or i = 2, both will result "leEeetcode" to be reduced to "leetcode"., I have written this Solution Code: import java.io.*;
import java.util.*;



class Main {
    public static void main (String[] args) {
         Scanner sc = new Scanner(System.in);
        String s = sc.nextLine();
        int l = s.length();


         Stack<Character> stack= new Stack<Character>();
        for(int i=0;i<l;i++)
        {
            if((!stack.isEmpty()) && Math.abs(stack.peek()-s.charAt(i))==32 )
                stack.pop();
            else
                stack.push(s.charAt(i));
        }
        char res[]= new char[stack.size()];

        for(int i=res.length-1;i>=0;i--)
            res[i]= stack.pop();
        System.out.println(res);
    }
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?