i was not aware of this series , when i saw ,almost 20 lectured were covered , but i decided to catch the series and i completed 16 lectures in 3 days , thanku bhiaya for such great content 💌💌
00:00- Recap previous session, 00:40= Q1) Write a program to Convert 'a' to 'A' === Thinking part, 06:11= Code part, 09:04= Q2) Amstrong Number, 28:45=Q3)Find Trailing Zeros in a Factorial, 28:55= with Logical Approach, 40:07=Solution, 42:03= Q4) Can I form rectangle by given four numbers, 46:30=Q5) Total Moves for Bishop , with Logical Approach , 59:50= Code part, 01:03:44= Q6) Nim game,
@@tbmsahil8850 this is non standard so it may not work with other compiler and it would include lot of unnecessary stuff so it increases compilation time
simple approach for the first problem: the difference capital and small alphabet ascii value is 32 so in the function subtract the variable by 32 like below char convert(char n) { n = n-32; return n; }
Pls use different names in variable & in functions. Specially in parameter & arguments because it is easy to understand by different names Pls sir everywhere use different names it will help us
Bhaiya Aap tagda yogdaan de rahee ho mere jaise beginner level non-it aspirants ke liye. Concepts pura root level se clear ho raha hai, placement crack karne ka umeed ho raha hai bhaiya, aise hi saath dete raho🎉🎉🎉❤❤ Lots of love from WB
bhaiya 2 weeks kab khatam hue pata hi nahi chala ab next week se DSA start hoga toh aur maza aayega mujhe c++ aati thi aur maine jab classes aur OOPS padha tha tab mujhe jyada samajh nahi aaya tha lekin aap kuch bhi padhate ho voh mujhe turant samajh aajata hai very excited to learn OOPS and DSA from you ❤❤
my compiler has some personal issue with 5 if i am using the pow function and doing the square of 5 then it's showing 24 🙂 what to do anyone has any idea?
Bhaiya before starting any , DSA course , can tell : How much DSA is required for getting a service based company or Product based company , complet information about all data structures(there advantage , disadvantage, application, also where this ds can be used in product or service based company) plzz !
28:10 We can optimize Armstrong number solution by early exiting the loop. 🚀🚀 while(n) { rem = n%10; n/=10; ans = ans + pow(rem,digit); if(ans>num) return false; }
1:13:30 bhaiya aab toh hum pro ban gye 😂😂 ab koi nhi h takkar btw ye game mere sir ne ek baar school me krwaya tha mere aur mere dost ke bich me mai galti se jit gya but baad me mai turant pattern dhund liya ki aakhir hota kya h fir mai jiske sath bhi khelta tha sab se jit jata tha😂😂
we can also solve trailing zero with this code...In my opinion code is right..but it's giving output 0 after taking input more than 12 #include using namespace std; int factorial(int n) { int product=1; for(int i=1; inum; int fact= factorial(num); cout
because int can take only 32 bits. so 12! has 32 bits in binary representation but 13! has more than 32 bits in binary representation . So , when we get 0 when we input more than 12!
My approach of armstrong number #include #include using namespace std; int main(){ int n; coutn; int temp1=n; int temp2=n; int j=1; int count=0; while(temp1!=0){ temp1=temp1/10; count++; j++; } int i=1; int rem; int ans=0; while(n!=0){ rem=n%10; n=n/10; ans=ans+pow(rem,count); i++; } if(ans==temp2){ cout
If (ans== num) return 1 return 0; Ye sahi hoga in Armstrong part Kyoki ek return value chahiye function ko at last but tum bas if aur else me return kar rahe ho function ke end me return maangta hai. Agar if wala condition true hota hai to program wahi end ho jayega aur last line execute nhi hoga. Warna last line PE Jake return 0 kar dega bina else likhe
Hello bhaiya in code of converting 'a' to 'A' // Convert corresponding Capital aplhabet to small and vice versa function char convert (char& ch){ int i =ch; if(98
sir ak problem aaye h armstrong ka jo code likhe ho ap video 26:29 min me line number 23 pr ans=ans+pow(rem,digit); sir run krne pr _________ armstrong.cpp:21:32: error: 'pow' was not declared in this scope ans = ans+pow(rem,digit); ye dikha rha h
@@souravsanyal1617 O(logN) because logN is the number of bits in a number N. Lekin 1 aur achha method hai, Kernighan's algorithm. Underlying principle ye hai ki if we do N=N&(N-1) then rightmost set bit of N will become 0, basically in normal word, turning off the rightmost set bit. To right se aise hi turn off karte karte left me age badna hai jab tak N=0 na ho jaye (0 means there is no set bits i.e 1). Isme bhi time complexity O(logN) hi hai. But fark ye hai ki isme har ek bits ko check karne ka zarurat nhi hai. int count = 0; while(N){ N &= (N-1); count++; }
Hellow bhaiya actually I have taken your course but right now there is no any mentor i found which we are getting problem to start which session I should start the coding I am so confused please try to provide mentor as soon as possible bhaiya please as soon as I try to start but I become confused
Hello Coder Army, Don't miss out the last question it's really interesting❣
Thank you bhaiya for such lectures.
Bhaiya aage jakar fenwick trees bhi hoga na?
Please tell classes in English we don't know Hindi
C++ oops and stl
Bhiya oops or stl padha dijiye
Good to hear it finally 😂 now our legendary DSA series will begin ❤
QUESTION 1: MY APPROACH
#include
using namespace std;
char alpha(char ch)
{
ch = ch - 32;
return ch;
}
int main()
{
char ch;
cout > ch;
cout
Same I did in first attempt 😊😊
Konse year mee ho bro or konsi branch
Bhai 32 sub kyu kiya
@@rajeevbaghel203 see ascii table their small a and big A have difference of 32 in ascii values
same bro
i was not aware of this series , when i saw ,almost 20 lectured were covered , but i decided to catch the series and i completed 16 lectures in 3 days , thanku bhiaya for such great content 💌💌
00:00- Recap previous session, 00:40= Q1) Write a program to Convert 'a' to 'A' === Thinking part, 06:11= Code part, 09:04= Q2) Amstrong Number, 28:45=Q3)Find Trailing Zeros in a Factorial, 28:55= with Logical Approach, 40:07=Solution, 42:03= Q4) Can I form rectangle by given four numbers, 46:30=Q5) Total Moves for Bishop , with Logical Approach , 59:50= Code part, 01:03:44= Q6) Nim game,
Thanks for timer brother
For those whose pow() is not working, include cmath library
thank you for this
thanks man...😊
Ok
#Include kabhi kuch add nhi karna padega thanks me later 😊😊
@@tbmsahil8850 this is non standard so it may not work with other compiler and it would include lot of unnecessary stuff so it increases compilation time
I lost my streak, but now I have completed all the lectures
Trailing zeroes done at first attempt...........so happy 😊...... thanks for this concept clarity ❤
I used to sleep @2am now I sleep 10pm so that I can wake up @5:45 am to consume your videos ❤❤❤
Good job
@@CoderArmy9 bhaiya pow mai error show kar raha hai kya kare?
@@AMAN-cs6gf include math.h
Bhai kuch zada hi nahi huwa😂
@@DanishAnsari1298h means brother
simple approach for the first problem:
the difference capital and small alphabet ascii value is 32 so in the function subtract the variable by 32 like below
char convert(char n)
{
n = n-32;
return n;
}
if you wanna more simple use toupper() function
It easy but not dynamic bro that bhaiya code is dynamic
love u bhaiya from niraj
Thank you for this Extraordinary Explanation 🙌✨⚡
Day 19 done and dusted....❤ Learn a lot and seems easy.... Thank you bhaiya for awesome explanation....
Nice lecture Rohit Bhaiya...!!✨
19/180 done , thanku so much bhaiya , aap bht acha padhate h
Add #include
if pow is not working
hme jaise pta hi nhi tha¯\_(ツ)_/¯
thanks buddy
Thanks bro
Bhai ek doubt trailing zeroes mein sir ne extra N/=5 kyo likha hn 17 line mein please tell?
@@Billy-gd1rm bro again karne ke liye jaise 25/5 =5 hoga
Fir se 5/5 = 1 hoga
And = 6
GREAT Session bhaiya...
thankyou bhaiya ethna acha padhaane ke liye
Pls use different names in variable & in functions. Specially in parameter & arguments because it is easy to understand by different names
Pls sir everywhere use different names it will help us
Lecture-15 Completed, bhaiya now from next video DSA is going to start and i will give my 100% to complete it and practice it daily.
Bhai ek doubt trailing zeroes mein sir ne extra N/=5 kyo likha hn 17 line mein please tell?
#180DaysofCode
Day - 19 Lecture -15
Successfully Completed ✅✅✅
all dout clear of cpp thank you bhaiya
Thanks a lot Rohit Sir for your great efforts
Bhaiya Aap tagda yogdaan de rahee ho mere jaise beginner level non-it aspirants ke liye.
Concepts pura root level se clear ho raha hai, placement crack karne ka umeed ho raha hai bhaiya, aise hi saath dete raho🎉🎉🎉❤❤
Lots of love from WB
Finally completed first milestone 🎉🎉
Ready to move to the day 20
So superb and exciting series thanks a lot sir
nice explanation for each and every concept 💚💚💚
bhaiya thankyouu so much, sab kuch achhe se chamak gaya !! basics ek dum clear ho gye and feeling confident now 😄❤
What a amazing lecture bhaiya ❤, thanks a lot and now excited to start our Dsa from tomorrow ❤❤❤❤
It's getting hard now ,
I am unable to build logic
#180daysofcode
But still consistent
19th day completed
Same bro
last 2 question was amazing
ur dedication.. keep going bhaiya..
Chapter 15 completed. Thank you for the lecture sir. #DSA #180daysofcode
6:45 another approach :
char convert (char c) {
return c - 32;
}
Thank you for amazing lecture
Day 19/180 complete ✅✅✅✅💯💯💯
Consistency shouldn't break 🔥 🔥 cant wait for upcoming videos bhaiya.....❤ love you bhaiya
in the rectangle problem, we should give one more condition
if(a==b && a==c && a==d)
return 1;
because every square is also a rectangle
But we need only rectangle ..........
but yes u r right 😀
Thanx for this amazing lecture.
#Chamka diye Saare Questions.
Best best content ! Thank You bhaiya ✅
Thankyou so much sir 😊
my logic for que 1
#include
using namespace std;
void swap(char &ch1)
{h
char ch2;
ch2=ch1-32;
cout
Nice lecture, Thank you 🥰🥰🥰
Bhaiya bohot hi pyaara content hai thank you so much bhaiya
Day 15 completed 😊
bhaiya aap bohot badya padate ho 😊😊
Bhai ek doubt trailing zeroes mein sir ne extra N/=5 kyo likha hn 17 line mein please tell?
Day 19 done #180 days of coding bhaiya Thank you for all your effort
Thank you bhaiya maza aa gaya completed at day 7 day 6 par thoda late ho gaya mai sorry for that
27july 24 , thank you sir, lecture 15 completed
Bhai ek doubt trailing zeroes mein sir ne extra N/=5 kyo likha hn 17 line mein please tell?
Vaise ek advice Leni thi , mai abhi jee ki tyari kr rahu hu pr coading me kaafi intrest h to Mai sathe Karu ya na Karu confusion h
Onther day complete 🎉🎉🎉🎉
Thank you bhaiya ❤️✨
Thank you Bhaiya, it's help me lot . Aap bahot ache se smjate ho ❤❤🎉😊
bhaiya 2 weeks kab khatam hue pata hi nahi chala ab next week se DSA start hoga toh aur maza aayega
mujhe c++ aati thi aur maine jab classes aur OOPS padha tha tab mujhe jyada samajh nahi aaya tha lekin aap kuch bhi padhate ho voh mujhe turant samajh aajata hai very excited to learn OOPS and DSA from you ❤❤
SORRY BHAIYA, I don't comment in every video but aapka bohot bohot DHANYAWAD 🙏🙏🙏🙏🙏
Thank you bhaiya itana achcha content provide karke ke liye
my compiler has some personal issue with 5 if i am using the pow function and doing the square of 5 then it's showing 24 🙂
what to do anyone has any idea?
Day 19/180 completed.😊
Bhaiya before starting any , DSA course , can tell : How much DSA is required for getting a service based company or Product based company , complet information about all data structures(there advantage , disadvantage, application, also where this ds can be used in product or service based company) plzz !
Maja aa gaya bhaiya last question interesting tha😂😂😂
Bhai ek doubt trailing zeroes mein sir ne extra N/=5 kyo likha hn 17 line mein please tell?
Pl. Provide slides in which you are explaining logic ...
Can we expect to solve atleast 250+ leetcode questions in this entire series??
300+ hga easily...
Complete ✅
28:10 We can optimize Armstrong number solution by early exiting the loop. 🚀🚀
while(n)
{
rem = n%10;
n/=10;
ans = ans + pow(rem,digit);
if(ans>num) return false;
}
❤
Good approach bother.
Without power pre defined function ke nhi kr skte kya is question ko solved
@@SHIVSHANKAR-qv3bg kr skte h and uske liye hme khud se power function banana padega
Ok👍
please anyone tell me the rectangle code solution
Vaiya bohot badiya laga ai nim game wala concept ❤❤❤😅
Day 15✅ done
I'm doing coding in java programming for past 2 years , should I switch to c++ or solve same problem in java programming only
1:13:30 bhaiya aab toh hum pro ban gye 😂😂 ab koi nhi h takkar btw ye game mere sir ne ek baar school me krwaya tha mere aur mere dost ke bich me mai galti se jit gya but baad me mai turant pattern dhund liya ki aakhir hota kya h fir mai jiske sath bhi khelta tha sab se jit jata tha😂😂
Awesome.
Extro Music🔥
bhaiyyaa mera armstrong wala program 153 ke liye propper work nahi kar rha hai
Understood Sir🙏🙇♂✨💖
Day 19/180 completed
we can also solve trailing zero with this code...In my opinion code is right..but it's giving output 0 after taking input more than 12
#include
using namespace std;
int factorial(int n)
{
int product=1;
for(int i=1; inum;
int fact= factorial(num);
cout
because int can take only 32 bits. so 12! has 32 bits in binary representation but 13! has more than 32 bits in binary representation . So , when we get 0 when we input more than 12!
@@A_WAY_TO_BETTER_LIFE Thank You
My approach of armstrong number
#include
#include
using namespace std;
int main(){
int n;
coutn;
int temp1=n;
int temp2=n;
int j=1;
int count=0;
while(temp1!=0){
temp1=temp1/10;
count++;
j++;
}
int i=1;
int rem;
int ans=0;
while(n!=0){
rem=n%10;
n=n/10;
ans=ans+pow(rem,count);
i++;
}
if(ans==temp2){
cout
tumne apne code me int j kisliye liya hai uska koi mtlb nahi hai dost .
Completed day 19
Day 15 Completed ✅
If (ans== num) return 1
return 0;
Ye sahi hoga in Armstrong part
Kyoki ek return value chahiye function ko at last but tum bas if aur else me return kar rahe ho function ke end me return maangta hai. Agar if wala condition true hota hai to program wahi end ho jayega aur last line execute nhi hoga. Warna last line PE Jake return 0 kar dega bina else likhe
Hello bhaiya in code of converting 'a' to 'A'
// Convert corresponding Capital aplhabet to small and vice versa function
char convert (char& ch){
int i =ch;
if(98
Yeah yeah correct hai
@@ShauryouseeBhai ek doubt trailing zeroes mein sir ne extra N/=5 kyo likha hn 17 line mein please tell?
sir ak problem aaye h armstrong ka jo code likhe ho ap video 26:29 min me line number 23 pr ans=ans+pow(rem,digit); sir run krne pr _________ armstrong.cpp:21:32: error: 'pow' was not declared in this scope
ans = ans+pow(rem,digit); ye dikha rha h
19 is very interesting lecture
Chamak rha hai bhaiya ❤❤
Thank bro
Bhaiya aap God gifted ho pahle ku nhi milemujhe😢😢❤❤
Valid Rectangle code :
if((A==B && C==D)){
return 1;
}
return 0;
@vammotv5183 you have not checked for the condition A == C and A == D.
@@maniishbhandari But i passed on that website interviewbit
sir, aap ek compiler mey screen presentation karke class kijiye
Solution for set bits. ✅✅
int count = 0;
while (N)
{
count += (N & 1);
N >>= 1;
}
Time complexity kya hay iska
@@souravsanyal1617n
@@souravsanyal1617 O(logN) because logN is the number of bits in a number N.
Lekin 1 aur achha method hai, Kernighan's algorithm. Underlying principle ye hai ki if we do N=N&(N-1) then rightmost set bit of N will become 0, basically in normal word, turning off the rightmost set bit. To right se aise hi turn off karte karte left me age badna hai jab tak N=0 na ho jaye (0 means there is no set bits i.e 1). Isme bhi time complexity O(logN) hi hai. But fark ye hai ki isme har ek bits ko check karne ka zarurat nhi hai.
int count = 0;
while(N){
N &= (N-1);
count++;
}
Thank you bhai
Bhai ek doubt trailing zeroes mein sir ne extra N/=5 kyo likha hn 17 line mein please tell?
@@Billy-gd1rm number ko chota karne ke liye
Thank you brother ❤
Sir puzzles video kaha dikehga main dekh nhi paya uss samay main dukan pe kaam kar rha tha
day 20 completed
0:14 yess bhaiya
Bhai stl kab start hogaaq
Bhaiya pow function kum nahi kar rha hain , power ka code kayse likhte hain?
include math file in code
Solution for distribute in Circle
int ans = (A+C-1)%B;
return ans==0 ? B : ans;
bhiya factorial wala to rem nikal if( rem==0 { cout++ ; } bhi kr skte hai mera sahi ans aara hai
Good morning Bhaiya 🙏
sir can you explain again the problem, bishop and zero in factorial. ye wali problem chamki nhi h sir chamka digie 🫡
Hellow bhaiya actually I have taken your course but right now there is no any mentor i found which we are getting problem to start which session I should start the coding I am so confused please try to provide mentor as soon as possible bhaiya please as soon as I try to start but I become confused
Bhaiya leetcode pe question karvao na please
sir i have a one doubt they show "min" is undecleared