1996. The Number of Weak Characters in the Game

PROBLEM LINK : leetcode.com/problems/the-num...
SOLUTION LINK : github.com/niveditaprity/Leet...

[@techadorabynivedita]

Please do comment , like share and subscribe!! Your one click is my motivation 😁

[@ashishkumaryadav5252]

Exceptional content, best explanation on youtube.

[@techadorabynivedita]

Glad you think so!

[@gitanjalikumari9262]

Di u just explained so well...plz uploading such video😘

[@techadorabynivedita]

Thank you 😊 Keep learning

[@chandrakantkhannade7326]

Really liked your efforts,Bhot effective thha

[@techadorabynivedita]

Thank you 😊

[@triposat]

Good Explanation!

[@techadorabynivedita]

Glad you think so!

[@085-vaibhavgusain9]

understood your logic but having trouble implementing it in java. thank u for the help with the java code last time

[@techadorabynivedita]

Okay i will add java code too on github

[@indra16]

subscribed 😃

[@techadorabynivedita]

Thank you

[@chandlerbing8164]

for drawing Do you use mouse or graphic tablet ?

[@devtorch]

hello @nivedita, thanks for the video, the explanation was quite clear. appreciate your efforts.

[@techadorabynivedita]

Welcome :) , please recommend my channel to your friends

[@rockyraj9571]

Great Explanation...!

[@techadorabynivedita]

Thank you :)

[@narolavarshil6067]

Actually sorting descending for attack and if same attack then sort in ascending defence and then keeping track of maximum defence uptill current index is more intuitive.. Just a thought

[@Mr_SSK]

You are doing great! Keep going...

[@techadorabynivedita]

Thank you :)

[@sparshverma9814]

What is time complexity of this code!🥰🥰

[@techadorabynivedita]

Nlogn

[@sparshverma9814]

@@techadorabynivedita Thank you Mam, for such quick and immediate response❤

[@mr.naresh3004]

thanks ma'am..

[@techadorabynivedita]

Most welcome 😊

[@mrityunjoybarman9098]

I am not getting the point why sorting in desending of defense?

[@techadorabynivedita]

Properties are sorted based on attack first in asceding order When attack levels are same then defense in descending We will start from last beacuse we know last one has highest attack level so any other attack level in left side will be either equal or less Whenever attack level will same Ex [1,9] [1,5] then we also know that left side character will greater level of defense so we wont consider it.

[@raimasoni3013]

I have started watching your videos, the concepts are quite clear and it helping me a lot in building logic. thankyou so much and keep going...!!❤

[@techadorabynivedita]

You are most welcome:),glad it helped you ,keep learning

[@dipanshmalhotra564]

didi aapko pta kaise chla ki loop ulta lagana h like kind of greedy problem??

[@techadorabynivedita]

ye already pta tha ki characters ko compare krne hoge right fir km se km comparison me ho jaye iske sort and back se start krna hoga , start se v kr skte fir sorting different way me krna hoga

[@dipanshmalhotra564]

@@techadorabynivedita op didi nice thank you didi for explaination ;)

[@dipanshmalhotra564]

and monotonic h function toh hm yaha binary search ka use bhi kr kste h na?

[@techadorabynivedita]

han binary search use kr skte but dono me same TC o(nlogn) hoga but ye easy lga mujhe

[@moviespartner5393]

hi I followed the same approach but got TLE 😔😔 can anyone let me know what I have done wrong. class Solution { public: static bool comp(vector a,vector b) { if(a[0]!=b[0]) return a[0]b[1]; } int numberOfWeakCharacters(vector& properties) { int n=properties.size(); int count=0; sort(properties.begin(),properties.end(),comp); int def=properties[n-1][1]; for(int i=n-2;i>=0;i--) { if(properties[i][1]

[@shivamrai229]

class Solution { public: static bool comp(vector &a,vector &b) { if(a[0]!=b[0]) return a[0]b[1]; } int numberOfWeakCharacters(vector& properties) { int n=properties.size(); int count=0; sort(properties.begin(),properties.end(),comp); int def=properties[n-1][1]; for(int i=n-2;i>=0;i--) { if(properties[i][1]

[@rakshithr1453]

in comp function pass it by reference static bool comp(vector &a,vector &b)

[@thegreekgoat98]

Why are you not comparing the attack value while traversing from backwards? I think the following code is perfect: class Solution { public: bool static cmp(vector&a,vector&b) { if(a[0]==b[0]) return a[1]>b[1]; return a[0]=0;i--) { if(prop[i][1]>maxdef) maxdef=prop[i][1]; if(prop[i][0]>maxatt) maxatt=prop[i][0]; if(prop[i][1]

[@techadorabynivedita]

No need to compare because properties are sorted based on attack in ascending order and when they are equal then defence in desc order if we start from last we are sure that left side value will either equal or smaller than current one and when attack will be equal then defence level will be greater than current one

[@neelam5170]

when the input is:[[1,5],[1,9],[2,4]],the answer must be 0,but ur code gives 1...coz u may have equal item[0] values for the items with items[1] being higher.

[@techadorabynivedita]

It will give zero because after sorting [1,9] [1,5] [2,4] Now look at my code and compare you will get zero