Company: grow_25sep
Difficulty: medium
Maximum Mod Value Problem Description Given is a string S consisting of digits. You must break down the string into 2 non-empty parts. Let the number represented by the left part be A and the number represented by the right part be B . Find the maximum value of {(A%7) x (B%7)} . Function Description In the provided code snippet, implement the provided maxmod(...) method to find the maximum value of {(A%7) x (B%7)} . You can write your code in the space below the phrase "WRITE YOUR LOGIC HERE". There will be multiple test cases running so the Input and Output should match exactly as provided. The base Output variable result is set to a default value of -404 which can be modified. Additionally, you can add or remove these output variables. Input Format The first line contains the string, denoting S . Examples Example 1: Input: S = "125" Output: 25 Explanation: S = "125" We can break down S into "12" and "5". A = 12 and B = 5 . Here, we have 12%7 = 5 and 5%7 = 5 , and the product {(12%7)