Python Solution Brute Force
Upvote if you like the solution\n\n\nclass Solution:\n    def abbreviateProduct(self, left: int, right: int) -> str:\n        value = 1\n        count = 0\n    
**Upvote if you like the solution**\n```\n\nclass Solution:\n    def abbreviateProduct(self, left: int, right: int) -> str:\n        value = 1\n        count = 0\n        for i in range(left,right+1):\n            value*=i                # calculation of product value from left to right\n        string = str(value)\n        for j in string[::-1]:\n            if(j == \'0\'):\n                count+=1            # counting suffix zeros(trailing zeros)\n            else:\n                break\n        length = len(string)        # Total length of product\n        len_digit = length-count    # Length of product neglecting trailing zeros\n        if(\'0\' in string and len(string[0:len_digit]) <= 10):   # If length without zeros less than 10\n            return string[0:len_digit]+\'e\'+str(count)\n        elif(\'0\' in str(value) and len(string[0:len_digit]) > 10):  # If length without zeros greater than 10\n            return str(value)[0:5]+\'...\'+str(value)[0:len_digit][-5:]+\'e\'+str(count)\n        else:\n            return str(value)+\'e0\'      # If no trailing zeros\n\n```\n\n**Thank You**
['Python']