Notes/Codes/Problem links under day 8 of A2Z DSA Course: takeuforward.org/strivers-a2z... Entire playlist: • Maths Playlist | Langu... Follow us on our other social media handles: linktr.ee/takeuforward
Пікірлер: 54
@md.ualiurrahmanrahat240021 күн бұрын
The optimal approach is so amazing. Thanks Striver for GOAT level stuff.
@2amCoder4 ай бұрын
last solution was actually something i never came across has thought of it but never applied great vid
@mohammedraheel22234 ай бұрын
One after other video is uploading it is very much satisfying for the beginners😊.. Thanks a lot Striver Bhaiya ❤
@stith_pragya3 ай бұрын
Understood......Thank You So Much for this wonderful video......🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻
@subee1284 ай бұрын
Thank you very much
@codeman38283 ай бұрын
Understood. thanks
@Anonymous____________A7214 ай бұрын
God of dsa and cp
@reddygopichand20024 ай бұрын
Understood ❤
@Express8714 ай бұрын
Can you videos on your own dsa sheet string Question
@kedarmalap75254 ай бұрын
Can you please upload detailed video on strings....
@prajjwaltripathi23744 ай бұрын
I can't find the c++ code for the last method, please someone help!
@shashankgsharma090119 күн бұрын
Understood!
@chiragbansod82524 ай бұрын
understood
@knowthrvdo4 ай бұрын
Plz complete remaining sheet as well
@anshgupta88602 ай бұрын
for number like 37 ,n stilll remains 37 which is a factor ,so we add and in case of 16 ,n reduces to 1 ,so we dont need to add it to list ,that;s why n!=1 then add to list
@hardikpatel352Ай бұрын
understood class Solution{ public: vectorAllPrimeFactors(int N) { vector vec; for(int i=2; i
@batmanlovesjokerr3 ай бұрын
8:30- actual method 14:40 more optimised
@HarshvardhanSankpalАй бұрын
12:30 in this code we need to also apply isPrime( i ) in the if statement, else we are blindly adding also the divisors, but the question demands prime divisors.
@afreenmohammad8716Ай бұрын
no you are wrong. for example,2 is a prime number. when 2 divdes the number as many times as possible then 2 mutiples cannot divide the number. similarly for 3 etc.
@HarshvardhanSankpalАй бұрын
for solving the edge case of 37, cant we simpliy check if n is prime, if yes, we know theres only 1 pime factor that is itself ??
@anonymous1090629 күн бұрын
consider for 35
@user-nb6fx1rf9i4 ай бұрын
Time hi nahi mil reha h abhi...varana ek din me ye playlist khatam kar denge... Striver Jindabaad! 😂
@wul_frik2 ай бұрын
I have a doubt, why can't multiple prime numbers be there after the loop ends, like after the for loop ends, the number might be something like p1 * p2, where p1 and p2 are primes?
@vipuljamod4119Ай бұрын
If n = 221. Then i * i
@VikashPatel-sf6ub4 ай бұрын
In last approach, why we are adding n in list if it's not equal to 1 without checking it's prime or not.
@mrinmoykalita44564 ай бұрын
Considering worst case of factors of primes of number can go upto number. So, we are considering total spaces upto the numbers.
@yash22754 ай бұрын
See If there is the value Of N which is prime then we are iterating i upto sqrt N so we will not reach to the N through i but we know that if n is not 1 then it will also be the factor so we will add it to the answer see dry run the code for 65 then you will understand
@AkbarKhan-gd2bw4 ай бұрын
💖💖💖
@veerverma55864 ай бұрын
Bhaiya string and recursion ka kya plan hai??
@es_amit4 ай бұрын
aditya verma se pdhle recursion bhot mst hai uska
@veerverma55864 ай бұрын
@@es_amit phir lekin sequence toot jayega, ab dekhta hoon agar thode din tak nhi kiya post toh kahi or se he krna padega
@es_amit4 ай бұрын
@@veerverma5586 bhai ek baar pdh ke toh dekh fir btaio (recursion) Aditya verma se. mera recursion bhot weak tha phle ab dp ke questions bde aaram se solve kr deta hu
@veerverma55864 ай бұрын
@@es_amit ohh 😮, yeh he hai kya 19 videos wala?
@es_amit4 ай бұрын
@@veerverma5586 ha Bhai aaram se dekh fir btaio mujhe kaisi lgi, backtracking ki bhi dekh lio
@codingp11024 күн бұрын
US!
@AkOp-bf9vm2 ай бұрын
did anyone understand the last 16 example which he give to try itself
@vipuljamod4119Ай бұрын
n = 16. (1) i = 2 i*i = 4 < 16 16 % 2 = 0 . list.add(2) while(n % 2 == 0) { 16/2 = 8 8/2 = 4 4/2 = 2 2/2 = 1. } Now while loop break. i is become 3 and n is become 1. 3 * 3 = 9 < 1 ❌ so condition false So for loop break. And now check if n != 1 n = 1 and 1 = 1 so condition false ❌ And final ans list = [2]
@AkOp-bf9vmАй бұрын
@@vipuljamod4119 thnx bro
@praphullpandey4254 ай бұрын
First view ❤
@gauristar40942 ай бұрын
But the final optimized approach doesn't work for some numbers like 6.
@vipuljamod4119Ай бұрын
public static ArrayList primeFactor(int n) { ArrayList al = new ArrayList(); for(int i=2; i * i
@vipuljamod4119Ай бұрын
Try this code.., this working perfectly.
@AkashSingh-vloger10 күн бұрын
Yes bro @@vipuljamod4119
@AdityaGrover-ly9jf4 ай бұрын
First view
@genzsubh4 ай бұрын
Nhi karna print bhai... Kyu paresan kr rha h. Job dega to bol