A-E | Codechef Starters 135 Editorials | Graph Cost | Change A to B | Invert And Equalize

A-E | Codechef Starters 135 Editorials | Graph Cost | Change A to B | Invert And Equalize | Abhinav

Рет қаралды 3,162

Күн бұрын

🔥 Subscribe to coding75 Pro for Live Classes, 1:1 Mentorship Sessions: coding75.com/pro
✅ Live DSA Classes
✅ Codeforces, Codechef, Leetcode Live Discussion
✅ 1:1 Mock Interviews
✅ 1:1 Mentorship Sessions
✅ 1:1 Resume Review
✅ Live Weekly Project Building Sessions
✅ Live CS Fundamental Classes
In case of any queries regarding coding75, WhatsApp us here: wa.me/message/TPN76XLWVOWDB1
Or join our updates group: chat.whatsapp.com/KAXRJJUx2lA...
Subscribe to the channel for Amazing Coding and Competitive Programming Content.
Problem A: coding75.com/dsa-cp/codechef/...
Problem B: coding75.com/dsa-cp/codechef/...
Problem C: coding75.com/dsa-cp/codechef/...
Problem D: coding75.com/dsa-cp/codechef/...
Problem E: coding75.com/dsa-cp/codechef/...
🚀 Join Telegram for Post Contest Discussions, Coding Meets, and Important Updates, Join a Community of over 20,000+ Coders: t.me/cpabhinav
📌 Follow me on Instagram for Regular Updates: / iammabhinav
📌 Join my family of 40K+ on Linkedin: / abhinavawasthi01
📌 Whatsapp Channel: whatsapp.com/channel/0029Va55...
👉🏻 Coding Profiles
My Codeforces: codeforces.com/profile/abhina...
My Codechef: www.codechef.com/users/abhina...
My Leetcode: leetcode.com/abhinavawasthi/
👉🏻 Connect with Me
LinkTree- linktr.ee/abhinavawasthi
My LinkedIn- / abhinavawasthi01
My Instagram- / iammabhinav
My Facebook- / awasthi.abhinav.3
My Twitter- / call_me_abhinav
Coding Blogs- abhinavawasthi.code.blog/
coding
programming
competitive programming
software developer
software engineer
interview preparation
interview experience
dsa
Codechef Starters 135 Editorials
Codechef Starters 135
Graph Cost
Graph Cost codechef
Graph Cost codechef solution
Graph Cost solution
Graph Cost editorials
Graph Cost codechef editorials
Change A to B
Change A to B codechef
Change A to B codechef solution
Change A to B solution
Change A to B editorials
Change A to B codechef editorials
Invert And Equalize
Invert And Equalize codechef
Invert And Equalize codechef solution
Invert And Equalize solution
Invert And Equalize editorials
Invert And Equalize codechef editorials
Football Ties
Football Ties codechef
Football Ties codechef solution
Football Ties solution
Football Ties editorials
Football Ties codechef editorials
RCB vs CSK
RCB vs CSK codechef
RCB vs CSK codechef solution
RCB vs CSK solution
RCB vs CSK editorials
RCB vs CSK codechef editorials
00:00 coding75 Pro Bootcamp
01:45 Codechef Starters 135 Editorials
02:33 RCB vs CSK
04:38 Football Ties
08:36 Invert And Equalize
15:00 Change A to B
26:52 1:1 Mentorship & Live Classes
27:30 Graph Cost
47:50 Outro

Пікірлер: 25

@AbhinavAwasthi Ай бұрын

@shreyanshjain1595 Ай бұрын

VERY WELL EXPLANATION MUCH BETTER THAN TLE ELIMINATORS

@asthajain2511 Ай бұрын

so true !!

@MayankSingh-jl9ob Ай бұрын

Prob is just rain trapping variation, just use stack and fill all increasing if got any min remove all greater elements

@darshanrajpattanaik2154 Ай бұрын

Can you share the stack implementation?

@anonymousanonymous7507 Ай бұрын

good

@namanmishra6204 Ай бұрын

26:30 i did it with the same approach but solution got rejected... i did it in C

@abcd76820 Ай бұрын

can anyone tell me why this fails coz we want to cover difference between b and a using subtraction and division while(t-- > 0) { int a = sc.nextInt(); int b = sc.nextInt(); int k = sc.nextInt(); int diff = b-a ; int operation = 0; // we want all gaps to be covered if(diff/k >=a) {operation = diff / k ; diff = diff%k; } operation += diff-a ; System.out.println(operation); }

@jillurrahmanriyad3103 Ай бұрын

In the graph cost problem wasn't there any possibilty that from the first index we move to the non-cheaper node but from that node we get better choice and get the min ans? example suppose node1->node2 cost=5 node1->node3 cost=7 node2->node4 cost =34 node3->node4=20 node1->node4=20*3=60 node1->node2->node4=41 node1->node3->node4=27 please explain.

@vimalkumardubey6834 Ай бұрын

How node2->node4 can be 34 bro?? According to your data value of 4 means arr[3] = 20 Then maximum will be 20 and 34 is not a multiple of 20 If maximum is node 4 then the value will be >=40

@vimalkumardubey6834 Ай бұрын

Also node1->node5 = 5 means node 2 is

@jillurrahmanriyad3103 Ай бұрын

@@vimalkumardubey6834 Yeah. Thanks bro. I was actually confused a a bit. Thanks for the clarification💙

@vitaminprotein2217 Ай бұрын

in change A to B is it good to apply rec/DP?

@Iammuslim947 Ай бұрын

I think its not good becoz constraints are so high (in order of 10^9) most probably u will get tle even after the memoization

@stuartYoung559 Ай бұрын

why we need sum. no need of it. .just jumping will be enough.

@OnlyAyushAgarwal Ай бұрын

Nice

@sumandey8257 Ай бұрын

Can anyone explain that,a=2,b=23,k=5 through the given code. Since 23 is not divisible by 5 then after 3 operations b=20.Now count=3. Then b=20 is divisible by k=5 then b =4 and count becomes=4. Here the doubt comes. Then b=4 is not divisble by k=5 then.then comes to else part and b=b-(b%k) which is 0 will be but that can't be true...how the code will work there when b becomes 4... Please anyone clear this.

@EngineeringEssentialsOfficial Ай бұрын

yeah b becomes zero and count becomes 8 then still code will not break and while loop runs and comes to else if part where 0%5==0 then b=0 and a=2 so count will be count=count-2; means count will became 6...

@sumandey8257 Ай бұрын

@@EngineeringEssentialsOfficial Thanks thanks and thanks for clearing the doubt 👍

@EngineeringEssentialsOfficial Ай бұрын

@@sumandey8257 Welcome

@jillurrahmanriyad3103 Ай бұрын

Congratulations RCB!

@25arushbhatnagar56 Ай бұрын

ab bol

@jillurrahmanriyad3103 Ай бұрын

@@25arushbhatnagar56 Next year cup namde(NB mene RCBvsRR ke bad i comment kiya tha)

@vimalkumardubey6834 Ай бұрын

17:58 it doesn't make sense...that number can become very large that's why we are doing it in reverse manner...because at most we will be reaching b...that is 1e9 Instead...we Can say that we are doing it in reverse manner to know when to remove fractional part and to utilise type 2 operations efficiently..... b%k !=0 means some fractional part will be there this denotes perform some tines type 1 operation and then continue with type 2