Amdocs | SDE | OA | Coding Round

Problem: Extraordinary Substrings The Objective: Given a string input_str, count the total number of non-empty extraordinary substrings. A substring is "extraordinary" if the sum of the mapped numerical values of its characters is exactly divisible by its length. The Mapping Table Each lowercase English character is mapped to a digit 1−9 as follows: 1: a, b 2: c, d, e 3: f, g, h 4: i, j, k 5: l, m, n 6: o, p, q 7: r, s, t ...