![Jeevan Alexen](/img/default-banner.jpg)
- 36
- 4 655
Jeevan Alexen
เข้าร่วมเมื่อ 30 ส.ค. 2021
D. Maximize the Root Educational Codeforces Round 168 (Rated for Div. 2)
#codeforcessolution #codeforces #coding #cpp
มุมมอง: 51
วีดีโอ
C: The Wizard and his magic potions GDSC Code Conquest
มุมมอง 30หลายเดือนก่อน
#coding #hackerrank #solution #cpp
D Elections Codeforces Round 953 Div 2
มุมมอง 272 หลายเดือนก่อน
#codeforcessolution #codeforces #coding #cpp
C. Manhattan Permutations Codeforces Round 953 (Div. 2)
มุมมอง 3072 หลายเดือนก่อน
#codeforcessolution #codeforces #coding #cpp
3187. Peaks in Array Weekly Contest 402
มุมมอง 202 หลายเดือนก่อน
#leetcodequestions #leetcode #leetcodecontest #leetcodesolutions #leetcodechallenge #leetcodesolution
3186. Maximum Total Damage With Spell Casting Leetcode Weekly Contest 402
มุมมอง 2142 หลายเดือนก่อน
#leetcodequestions #leetcode #leetcodecontest #leetcodesolutions #leetcodechallenge #leetcodesolution
How to use Codeforces api to build a website or a application.
มุมมอง 2812 หลายเดือนก่อน
#webdevelopment #codeforces #api #reactjs #nextjs #codeforcessolutions
D. GCD-sequence Codeforces Round 950 (Div. 3)
มุมมอง 682 หลายเดือนก่อน
#codeforcessolution #codeforces #coding #cpp
E. Permutation of Rows and Columns Codeforces Round 950 (Div. 3)
มุมมอง 1052 หลายเดือนก่อน
#codeforcessolution #codeforces #coding #cpp Solution link: codeforces.com/contest/1980/submission/264033670
Crack SQL Interview in 50 Qs Leetcode Problemset Introduction
มุมมอง 152 หลายเดือนก่อน
#leetcode #leetcodesql #sql #interview #interviewpreparation #sqlinterviewquestionsandanswers
B. Turtle and an Infinite Sequence Codeforces Round 949 (Div. 2)
มุมมอง 1442 หลายเดือนก่อน
B. Turtle and an Infinite Sequence Codeforces Round 949 (Div. 2)
D - Invertible Bracket Sequences Educational Codeforces Round 166 (Rated for Div. 2)
มุมมอง 1852 หลายเดือนก่อน
D - Invertible Bracket Sequences Educational Codeforces Round 166 (Rated for Div. 2)
C. Job Interview Educational Codeforces Round 166 (Rated for Div. 2)
มุมมอง 1.2K2 หลายเดือนก่อน
C. Job Interview Educational Codeforces Round 166 (Rated for Div. 2)
3165. Maximum Sum of Subsequence With Non-adjacent Elements Leetcode
มุมมอง 662 หลายเดือนก่อน
3165. Maximum Sum of Subsequence With Non-adjacent Elements Leetcode
1442. Count Triplets That Can Form Two Arrays of Equal XOR Leetcode Pod
มุมมอง 22 หลายเดือนก่อน
1442. Count Triplets That Can Form Two Arrays of Equal XOR Leetcode Pod
D Paint the Tree Codeforces Round 947 (Div. 1 + Div. 2)
มุมมอง 2642 หลายเดือนก่อน
D Paint the Tree Codeforces Round 947 (Div. 1 Div. 2)
B. Binary Colouring Codeforces 948 (Div 2)
มุมมอง 3022 หลายเดือนก่อน
B. Binary Colouring Codeforces 948 (Div 2)
1404. Number of Steps to Reduce a Number in Binary Representation to One Leetcode Problem Of the Day
มุมมอง 62 หลายเดือนก่อน
1404. Number of Steps to Reduce a Number in Binary Representation to One Leetcode Problem Of the Day
Problem C Nikita and LCM Codeforces Round 948 (div 2)
มุมมอง 4132 หลายเดือนก่อน
Problem C Nikita and LCM Codeforces Round 948 (div 2)
Codeforces 948 problem A Little Nikita solution in Malayalam
มุมมอง 472 หลายเดือนก่อน
Codeforces 948 problem A Little Nikita solution in Malayalam
1266. Minimum Time Visiting All Points Leetcode POD
8 หลายเดือนก่อน
1266. Minimum Time Visiting All Points Leetcode POD
React and Three JS interactive 3D website in malayalam
มุมมอง 158 หลายเดือนก่อน
React and Three JS interactive 3D website in malayalam
weekly contest 370 problem c Maximum Score After Applying Operations on a Tree solution explained
มุมมอง 89 หลายเดือนก่อน
weekly contest 370 problem c Maximum Score After Applying Operations on a Tree solution explained
weekly contest 370 problem a Find Champion 1 solution explained
มุมมอง 119 หลายเดือนก่อน
weekly contest 370 problem a Find Champion 1 solution explained
Next Js Tutorial Series Introductury Video.
มุมมอง 610 หลายเดือนก่อน
Next Js Tutorial Series Introductury Video.
please make for E
finally u r back, please don't stop making videos please, I love ur explanations,please make for every contest
Thank you, i will try to make videos consistently from now onwards
bro make more videos ,luv ur content
I am getting 403 error
thanks
Consider the case n=5 and k=12, so in the first iteration we are looking in the set for the value 6+1=7, which should return st.end() and dereferencing it should give a garbage value unless we handle this case. I don't understand how did it get accepted.
Thank you for the explanation.
keep it up bhai, nice explanation
could you explain why this code is not getting accepted though I went with a similar approach #include <bits/stdc++.h> using namespace std; #define ll long long int main() { int t; cin >> t; while (t--) { long long n, k; cin >> n >> k; // Check if k is odd if (k % 2 != 0) { cout << "NO" << endl; continue; } // Calculate the maximum possible sum long long sum = 0; long long m = n / 2; for (int i = 1; i <= m; i++) { sum += (n - 1 + (i - 1) * 2); } sum = 2 * sum; // Check if k is larger than the sum if (k > sum) { cout << "NO" << endl; continue; } else if (k == sum) { // If k is equal to the sum, print the array in descending order cout<<"YES"<<endl; for (int i = n; i >= 1; i--) { cout << i << " "; } cout << endl; continue; } else if (k == 0) { // If k is zero, print the array in ascending order cout<<"YES"<<endl; for (int i = 1; i <= n; i++) { cout << i << " "; } cout << endl; continue; } // Initialize the array x vector<ll int> x(n + 1); for (int i = 1; i <= n; i++) { x[i] = i; } // Adjust the array based on the value of k ll int low = 1, high = n; while (k != 0 && low < high) { ll int diff = high - low; ll int adjustment = 2 * diff; if (adjustment <= k) { swap(x[low], x[high]); k -= adjustment; low++; high--; } else { high--; } } // Print the resulting array cout<<"YES"<<endl; for (int i = 1; i <= n; i++) { cout << x[i] << " "; } cout << endl; } return 0; }
Can you give the mathematical proof to say that this one pass algorithm does not give false negatives?
"Do you agree that the sequence of operations does not matter? Because addition is assosciative. Do you agree that if first element is x, you need to apply x operations on 2nd element, regardless of sequence of operations because it is the only way you can make the first element 0? There you go." ~ Grecil Unadkat
why are u using remain + i + 1 why not just remain
Because we are doing val - (i+1) below, there we subtract i+1 from val. So to negate that, we are taking remain + i + 1, so that the subtraction below wont affect it.
Please let me know if you need further explanation
bro crystal clear explanation
Thank you, it means a lot
Thanks for this explanation. Do you have any recommendations for improving observation skills?
Not really, I have explained how I observed the observations in the problem, it was either by trying to find a pattern or trying to think in terms of how I have solved similar problems previously.
We're you able to understand my explanation properly?
@@jeevanalexen yup I was able to understand your explanation, thanks a lot, but I am not able to make good observation and notice the pattern. is it improved by practice or is there technique to do this?
@@mennaselim409it can be improved only by practise.
Please keep posting 🙏
Thank you, we're you able to understand the solution?
edaa monee
Hlo, ithe aara?
@@jeevanalexen ur subscriber i want to contact you bro
@@jeevanalexen ninaka egana contact cheyadiya ...
@@craftanddiy4773 give me your whatsapp no, I will msg you
@@jeevanalexen hello
Believe it or not, this is too close to my graduation work, I will present it on thursday 20 june, exactily one week from now "UTC+1", Moxico, Angola...
Oh really? What's your graduation project about?
Just love your video...
Thank you so much 😀
Can't we do it like we find sum of all rows or columns of both given Matrix and compare them if they have same elements print yes eles no ??
Show the code as well
Hi, I have shown it after the explainanation
@@jeevanalexen It's not in the video
@@manishukla7164sorry my mistake, I will add the link of the code in description
Amazing explanation 🔥
Thank you so much❤
op .
Thanks a lot
super amazing, I understood very very good keep going
Thank you very much for this comment
sorry but do you have some speaking problems? like sneezing, speaking slow and unclear, talking in self doubt. Improve this bro, doesnt sounds decent.
Sorry, I will try to improve it in the future. Thank you for your comment.
Is that code got accepted?
Yes, it got accepted
@@jeevanalexen how!!! You are using double loop. Time got exceeded.
@@riser636 first loop is a square root loop
@@jeevanalexen yeah but it didnt worked. time got exceeded
@@riser636 maybe it was the way you are using the map, try to use map.find(), it is O(1) complexity compared to using map the other way which O(logn) complexity. If you share the link of your submission, I can help you further
really worthy explanation. keep it up
Thanks a lot🙌
Good
Thank you for this comment🙌
Can you please put the link to the code ?
Sure, I have pasted the link in description.
Very few people has explained this you explained great nice job
Thank you for your kind comment 🙏
Amazing brdr!!
Thank you 🙏
nice explanation 👍
Thank you for your kind words.
is good thing
Hi, I didnt understand your comment, Please let me know if you have any doubts or need further clarification.
@@jeevanalexen this vedio is good thing
thx bro!!
Happy to help, if you any need help with any topics, please let me, i will try to make videos on that as well.
didnt get what is the use of prefix array?
It will compute the total skill that we are taking till the ith candidate.
Please let me know if you need further clarification
Genius!!!....really liked the way u explained it was amazing
Thank you soo much for this comment :)
bhai tu bhagwaan hai
Thank youu😂, this comment made my day
nice logic
Thank you, means a lot
awesome brother!!
Thank you
finally understood the solution bcz of u man!! Thanks man!!!
Thank you for this comment, means a lot❤
Can you please comment whether this video was useful or not. This will help me in making much better videos in the future
I was half sleepy when i was making this video, if you guys have any doubts, please ask. I will post the solution of problem B in another 10 minutes
If you can please comment what do you expect from my future videos