i came across a string problem where i thought of an approach where the number of operations i am doing is equal to sum of all factors of n. Now i don't know if this will pass the time limit. Can anybody help? what will be the time complexity of such operation