Full Course: https://takeuforward.org/striv....ers-a2z-dsa-course/s 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: https://takeuforward.org/data-....structure/count-digi a Number: https://takeuforward.org/c-pro....grams/reverse-a-numb Palindrome: https://takeuforward.org/data-....structure/check-if-a or HCF: https://takeuforward.org/data-....structure/find-gcd-o Number: https://takeuforward.org/maths..../check-if-a-number-i all Divisors: https://takeuforward.org/data-....structure/print-all- for prime: https://takeuforward.org/data-....structure/check-if-a the problems here: Count Digits: https://bit.ly/3X17nIrReverse Number: https://bit.ly/3vCeBXSPalindrome: https://bit.ly/3vylgCiArmstrong: https://bit.ly/3vBfkbDPrint Divisors: https://bit.ly/3vzQ7yrCheck Prime: https://bit.ly/3ZdiWOOHCF/GCD: https://bit.ly/3GB4Mj8 In case you are thinking to buy courses, please check below: Link to get 20% additional Discount at Coding Ninjas: https://bit.ly/3wE5aHxYou can follow me across social media, all my handles are below: Linkedin/Instagram/Telegram: https://linktr.ee/takeUforward