CRispy solution
Complexity\n- Time complexity:O(log(n))\n Add your time complexity here, e.g. O(n) \n\n- Space complexity:O(1)\n Add your space complexity here, e.g. O(n) \n\n#
# Complexity\n- Time complexity:$$O(log(n))$$\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:$$O(1)$$\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    private long pow(long x, long n, long MOD){\n        long res =1, p = x%MOD;\n        while(n!= 0){\n            if((n&1) != 0){\n                res = (res*p)%MOD;\n            }\n            p = (p*p)%MOD;\n            n >>= 1;\n        }\n        return res;\n    }\n\n\n    public int stringCount(int n) {\n        long MOD = 1_000_000_007;\n        return (int)((( + pow(26, n, MOD)\n                        - (n+75) * pow(25, n-1, MOD)\n                        + (2*n + 72) * pow(24, n-1, MOD)\n                        - (n+23) * pow(23, n-1, MOD))%MOD + MOD)%MOD);\n    }\n}\n```
['Java']