Optimized solution for Finding whether a given number is Perfect number or not

[KingpinDk]

PERFECT NUMBER In number theory, a perfect number is a positive integer that is equal to the sum of its positive divisors, excluding the number itself. Here the problem is to find whether a given number is Perfect number or not. Here the present solution lack some necessary comments to be added along with optimizing the solution from O(n) to O(sqrt(n)). So, I would like to optimize this solution

[Soumya6Tiwari]

@Kumar-laxmi sir kindly assign me this issue. I can solve it using c, c++, Java According to it, example of a perfect number is 6 where 6 is equal to the sun of its positive divisors ie (1+2+3=6) leaving the number itself. Sir kindly assign this question to me.

[mavihsrr]

@Kumar-laxmi i would like to work on this, can you please assign it to me! i will implement it using c++ and python

[vivekpal24]

Could you please assigm this to me i can solve this problem in C,Cpp,Python.

[github-actions[bot]]

Stale issue message