Best Java Solution || Beats 100%
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n\n    // taken help\n    public String baseNeg2(int n) {\n        StringBuilder sc = new StringBuilder();\n        int rem;\n        int b = -2;\n        if(n == 0) sc.append(\'0\');\n        \n        while(n != 0){\n            rem = n % b;\n            n /= b;\n            if(rem < 0){\n                rem -= b;\n                n++;\n            }\n            sc.append(rem);\n        }\n        return sc.reverse().toString();\n    }\n}\n```
['Java']