Basic Maths for DSA | Euclidean Algorithm | Strivers A2Z DSA Course
Vložit
- čas přidán 13. 07. 2024
- Full Course: takeuforward.org/strivers-a2z...
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: takeuforward.org/data-structu...
Reverse a Number: takeuforward.org/c-programs/r...
Check Palindrome: takeuforward.org/data-structu...
Gcd or HCF: takeuforward.org/data-structu...
Armstrong Number: takeuforward.org/maths/check-...
Print all Divisors: takeuforward.org/data-structu...
Check for prime: takeuforward.org/data-structu...
Submit the problems here:
Count Digits: bit.ly/3X17nIr
Reverse Number: bit.ly/3vCeBXS
Palindrome: bit.ly/3vylgCi
Armstrong: bit.ly/3vBfkbD
Print Divisors: bit.ly/3vzQ7yr
Check Prime: bit.ly/3ZdiWOO
HCF/GCD: bit.ly/3GB4Mj8
In case you are thinking to buy courses, please check below:
Link to get 20% additional Discount at Coding Ninjas: bit.ly/3wE5aHx
You can follow me across social media, all my handles are below:
Linkedin/Instagram/Telegram: linktr.ee/takeUforward
Let's march ahead, and create an unmatchable DSA course! ❤
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.
Do consider to give us a like, and a subscribe, means a world to us..
Bhaiya i have good foundation in java can I do these sheet in java lang
@@himanshusharma3382 Han bhai mil ke try karte hai main bhi java Bala hi hun par bhaiya ne bola concept toh same hai par kahi kahi toda muskil hota hai cause c++ ke kuch function java mai nahi hai par toda manage karna padega
@@brajeshmohanty2558 yes bro... functions and Collection frameworks implementation syntax vgera b thora different rehta hai. .. ek group discord telegram ya kuch b bnalo Java k liye best rhega..discussion help vgera and sath m A2Z sheet solve krenge toh consistency b bni rhegi..
@@arunn121 dekh bro mid Jan se toh mera end sem hai tu bana le merko add kar dena
@@techyouknow8026 lol frequency, bro the entire sheet is at your hand, you can do it by self also, simple google search will give you answers if you stuck, but the thing is, you just want to be a keyboard warrior.
The though topics are fully covered, so stop crying, I will upload at my speed, because I have a full time job, its not easy to work 9 hours and then create content.
We are so fortunate to live in an era where striver lives........
❤ from Andhra Anna ......
striver bro andhra na bro
Iam also from Andhra Pradesh, Vijayawada
@@Md_sadiq_Md avunu bro maa kulapodey
@@rgvcultman Ok
Enjoy
I'm from Andhra Pradesh, when I decided to learn DSA I searched a lot of streams, but I'm still stuck somewhere. After Watching your videos, it's just awesome. It very much helpful to beginners like me.... Thank you so much sir. After this I'm become a fan of striver......
Which college are you
Are you from ap ?
Yee college meru
Iam also from Andhra Pradesh
From Vijayawada, VR Siddhartha Engineering College ❤
For all those that couldnt get the 1634 test case right in the armstrong questoin, the power of each digit is equal to the no. of digits in the number
for example :
if it is a 4 digit number (1634) , then (1^4)+(6^4)+(3^4)+(4^4)=1634
if it is 3 digit then instead of 4 power will be 3
heres the code:
#include
bool checkArmstrong( int n)
{ string digits=to_string(n);
int digitcount=digits.size();
int num=n;
int r=0;
int pal=0;
while(n>0)
{
r=n%10;
pal=pow(r,digitcount)+pal;
n=n/10;
}
if(pal==num)
{
return true;
}
else
return false;
}
might not be optimal but it is how i tried and it works
yeah u r right even i got this mistake in most of the google search results but chatgpt and gfg gave me the right answer
is this correct as well ?? what about time complexity???
{ int i=0;
int N = 371;
int duplicateOfN1 = N;
int d2 = N;
while(N>0)
{
N=N/10;
i++;
}
int sum = 0;
int digitcount=i;
while(duplicateOfN1>0)
{
int lastdigit = duplicateOfN1%10;
duplicateOfN1 = duplicateOfN1/10;
sum = sum+((int)Math.pow(lastdigit, digitcount));
}
if(sum==d2)
System.out.println("it is an armstrong number");
else
System.out.println("it is not an armstrong number");
}
Actually power =number of digits in the number so try with power 4 it will work .
Thanks it helped
thanks bro!
Thanks a lot for your effort Striver! Best explanation for GCD algo so far I've seen!
Thanks a lot Striver for this amazing content. Honestly, the simplicity and the way of enplaning algorithm by breaking them down does help a lot of Beginner Folks to grasp DSA concepts.
Understood Striver :)
I'm from a tear-3 college, current i am 6th sem. Student and i followed your videos and your A2Z DSA playlist is amazing bcz everything is well structured and easy to understand, your way of explaining is truly amazing, Thanku striver ❤, huge respect brother and keep make it more DSA video and guide us.
tier*
He meant tear only 🥲@@a_maxed_out_handle_of_30_chars
which college ?
HEY Striver ! You are just amazing .The simplicity your course has it's too easy for the beginner to grasp the knowledge Thanks man !
You are just amazing bro,Never seen such intellectual person with a clear explanation.
I started preparing DSA and Take you forward is a life saviour! Lots of love Striver.
Congrats Striver for 300K Sub. Let's hope striver see's this comment.
Aniket er bari giye
Aniket er barite code chapo
Have seen many DSA courses, none of them taught me math and DSA techniques in so much detail. Very Helpful Thank you!
Within first 5 minutes I realised the value these videos will be adding in the coding journey of the geeks !!
23:55
One correction !!
Armstrong number is the number in any given number base, which forms the total of the same number, when each of its digits is raised to the power of the number of digits in the number.
1634 is not equal to 1^3 + 6^3 + 3^3 + 4^3
it is equal to 1^4 + 6^4 + 3^4 + 4^4
Can u provide the code for it am doing cmath and using pow function to use the number of powers equal to total no. Of digits but in 1634 its giving false
Hi @Raj, Thanks a lot for all your efforts, I am one of the people who are benefitting from your Sde sheet and your youtube videos, also I feel you deserve the name striver. you are the real savior for many people like me.
May god bless you... and you are a pious soul for sure.
Thanks striver..
Understood! Super fantastic explanation as always, thank you very much!!
Sir upload videos as much as possible, as our placement season starts from June .Hope I will learn maximum till June 💝💝💝💝💝💝💝💝💝💝😭😭😭😭
Bro did you get placed?
ya bro in toshiba software @@Tihorcreation
@@Tihorcreation💀
You seem to be under the weather. And yet you are teaching, making videos with such effort making it look effortless. Hats off!
Thank you for creating such valuable and informative content! It's greatly appreciated.
Your video playlist is so super easy when I decide to learn the Dsa I searched a lot of sites or CZcams but your way and teaching is amazing and the Practicing on Note is so brilliant ❤
Finally, here we go ! Thank you very much striver !!! 🤩🥳🔥❤️
I already have been read advanced dsa, because of striver's teaching pattern I watched this complete lecture ,even I knew all these topics instead learn something. That's how this bootcamp is game changer for all beginner ninja's who want to live conding
Thanks a lot Striver!! you make very stuff so easy to understand in simple terms..
The amount of effort you put into each of your video🙌
Amazing. I loved the GCD part, understood very well. Thank you so much
Hi @Raj sir. Thanks for the video also Congratulations for your 300k subscribers. Looking forward for your more wonderful videos. Truly enjoying. ❤
Striver your video is superb.. and in each video you taught in a very energetic way which makes your video very interesting. All the part in the video is amazing but the last.. i.e. Euclidean’s theorem and reducing loop by half by sqrt.. method is wonderfull.. Now, I try to build-up this type of logic in every Q. to reduce time & space complexity. Thankyou Striver ❤
Sir, you are helping me in doing hard work and making me experience the relief after doing the hard work we get
Thanks for all your support
Only have one request. I know you have been trying to make videos as fast as you can, but actually the placement is in the next 6-7 months, so if you can try to upload the beginner part as soon as possible, it would be beneficial to move for the other playlist of you which you have been uploaded in the past about different topics.
Thank you for all the resources bhaiya(sir).
Did you complete all topics?
understood, this guy is an absolute champion!
1.3 - C++ STL and Java Collection should be a single topic like C++ STL / Java Collection. Not separate topic. So one can move forward with everything checked.
I really like the explanation, specially the pattern in which you have explained starting from count digits till gcd.
🙏 🙏 🙏 🙏 🙏 hats off to you, preparing this videos require a lot of time and from your busy schedule you are preparing for us Thank you, Dada.
Hey Striver, its been 1 month since i started following u...i must say u r the best....i don't think anyone would have explained the dp problems or any problem for that matter the way u have explained them!!!Thanks a million ....words are not enough to praise u...the kind of passion u have to teach students for free is just awesome...may god bless u
..
Congrats striver bhai for 300K subscribers.
Hope it cross million soon.
started dsa with your this course,thank you!
Thank you striver for explaining all the basic math stuff mostly in other courses the instructor assume that we already know they simply explain the code.
Your video is very informative. I can learn new things from every video. I knew all of this topic. but your video taught me new things, and how to think clearly. Thank you, sir.
Great teaching, understood all the concepts effortlessly
Your amazing playlists specially graph and dp helped me to improve a lot. Can you please create a playlist for CP as well.
no one teaches maths in theire dsa course...this is indeed an AtoZ dsa course.. blessed to have it❤
very well explained sir i have just started the series and I am getting each and every thing . Your teaching methodology is just insanely superb.
Please asap bring a linked list series as well sir
UNDERSTOOD.......Thank You So Much for this wonderful video........🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻
I really appreciate your efforts. Thank you.
Thanks alot! Please complete this DSA series for beginners asap. It helps alot for beginners in dsa like us 🙏. The only complain I have from your other DSA playlist is it's not begginer friendly and needs abit dsa knowledge
This year I got Civil branch in my state NIT. Can I understand this course as a begineer and also as a non-cs student?
Also is this playlist is enough for placement or from any other playlist I have to study ?
Yes
Try to complete the strivers a2z DSA course sheet
I can't believe he is doing this for free, amazing sir. Love from Bangladesh.
What a brilliant way of teaching hats off to you and thank you so much for the content ;)
im from chennai and love to watch ur lectures and learning through ur dsa sheet bro ..
It's great to learn from this channel ❤️Thank you:-)
Excellent Sir,My honorable thanks for making these videos with excellent explanation❤.
Amazing. I understood very well
much more needed these topics
thank you so much for creating this playlist
Perfect and simplest explanation found ever
@Striver
Great Way! Understood completely
very clear and crisp explanation.
Understood, thanks for your hard work.
Thank you Striver!
I was waiting from last 5 days. Finally come 😌😌
understood the assignment :) thanks striver
Understood and Loved It
best one till now!!! 🙏🙏🙏
your teaching skills are awesome bro
Understood, Thank you so much!!!
i have learnt awesome things from this vid 💖 , thank you
Understood well!
Raj, Thanks a lot for This Amazing Video about C++ Basic Maths
Lecture - 7 Completed ✅
Very nice explanation...God Bless You
Nice explaination....understood❤️🙌
amazing way of explaining stuff
Understood, Thanks for this amazing content
understood, and it is time to practice by myself!!
so far, this is better than the paid courses 🔥🔥🔥.
I never though i will be able to solve these so easily, thanks a lot striver for make it very very simple and easy to understand.
Euclidean algo is so easy this way...
@@mizzzile yes 🥹
Thank you striver. Basic maths completed. Coded along with you. Made the notes for the lecture .
Can you send me notes pdf??
God bless you brother, i am in better place all thanks to you!!!
started working on this a-z dsa course.. Have a job but want to start over these topics .. To switch to a better one!!!
Congrats For 300K Subscribers Bhaiya
understood striver :) thank u for this wonderful lectures
very nicely explained!!
just gazabbb🔥💌
From the bottom of my heart thank you for everyyything
Beautiful algorithm
u r god !!
beast!!
keep up the good work bhaiya!!
Hey Striver, I am a 5th semester student of a tier-3 college, first of all thankyou for all your videos, I have completed your graph series, almost completed your SDE sheet. I needed your help so I joined your channel. I see that your last members only post was a year ago, I understand that u have a full time job and therefore you are busy. I just wanted to know if you will continue making meeting sessions, because I need your guidance. Thanks again for your hard work.
Understand, superb video, keep up ♥
Striver is an inspiration ❤️
Unstoppable striver for a reason 🙌❤
thankyou striver for wonderful knowledge💥💫
UNDERSTOOD
Thanks a lot bhaiya.
In your DSA sheet, the Reverse Number Question is different. It is changing the decimal into binary and then writing binary for reversed binary again
Great way of teaching
great content! understood.
Thanks Alot and Yeah UNDERSTOOD
Waiting for this one from morning 🙂
Amazing Video!!
understood bhaiyaa thanks a lot ....
understood everthing great video sir
Thank you so muchhh!
bhaiya in question Print All divisors insted of vector we can also use set but time complexity remins same for both ds (nlog n for sort) and (nlogn for set)
btw Thank you for all The Lectures and sheet
Yes
@@takeUforward thank you for reply bhaiya your reply really motivate me to be Consistence
Bhaiya maza aa gya
Fully understood 😃😃
Superb man .. .thanks a lot