scala solution
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```\nobject Solution {\n  def stringCount(n: Int): Int = {\n    if(n < 4)  0\n    else {\n      val mod = 1000000007\n      val total = BigInt ("26").pow(n)\n      val l0 = BigInt ("25").pow(n)\n      val t0 = BigInt ("25").pow(n)\n      val e01 = BigInt ("25").pow(n) + BigInt ("25").pow(n - 1) * BigInt (n.toString)\n      val l0t0 = BigInt ("24").pow(n)\n      val l0e01 = BigInt ("24").pow(n) + BigInt ("24").pow(n - 1) * BigInt (n.toString)\n      val t0e01 = BigInt ("24").pow(n) + BigInt ("24").pow(n - 1) * BigInt (n.toString)\n      val l0t0e01 = BigInt ("23").pow(n) + BigInt ("23").pow(n - 1) * BigInt (n.toString)\n      ((total - l0 - t0 - e01 + l0e01 + l0t0 + t0e01 - l0t0e01) % mod).toInt\n    }\n  }\n}\n```
['Scala']