Bhaiya aap bohot acche padhate ho, muze recursion me confusion tha samajh nhi aata tha kuch bhi lekin aapse padhne ke bad doubts clr ho gaye. Thank you.
shaandaar lecture keep doing it do bring a web development course that is extraordinary from all the other courses out thee on youtube as you are doing with your DSA course, your DSA course is exclusive in whole TH-cam
Sir maine pehle bhi recursion padha tha but jo aapne smjaya hai lagta hai lifetime nahi bhulunga, i will start my internship from this January then i will share little amount of money to you , u r god gifted person sir ❤❤
Bhaiya bahuth suna tha or sab ne most difficult topic batya tha but it becomes easy for us because of you but but but a little bit difficult. Thanks @RohitNegi Bhaiya
@@CoderArmy9 😁bhaiya aap hi ne to bola tha without notes claas mt kro, jindagi ka 3rd dream pura ho gya aapse reply pakar, Aapko sat sat pranam bhaiya 🙏🙏🙏
for python this would be the simplest and non slicing approach #REverse a String def rev(string, index=0): if index == len(string): return "" else: return rev(string, index+1) + string[index] string = "HELLO" result = rev(string) print(result)
// to count no of vowel #include using namespace std; int check_vowel(string str,int size,int start){ if(start==size){ return 0; } else if(str[start]=='a'||str[start]=='e'||str[start]=='i'||str[start]=='o'||str[start]=='u'){ return 1+check_vowel(str,size,start+1); } else{ return check_vowel(str,size,start+1); } } int main(){ string str="vansh sati"; int size=str.length(); int start=0; cout
20:55 You can still count with only two arguments. Check the below code. int checkVowel(string s, int index) { if (index == s.size()) return 0; if (s[index] == 'a' || s[index] == 'e' || s[index] == 'i' || s[index] == 'o' || s[index] == 'u') { return 1 + checkVowel(s, index + 1); } return checkVowel(s, index + 1); }
If is used for vowel is there Like agar vowel hai toh count 1 add krdo and search for other vowels too but else is like We didn't get the vowel so we directly switched to the (index -1)th element without adding 1 in it Hope it helps
Bhaiya aap bohot acche padhate ho, muze recursion me confusion tha samajh nhi aata tha kuch bhi lekin aapse padhne ke bad doubts clr ho gaye. Thank you.
Done all the questions without even looking at the solution :)
Thanks bhaiya 🤗
Amazing Explaination Brother
shaandaar lecture keep doing it
do bring a web development course that is extraordinary from all the other courses out thee on youtube as you are doing with your DSA course,
your DSA course is exclusive in whole TH-cam
Good Morning Coder Army...❤
Suprabhat bhaiya,♥️♥️
Morning🌞
Good Morning Bhaiya ❤
Good morning bhaiya
Good Morning Bhaiya
bhaiya sab chamak gya .....you are the best 👍👍👍
Sab chamak Gaya bhaiya aapka bahut dhanyawad bhaiya 🙏
chamak raha ache se 🙌🙌🙌
bhaiya seriously bahut mza aa rha bahut aache se samjhaya hai aapne sab kuch, THankYOu so much😇
It's a very important and helpful video
Clarity belongs to this Man ⚡
Sir maine pehle bhi recursion padha tha but jo aapne smjaya hai lagta hai lifetime nahi bhulunga, i will start my internship from this January then i will share little amount of money to you , u r god gifted person sir ❤❤
chamak gya bahiya
Bohot ache se chamka bhaiya 👍🏻
Crystal clear
Bhaiya bahuth suna tha or sab ne most difficult topic batya tha but it becomes easy for us because of you but but but a little bit difficult.
Thanks @RohitNegi Bhaiya
for lowercase to uppercase
def upr(string, index = 0):
if index == len(string):
return ""
current_char = string[index]
if 'a'
Bhaiya video xota tha lekin explanation bahut hi axa tha maja aagya bhaiya ❤❤❤
10q bhaiya for this video abhi kambal me hu
2 hrd baad class krunga abhi notes lena padega kambal me se 😊❤❤❤
Ye sahi hai..
@@CoderArmy9 😁bhaiya aap hi ne to bola tha without notes claas mt kro, jindagi ka 3rd dream pura ho gya aapse reply pakar,
Aapko sat sat pranam bhaiya 🙏🙏🙏
@@kohinooryezindagi32451st and 2nd dream kya tha?
Bhaiya Radhe Radhe 🙏
Radhe Radhe bhai
chamak gya sabb!!
Coder Army is OP.
Starting from start :
# include
using namespace std;
int count(string S, int index){
if (index == S.size())
{
return 0;
}
if (S[index] == 'a' || S[index] == 'e' ||S[index] == 'i' ||S[index] == 'o' || S[index] == 'u'||S[index] == 'A' || S[index] == 'E' ||S[index] == 'I' ||S[index] == 'O' || S[index] == 'U')
{
return 1 + count(S, index + 1);
}
else
{
return count(S, index + 1);
}
}
int main() {
// counting vowels
string S;
cout> S;
cout
Chamak gaya❤
for python this would be the simplest and non slicing approach
#REverse a String
def rev(string, index=0):
if index == len(string):
return ""
else:
return rev(string, index+1) + string[index]
string = "HELLO"
result = rev(string)
print(result)
chamak gaya bhaiya 😁😁😁
count vowels using two pointer :-
#include
using namespace std;
void checkvow(string str, int index, int end, int count) {
if (index == end) {
cout
really loves alll of your vdo😍
Thankyou so much sir ji
Amazing lecture
bhaiya last me jo music chalta hai uska name?
Recursion on String chamak gaya ✅✅✅✅
nice explanation bhaiya
Maja aa gaya❤❤
Thanks Bhaiya...❤🎉
28:40
either we have to cout
23:41 why to put else condition?
chamak gya bhaiya
39:59
//upper To Lower case
#include
using namespace std;
void upperToLowerCase(string &str,int index)
{
if(index==-1)
return;
str[index]='a'+str[index]-'A';
upperToLowerCase(str,index-1);
}
int main()
{
string str="AMANAMAR";
upperToLowerCase(str,7);
cout
way of printing string in reverse.
#include
using namespace std;
char reversestring(string s,int index)
{
if(index==0)
return s[index];
cout
Good morning Bhai ji. ❤
Good morning bhaiya ❤
Good Morning Bhaiya🎉
Done 👍
HW: To Lowercase ✅✅
void convert(string& str, int i){
if(i==-1) return;
if(str[i]
Reverse a string - #include
using namespace std;
void revString(string str , int n){
if(n==0){
return;
}
cout
use index value as in int main() :-
str.length()
Good Morning bhaiya
bhaiya last question mai maine thoda different approach liya maine
str[index]=str[index]-' space' ; kra I mean ascii value 32 substract kardi maine
Thank u😊
Mornnnnnnninnnnnggggggggggg Bhaiya😁❤️
// to reverse our string with help of string
#include
using namespace std;
string reverse_string(string str,int start,int end){
if(start
day 79/180 done
Day 79 ✅ Done
#include
using namespace std;
void s(string arr,int index,int c){
if(index>=c){
cout
HW: Count consonants. ✅✅
int countConsonants(string S, int i){
if(S[i]=='\0') return 0;
int isConsonant = !(S[i]=='a' || S[i]=='e' || S[i]=='i' || S[i]=='o' || S[i] == 'u');
return isConsonant + countConsonants(S, i+1);
}
bro logic a6a thaa🤍
@@Pallab01 Thanks bhai ❤❤
23:41 why to put else condition?
day 56 completed
aaj to easy tha
bhaiya leetcide k recusion wale ache questions krado pilissssssssss
Good morning ❤
🔥🔥
Good content ♥️♥️♥️♥️♥️♥️♥️♥️♥️
done
Bhaiya, is string header file already included in #include ??
No you have to use
Include
chamk gaya sir ji
Day 79 ✅🔥
Done
// to convert lower case alphabet to upper case
#include
using namespace std;
string convert(string str,int start){
if(start
Mistake is pass by value
BHAIYA TREES KE QNS ACCHE SE KARANA SAB BANRAHA HAI PAR TREES NAHI BAN RAHE USKE RECURSIVE QNS
done✅✅
// to count no of vowel
#include
using namespace std;
int check_vowel(string str,int size,int start){
if(start==size){
return 0;
}
else if(str[start]=='a'||str[start]=='e'||str[start]=='i'||str[start]=='o'||str[start]=='u'){
return 1+check_vowel(str,size,start+1);
}
else{
return check_vowel(str,size,start+1);
}
}
int main(){
string str="vansh sati";
int size=str.length();
int start=0;
cout
❤❤❤
G m bhiya
Day 79/180 👍👍
#include
#include
using namespace std;
int ispalindrome(int start,int end,string str){
if(start>end){
return 1;
}
else if(str[start]!=str[end]){
return 0;
}
else{
return ispalindrome(start+1,end-1,str);
}
}
int main(){
cout
homework upper to lower
void upperTolower(string &str,int index){
if(index==-1)
return ;
str[index]='a'+str[index]-'A';
upperTolower(str,index-1);
}
29:12 rohit print hoga bhaiya
chamakgaya
❤
20:55 You can still count with only two arguments. Check the below code.
int checkVowel(string s, int index) {
if (index == s.size())
return 0;
if (s[index] == 'a' || s[index] == 'e' || s[index] == 'i' || s[index] == 'o' || s[index] == 'u') {
return 1 + checkVowel(s, index + 1);
}
return checkVowel(s, index + 1);
}
IR07120D
day 69
23:41 why to put else condition?
If is used for vowel is there
Like agar vowel hai toh count 1 add krdo and search for other vowels too but
else is like
We didn't get the vowel so we directly switched to the (index -1)th element without adding 1 in it
Hope it helps
bhaiya aaj se main aapki sheet solve karne ja rha hu but thoda confuse hu ki sheet ke notes banane ha ke nhi
Confusion kya isme..banao bindas notes
@@rudeguy9024 but 700 ques ke notes bht time lag jayega
Day 79
Day 79/180 #180DaysOfCode
namaste bhaiya
Namaste..
🎉
mistake :- reference pass krma hai kya ?
❤🔥
Day 79 ✅🫡
CHAMKAAAA
chamka
chamak gaya bhaiya
Good morning bhaiya ji ❤
Good morning bhaiya ❤❤
❤
chamak gya bhaiya
Good morning bhaiya ❤