Can the TLE team please stop giving this guy the editorials he literally just reads the code and waits for the students who were able to solve the question give the intuition he talks about the chat and waits for them to give the answer what's the point of taking the discussion if u had to cater just to the one's who were able to solve the problem I urge you to please give these editorials to Raghav, Abhinav or Gaurish they are far better than him he might be a good coder no doubt, but is a bad teacher.
Exactly, let Raghav , Viraj or Abhinav teach. Why is Ankit getting so many contests? I know these discussions are free but what's the use of a free resource if it's bad?
Sir how you are calculating the time complexity of problem D like i thought the same but was thinking that it would give me a tle.... Can you please explain the time complexity of D
If you are using code runner it won't work. [x,y] only works for C++20 , not C++17 or C++14. PS: If someone knows how to fix it , write an explanation pls
Hiring people of higher rating doesn't guarantee you that they will teach students well. You can be an expert, CM or master and it doesn't mean that you can teach people exceptionally well. Teaching is a skill itself and one should not expect themselves to be good at teaching just because they are so good at a skill. Him and harsh Gupta are not good at explaining
could someone tell me why this code is incorrect for question 2nd #include #include #include using namespace std; int longestCommonSubsequence(const string& a, const string& b) { int n = a.length(); int m = b.length(); vector dp(n + 1, vector(m + 1, 0)); for (int i = 1; i t; while(t--){ string a, b; cin >> a >> b;
int result = longestCommonSubsequence(a, b); int k = result;
Could someone pls tell me why this is failing for question 2? I cant think of any test case for which it fails cin>>a>>b; ans = a.length(); for(int i=0;i
![Lp. Сердце Вселенной #1 НАЧАЛО ПУТЕШЕСТВИЯ [Новый сезон] • Майнкрафт](http://i.ytimg.com/vi/380Q7gLWGvk/mqdefault.jpg)
Please fill the feedback form: forms.gle/fw2M8mwtNWTm9xiG9
TLE code D
Can the TLE team please stop giving this guy the editorials he literally just reads the code and waits for the students who were able to solve the question give the intuition he talks about the chat and waits for them to give the answer what's the point of taking the discussion if u had to cater just to the one's who were able to solve the problem
I urge you to please give these editorials to Raghav, Abhinav or Gaurish they are far better than him he might be a good coder no doubt, but is a bad teacher.
Not understood problem D, in if else statement both are doing samee thing
This is the worst instruxtor on this channel, literally skims over code.
Exactly, let Raghav , Viraj or Abhinav teach. Why is Ankit getting so many contests?
I know these discussions are free but what's the use of a free resource if it's bad?
Exactly bro Ankit is the worst I had ever seen
Worst Explanation of D. Ik its free but u cant provide a teacher who doesnt know how to teach. Better provide Raghav. Ankit is worst at explaining
True bhai dislike Ankit video as much as you can
fill the feedback form
There is something odd with the CP sheet. Can you please fix it ?
yes, it's not working
I tried to comment twice with my code but it got removed automatically in a minute . Any ideas why that can happen ?.
Due to security reasons,
Sir how you are calculating the time complexity of problem D like i thought the same but was thinking that it would give me a tle.... Can you please explain the time complexity of D
i copied the code and i got tle for his solution i didn't undesrtood why
why it is wrong to doing int the way to find the longest common subsequence and ans=(n+m-LCS) in question B
in problem b why do we add i in result=min(result,n+m-curi+i); ?
the instructor learnt to code but never learnt how to teach.
how to use this as it is not working in vs code
for(auto &[diff, temp] : diffs)
If you are using code runner it won't work. [x,y] only works for C++20 , not C++17 or C++14.
PS: If someone knows how to fix it , write an explanation pls
Afaik i think GNU based systems or linux based this gives an error
I am still unable to figure out why is that so
Install GCC G++ 20
man, i also had same issue, many coders used auto &[x, y] but when i do, it says error
Hiring people of higher rating doesn't guarantee you that they will teach students well.
You can be an expert, CM or master and it doesn't mean that you can teach people exceptionally well. Teaching is a skill itself and one should not expect themselves to be good at teaching just because they are so good at a skill. Him and harsh Gupta are not good at explaining
fourth solution gives TLE , this is not optimized approach
yes i have applied this logic during contest itself i got an tle
@@FastTech1000 it does get accepted btw.
@@ravishekharyadav7701 yes
explanation is not up-to the mark please explain the qn then start to solve and clear explanation #honest review
could someone tell me why this code is incorrect for question 2nd
#include
#include
#include
using namespace std;
int longestCommonSubsequence(const string& a, const string& b) {
int n = a.length();
int m = b.length();
vector dp(n + 1, vector(m + 1, 0));
for (int i = 1; i t;
while(t--){
string a, b;
cin >> a >> b;
int result = longestCommonSubsequence(a, b);
int k = result;
cout
try for this string
abcde and cfe
your code will you 6 but correct answer is 7
@@shudhanshusingh1401tried, it fails
Try on
ab
acb
Your code. Will give 3 as output means acb which is wrong in this ab is not a substring
It's correct output should be 4
abcb
I have also done the same mistake in contest
@@shudhanshusingh1401
cde
abcefg here longest common substring is length 1 hence output will be 8 but correct is 7
too much poor exlaination
worst tutor TLE has ever introduced , he is not able to explain and convey the solution correctly and bit confusing
Thanks ❤
Could someone pls tell me why this is failing for question 2?
I cant think of any test case for which it fails
cin>>a>>b;
ans = a.length();
for(int i=0;i
ghatiya explanation of D , no visualisation ,
extremely bad explanation of D
TLE code D
Hi
time complexity in question b is O(t*b^2*a) which comes to near O(1e8) , but the judge does not gives TLE why ??
Cuz u can do 4e8 operations in 1 sec, and here time limit given 2 sec
And it's not t*b^2*a
It's t*b*a = 1e7
@@DayaTapuKPapaGada I did with t*b^2*a which still got accepted
@@jeeaspirant9697 that will be 1e9 which shouldn't pass ideally as in 2sec, 8e8 will pass