Video

ok noted, bubble sort algorithm is an implace / stable algorithm( not using any space)

thanks for explaining

easiest approach thanks bhaiya after a lot of scrolling found this ❤❤❤❤

it's a very bad explanation , although I get the idea

from collections import Counter def minimum_window(str1,str2): window="a"*(len(str1)+1) left=0 count=0 hashmap=Counter(str2) for i in range(len(str1)): if str1[i] in hashmap: hashmap [str1[i]]-=1 if hashmap [str1[i]]>=0: count+=1 while count==len(str2): if len(str1[left:i+1]) < len(window): window=str1[left:i+1] if str1[left] in hashmap: hashmap [str1[left]]+=1 if hashmap [str1[left]]>0: count-=1 left+=1 return window str1='ADOBECODEBANC' str2='ABC' print(minimum_window(str1,str2)) str1 = "PRWSOERIUSFK" str2 = "OSU" print(minimum_window(str1,str2))

now it's not working, is it with everyone or else with me only

Bro your code is simply O(n^2) not n. you just believed the gfg article which also says O(n) you just copy pasted man😂

great efforts sir

Explanation could have been made less complex and easier to understand. That's what youtube is for :( Here's a simple solution:

upto 5.41 it went well, they why did you said move on to the code before explaning the hashMap algo, going to the code and explaining the algo is the worst thing in DSA. Stop doing this. First you should explain the complete algorithm and implementation can be done in the later stage, but you are jumping onto the code which is ABSOLUTELY WRONG

English ? Hindi ? Did you need to perform a mixture? After all, it could be spoken in any language.

Runtime Error getting this error on submitting the code

Bro.. i went through ur video.. tumhe solution obv pata tha but yaar explain ni kr paaye tum.. i would suggest, break down krlo prob ko into smaller prob aur 1 by 1 chalo, so that if anyone with lil knowledge of DSA watches this, usko bhi samjh aaye... just a suggestion bro.. baaki all the best

Well explained

we can solve this problem without using the extra array

nice explanation bhiya watched this full viedo is worth it!!

Your vector approach is not working for larger size matrix

Awesome Explaination ! Thank you !

class Solution { public: int longestPalindrome(vector<string>& words) { int length=0; unordered_map<string,int>mp; for(string str:words){ string temp=str; reverse(temp.begin(),temp.end()); if(mp.[temp]>0){ length+=4; mp[str]--; } else{ mp[str]++; } } for(auto it:mp){ if(it.first[0]==it.first[1] && it.second>0) return length+2; } return length; } }; ur code is not workingg..

dont fool bro😂😂😂 clearly your approach is n sqaure submit your code it deifnately will give tle

well explained sir

why this code is giving TLE //{ Driver Code Starts /* Driver program to test above function */ #include<bits/stdc++.h> using namespace std; // } Driver Code Ends class Solution { public: int minChar(string str){ //Write your code here int n=str.size(); int i=0; int j=n-1; int j2=j; int count=0; while(i<j){ if(str[i]==str[j]){ i++; j--; } else{ count++; i=0; j2--; j=j2; } } return count; } }; //{ Driver Code Starts. int main() { int t; cin>>t; while(t--) { string str; cin >> str; Solution ob; int ans = ob.minChar(str); cout << ans<<endl; } return 0; } // } Driver Code Ends

Nice explaination. Thanks!!!

it didn't work for multiple test cases

Bro can I get the program in python

sir the content is awesome!1 but can you explain in hindi as it would become more convinient to us to understand concepts easily!

Thankyou!!

Badhiya padhaya bro

❤🎉🎉

Did anyone get any update yet?

czcams.com/video/_Mux-xaWByM/video.html

Did anyone get any update post assessment and asynchronous interview?

czcams.com/video/pRDpvbt1ex0/video.html

czcams.com/video/-cv5KFYiPJg/video.html

czcams.com/video/-cv5KFYiPJg/video.html

Full video

czcams.com/video/fGQQUiE4gwQ/video.html

czcams.com/video/I3kJK6J3huM/video.html

czcams.com/video/Lr0aJg-he7Y/video.html

Bhaiya how to connect with you, I'm the junior whom you met in the college library while you were writing assignment. Please give insta id or phone number.

Bhaiya how to connect with you, I'm the junior whom you met in the college library while you were writing assignment. Please give insta id or phone number.

Great

can you discuss about below case 10 9 3 5 1 9 6 10 5

Please comment down your thoughts and your approach.

Please comment down in the comment box if you need any explanation on particular problem.

Hey there. Thank you everyone. Stay tuned for more interesting videos.

Can anyone confirm on TC : N * (2^N), right ?

Do ko keee

shessh

Yes