Company: Meesho_14sep
Difficulty: medium
Unique String Arrangements Problem Description In the futuristic city of Nexus Prime, a tech organization stores large amounts of encrypted data files. Each file is a string S, scrambled using different arrangements of letters, creating unique encryption patterns. Dr. Axiom, the lead researcher, wants to figure out how many different ways a file can be scrambled (encrypted). As the size of the files grows, Dr. Axiom must find a fast way to count all possible unique arrangements of characters in the file. Your task is to help Dr. Axiom by writing a program that, given a string S (representing the encrypted file), calculates how many unique ways the letters in the string can be rearranged. Return the answer modulo 10 9 + 7. For example, if the string is "hidden code", there are many possible ways to rearrange the letters, like "hidden code", "hiddn code", "hidden hode", "denh code", and more. Your goal is to find out how many such unique arrangements exist. Input Format The first and onl