Full Course: [a]https%3A%2F%2Ftakeuforward.org%2Fstrivers-a2z-dsa-course%2Fstrivers-a2z-dsa-course-sheet-2%2F[/a] There is a slight mistake on the logic of Armstrong, it will be 1634 = (1^4 + 6^4 + 3^4 + 4^4), basically digits raised to the power count of digits, so sum = sum + pow(ld, cntDigits) will be the change, where the cntDigits is the number of digits. Notes:Count Digits: [a]https%3A%2F%2Ftakeuforward.org%2Fdata-structure%2Fcount-digits-in-a-number%2FReverse[/a] a Number: [a]https%3A%2F%2Ftakeuforward.org%2Fc-programs%2Freverse-a-number-in-c%2FCheck[/a] Palindrome: [a]https%3A%2F%2Ftakeuforward.org%2Fdata-structure%2Fcheck-if-a-number-is-palindrome-or-not%2FGcd[/a] or HCF: [a]https%3A%2F%2Ftakeuforward.org%2Fdata-structure%2Ffind-gcd-of-two-numbers%2FArmstrong[/a] Number: [a]https%3A%2F%2Ftakeuforward.org%2Fmaths%2Fcheck-if-a-number-is-armstrong-number-or-not%2FPrint[/a] all Divisors: [a]https%3A%2F%2Ftakeuforward.org%2Fdata-structure%2Fprint-all-divisors-of-a-given-number%2FCheck[/a] for prime: [a]https%3A%2F%2Ftakeuforward.org%2Fdata-structure%2Fcheck-if-a-number-is-prime-or-not%2FSubmit[/a] the problems here: Count Digits: [a]https%3A%2F%2Fbit.ly%2F3X17nIrReverse[/a] Number: [a]https%3A%2F%2Fbit.ly%2F3vCeBXSPalindrome%3A[/a] [a]https%3A%2F%2Fbit.ly%2F3vylgCiArmstrong%3A[/a] [a]https%3A%2F%2Fbit.ly%2F3vBfkbDPrint[/a] Divisors: [a]https%3A%2F%2Fbit.ly%2F3vzQ7yrCheck[/a] Prime: [a]https%3A%2F%2Fbit.ly%2F3ZdiWOOHCF%2FGCD%3A[/a] [a]https%3A%2F%2Fbit.ly%2F3GB4Mj8[/a] In case you are thinking to buy courses, please check below: Link to get 20% additional Discount at Coding Ninjas: [a]https%3A%2F%2Fbit.ly%2F3wE5aHxYou[/a] can follow me across social media, all my handles are below: Linkedin/Instagram/Telegram: [a]https%3A%2F%2Flinktr.ee%2FtakeUforward[/a]