Toptube Video Search Engine



Title:Basic Maths for DSA | Euclidean Algorithm | Strivers A2Z DSA Course
Duration:01:03:20
Viewed:599,651
Published:08-01-2023
Source:Youtube

Full Course: https://takeuforward.org/strivers-a2z-dsa-course/strivers-a2z-dsa-course-sheet-2/ 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-digits-in-a-number/ Reverse a Number: https://takeuforward.org/c-programs/reverse-a-number-in-c/ Check Palindrome: https://takeuforward.org/data-structure/check-if-a-number-is-palindrome-or-not/ Gcd or HCF: https://takeuforward.org/data-structure/find-gcd-of-two-numbers/ Armstrong Number: https://takeuforward.org/maths/check-if-a-number-is-armstrong-number-or-not/ Print all Divisors: https://takeuforward.org/data-structure/print-all-divisors-of-a-given-number/ Check for prime: https://takeuforward.org/data-structure/check-if-a-number-is-prime-or-not/ Submit the problems here: Count Digits: https://bit.ly/3X17nIr Reverse Number: https://bit.ly/3vCeBXS Palindrome: https://bit.ly/3vylgCi Armstrong: https://bit.ly/3vBfkbD Print Divisors: https://bit.ly/3vzQ7yr Check Prime: https://bit.ly/3ZdiWOO HCF/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/3wE5aHx You can follow me across social media, all my handles are below: Linkedin/Instagram/Telegram: https://linktr.ee/takeUforward



SHARE TO YOUR FRIENDS


Download Server 1


DOWNLOAD MP4

Download Server 2


DOWNLOAD MP4

Alternative Download :