![A Code Daily!](/img/default-banner.jpg)
- 177
- 253 958
A Code Daily!
Приєднався 31 гру 2022
Fitness and lifestyle channel: www.youtube.com/@i_pranavmehta
-Upsolving contest problem (Codechef, Codeforces, Leetcode)
-lecture series for beginners and intermediate coders (different series for different levels)
-Daily challenges and thought provoking problems from websites likes Leetcode and GFG
-detailed solution on any problem (just mention the problem in any of the comments)
(Intermediate) Pro coders- discord.gg/H8TeFjvq6z
About me
Software Engineer, competitive programmer, power lifter, fitness and tech enthusiast. DM on discord for anything tech related and insta,twitter for anything fitness related!
twitter: i_pranavmehta
instagram: pranav.aesthetics
discord: discord.com/invite/H8TeFjvq6z
Coding profiles -
CC- i_pranav (5star)
CF- i_pranavmehta (Candidate Master)
Leetcode- i_pranav (Guardian)
linkedin - www.linkedin.com/in/pranav-mehta-b5a18b1ba/
-Upsolving contest problem (Codechef, Codeforces, Leetcode)
-lecture series for beginners and intermediate coders (different series for different levels)
-Daily challenges and thought provoking problems from websites likes Leetcode and GFG
-detailed solution on any problem (just mention the problem in any of the comments)
(Intermediate) Pro coders- discord.gg/H8TeFjvq6z
About me
Software Engineer, competitive programmer, power lifter, fitness and tech enthusiast. DM on discord for anything tech related and insta,twitter for anything fitness related!
twitter: i_pranavmehta
instagram: pranav.aesthetics
discord: discord.com/invite/H8TeFjvq6z
Coding profiles -
CC- i_pranav (5star)
CF- i_pranavmehta (Candidate Master)
Leetcode- i_pranav (Guardian)
linkedin - www.linkedin.com/in/pranav-mehta-b5a18b1ba/
Count Number of Possible Root Nodes | Tree rerooting | Leetcode 2581| Discord live session
twitter: i_pranavmehta
discord: discord.com/invite/H8TeFjvq6z
problems to practice: iitracin-my.sharepoint.com/:w:/g/personal/p_mehta_cs_iitr_ac_in/EW64GwKABdlMm1oSn2RfjYkB0KX8aoDwlts1Hhf8EzZW6w?e=GfFOJ6
prev session on tree rerooting: ua-cam.com/video/Ox_sc84fHV0/v-deo.htmlsi=iuE9y64EKGxFxzUB
#coding #cp #leetcode #code #ACD #cpp #solve #DSA
discord: discord.com/invite/H8TeFjvq6z
problems to practice: iitracin-my.sharepoint.com/:w:/g/personal/p_mehta_cs_iitr_ac_in/EW64GwKABdlMm1oSn2RfjYkB0KX8aoDwlts1Hhf8EzZW6w?e=GfFOJ6
prev session on tree rerooting: ua-cam.com/video/Ox_sc84fHV0/v-deo.htmlsi=iuE9y64EKGxFxzUB
#coding #cp #leetcode #code #ACD #cpp #solve #DSA
Переглядів: 1 310
Відео
2 pointers and sliding window | CF and LC | ACD course on CP
Переглядів 1,2 тис.6 місяців тому
discord: discord.com/invite/H8TeFjvq6z twitter: i_pranavmehta problems: iitracin-my.sharepoint.com/:w:/g/personal/p_mehta_cs_iitr_ac_in/EYL3yxNlDl5FrZ7jVbYeCx0BQEBTRJ2eVF7 ye7LOdWHA?e=n1BGzr thumbnail credits: vidya4sure Acodedaily #cp #Leetcode
Greedy Part 2 | ACD Course on CP | Codeforces and Leetcode problems
Переглядів 1,2 тис.6 місяців тому
more problems: iitracin-my.sharepoint.com/:w:/g/personal/p_mehta_cs_iitr_ac_in/EaOcX2RK-cFKr11iU94rvacBuebZTIKVitpepI2v8ybZ1Q?e=CNNj3g Greedy -1 : ua-cam.com/video/bJp_ZPESFMc/v-deo.html discord: discord.com/invite/H8TeFjvq6z twitter: i_pranavmehta thumbnail credits: vidya4sure Acodedaily
Greedy Part 1 | ACD Course | Watch at 2x
Переглядів 2,5 тис.7 місяців тому
discord: discord.com/invite/H8TeFjvq6z twitter: i_pranavmehta problems: iitracin-my.sharepoint.com/:w:/g/personal/p_mehta_cs_iitr_ac_in/EbEgJpkrk1dKjnF4ZzmBDbQB4qtDVdyysweIUvous-XV4A?e=nWfOWo thumbnail credits: vidya4sure
bitwise operations | ACD CP Course lec-4 | watch at 2x | bit-ops
Переглядів 2 тис.7 місяців тому
bits blog: codeforces.com/blog/entry/95490 problems: iitracin-my.sharepoint.com/:w:/g/personal/p_mehta_cs_iitr_ac_in/Ef1RkWCTPwdBhNLQeXDh7l4BzffFSBULZHH9GfIxnzMlrQ?e=Z4Fdth discord: discord.com/invite/H8TeFjvq6z twitter: i_pranavmehta acodedaily a code daily CP a code daily competitive programming
Time and Space complexity Analysis | ACD CP Course Vid -4 | Watch at 1.5x
Переглядів 1,9 тис.7 місяців тому
codeforces.com/blog/entry/21344 #code #cpp #cp #DSA #cf
Maths for CP Part 3 | Combinatorics | ACD course video-3
Переглядів 2,6 тис.7 місяців тому
#maths #cp #code #cpp #cf #cc #atc Problems: iitracin-my.sharepoint.com/:w:/g/personal/p_mehta_cs_iitr_ac_in/Eejsbs6JRzhAug1Nyj2NI-EBFX5_Q4Nygm5rHj8tEKknVw?e=YeUUSq Python snippets: github.com/abcsumits/cp_with_python/blob/main/cp/combmod.py
Maths for CP part 2| Exponentiation and Modulo Maths | for beginners | ACD course | Watch at 1.5x
Переглядів 2,9 тис.7 місяців тому
#cp #cpp #code #cf my IDE setup: ua-cam.com/video/9eX2FJhxvzI/v-deo.htmlsi=mWw7QNjOXKbrtQWs problems: iitracin-my.sharepoint.com/:w:/g/personal/p_mehta_cs_iitr_ac_in/EWYhPkxClmJFjEUCXy8jfmQBApcoSQQ88ze-XeY_2p5Q6g?e=MHY4YK discord: discord.com/invite/H8TeFjvq6z
How I solve problems faster (Thought process) on LC, CF, CC, Atc | LC daily challenge | watch at 2x
Переглядів 3,9 тис.7 місяців тому
#code #cp #dsa #cc #codechef #cf #coding
Maths for CP | Part 1 | basics | Number theory | watch at 1.5x
Переглядів 9 тис.7 місяців тому
resources and problems: iitracin-my.sharepoint.com/:w:/g/personal/p_mehta_cs_iitr_ac_in/Ee2C0Y4CFA5NmxdZ2DFDroYB6WT1UNpHB-nt2PPxr8hDNw?e=YodLg0 my setup: ua-cam.com/video/9eX2FJhxvzI/v-deo.html For any doubts please reach out on the discord server (preferably the general channel): discord.com/invite/H8TeFjvq6z
CP Course Starts | Roadmap | How to excel | Resources
Переглядів 8 тис.7 місяців тому
#dsa #cp #cpp #code #cf #codeforces
I'm quitting CP | Free coding course | CP+placement course! |
Переглядів 7 тис.8 місяців тому
twitter: i_pranavmehta YT: youtube.com/@GrindCoding discord: discord.com/invite/H8TeFjvq6z #coding #cp #dsa #faang #placements #cpp #code #grind
Mo's algo | Discord discussion | Easy concept
Переглядів 1,1 тис.8 місяців тому
Mo's algo | Discord discussion | Easy concept
square root decomposition | Discord discussion | Mo's algo prereq
Переглядів 3739 місяців тому
square root decomposition | Discord discussion | Mo's algo prereq
Lazy segment tree | Discord discussion | CP concept | Med- advanced
Переглядів 3059 місяців тому
Lazy segment tree | Discord discussion | CP concept | Med- advanced
Segment Trees (Beginners) | Discord discussion | Basics | CSES | Implementation
Переглядів 5999 місяців тому
Segment Trees (Beginners) | Discord discussion | Basics | CSES | Implementation
Codeforces Round 895 | Problem A-E (Div. 3) | Data Structures Fan | Plus Minus Permutation
Переглядів 1,2 тис.11 місяців тому
Codeforces Round 895 | Problem A-E (Div. 3) | Data Structures Fan | Plus Minus Permutation
Codeforces Round 888 (Div. 3) | Problems A-E
Переглядів 1,6 тис.Рік тому
Codeforces Round 888 (Div. 3) | Problems A-E
Leetcode Biweekly Contest 109 | By Kaushik.
Переглядів 374Рік тому
Leetcode Biweekly Contest 109 | By Kaushik.
Codeforces Round 885 | Problem A-C | Vika and Price Tags | Vika and the Bridge
Переглядів 4,5 тис.Рік тому
Codeforces Round 885 | Problem A-C | Vika and Price Tags | Vika and the Bridge
Tries Basics | Leetcode | For Placements and CP
Переглядів 468Рік тому
Tries Basics | Leetcode | For Placements and CP
Codeforces round 884 | Problem A-D | D. row major | C. particles | B. permutation & primes
Переглядів 1,4 тис.Рік тому
Codeforces round 884 | Problem A-D | D. row major | C. particles | B. permutation & primes
Codeforces 883 (Div3) | Problem A-E2 | By Kaushik
Переглядів 2 тис.Рік тому
Codeforces 883 (Div3) | Problem A-E2 | By Kaushik
Codeforces Round 882 (Div. 2) | Vampiric powers, anyone? | Hamon odyssey |The man who became a god
Переглядів 3 тис.Рік тому
Codeforces Round 882 (Div. 2) | Vampiric powers, anyone? | Hamon odyssey |The man who became a god
ACDLadders | A Code Daily Ladders | Free tool for maximum CP growth
Переглядів 2,6 тис.Рік тому
ACDLadders | A Code Daily Ladders | Free tool for maximum CP growth
A Code Daily Portal Discord discussion.
Переглядів 522Рік тому
A Code Daily Portal Discord discussion.
Codeforces Educational Round 150 (Div. 2) | D. Pairs of Segments | C. Ranom Numbers |
Переглядів 3,1 тис.Рік тому
Codeforces Educational Round 150 (Div. 2) | D. Pairs of Segments | C. Ranom Numbers |
codeforces Round 875 (Div. 2) | C. Copil Copac Draws Tree | B. Array merging | A. Twin Permutations
Переглядів 4,2 тис.Рік тому
codeforces Round 875 (Div. 2) | C. Copil Copac Draws Tree | B. Array merging | A. Twin Permutations
Codeforces Educational round 149 | D. Bracket Coloring | C. Best Binary String |B. Comparison String
Переглядів 1,8 тис.Рік тому
Codeforces Educational round 149 | D. Bracket Coloring | C. Best Binary String |B. Comparison String
Codechef Starters 90 | Sum of goodness | Crushed Apple and balance scale | Anti Palindrome
Переглядів 1,4 тис.Рік тому
Codechef Starters 90 | Sum of goodness | Crushed Apple and balance scale | Anti Palindrome
I had a doubt does CPH judge submit works during contests? I was trying it during the last contest and it didn't seem to work for me. But on other problems it works like a charm. Great video, watching it for the 2nd time.
How to do this problem using visualogo? Please reply
Hey dude, thanks for the video :)
Which tools and devices you are using to draw this way?
the extension is now available on chrome
Awsome!
Where do I find the problem set?
Best explanation on YT brother
How to do for Java ?
it is not working
Not so a good explaination
I know you might not answer but here is my doubt on D1: Suppose lastUsed variable tells which program is running on CPU1. Let's say a3 is running on cpu1 and a1 is running on cpu2. Now at i=4, we can see that a[i-1], i.e., a[3] is running on cpu1 but how can we comment what is running on cpu2?
Now if a[i-1] was not running on cpu1 then we can obviously comment that it must be running on cpu2 but I am concerned about the case stated above.
Great explanation
Bhaiya plz ek or profile review session karo
thank you ❤
sample % python3 ../test.py -c correct.cpp -w wrong.cpp -g generator.cpp -t 1
21:35 bro came here to flex and get appreciation.. //that was visible throughout the conversation
thanks man, it makes my cpp coding 7000ms faster ⚡⚡⚡
thx,finally understand
thanks
Fyi, Kev became candidate master 😅 (I am not Kev btw)
iirc, I took his mock interview and he's in JPMC now!
Hey Pranav and Arpit, This really brings back memories of my previous summer, those CP grinds were well worth it. The mock interviews were amazing for me and I am glad I was able to connect with you (I am Kev btw 😃😃)
Note: (n-r)+1 ✅ (n-r+1) ❌
okay but whats the answer to the question in the thumbnail?
Wow! what an explanation with drawings.... You are a very good teacher...
Just a little doubt , can we consider any node as root node and answer will be same????
nooooooo
Very nice explanation sir, Thank you!
Sir, I thought of an approach that if the count of the bits at particular point is 1 if it is greater than or equal to n then it's gonna fail because we can't make the number out of it. And I have taken care of the fact that it occurs in different numbers. but at the 2nd test case it give TLE
what for this test case n=5 3=1 2 3 3=1 2 3 4=1 2 3 4 3=1 2 3 3=1 2 3
should it not be 1/1000, 1/999 and 1/998?
Are you iit graduated??
Hey! may you help me why my code is showing wrong answer on test case 2 . Output of my code on wrong test case is same as yours, also on other test cases. #include<bits/stdc++.h> using namespace std; #define int long long vector<int>divisors(int n){vector<int>v;for(int i=1;i*i<=n;i++){if(n%i==0){if(n/i==i){v.push_back(i);}else {v.push_back(i);v.push_back(n/i);}}}sort(v.begin(),v.end());return v;} void func(){ int n; cin>>n; vector<int>v; v=divisors(n); int t=v.size(); int cnt=0; int j=0; // for(int i=0;i<t;i++)cout<<v[i]<<" ";cout<<endl; while(j<t){ cnt++; if(v[j]-v[j-1]>1){ break;//abababababa } j++; } // cout<<cnt<<endl; string s; char ch='a'; for(int i=0;i<n;i++){ // cout<<ch; s+=ch; ch+=1; if(ch-'a'>=cnt)ch='a'; } cout<<s<<endl; } signed main(){ int T=1; cin>>T; while(T--){ func(); } return 0; }
thanks man.
Nice
submit feature is only limited to Firefox :(
I am currently learning Dsa(java) can i do cp (c++)also along with it
Sir, please do upload the videos on prefix sum and recursion / dfs.....
Well a brilliant video. Comprehensively covers everything for everyone. I think Creating UA-cam shorts out of the answers to the questions would help in increasing the growth of this channel even further.
nice stream . enjoyed it
best channel for PCD's 👍👍👍👍
pcd?
@@batmanlovesjokerr post contest discussion
It is pretty difficult to find the intuition behind the solutions of these questions 🥲🥲🥲. It is my sincere request that you please either upload the questions of different platforms where the video solutions are also available on the internet or you yourself make a dedicated video discussing the solutions of the given problems. It is really difficult for newbies to understand from someone else's code 🙏🙏🙏
The traversal in the solution from u->v is o(logn) since set is used, however it can be decreased to o(1) by using some other DS.
🔥🔥
🤍
🔥🔥
Hello bhaiya how to get started with competitive programming Bahut confuse ho raha hai please path dedo bhaiya Please reply😄
bhai I've already a video for the ACD course you can start with it. everything is always gonna be free so start from the video 1 . I've already published more than half of the course
hi sir pls help me i don't know what to do and how to do i will be completing my class 12 this year what is the first step and can you pls suggest me a roadmap. I got a suggestion to start learning java script but is it right or should i learn c++ and acc to you the what will be the first step
Chill out bro! You're in 12th rn. You can join the server to interact with more people and try to understand where you interest lies. Choice of language would depend on what you're trying to accomplish.
Sir, please upload the remaining videos soon.....
yes sir,
🤓
good to have you back sir