2058. Find the Minimum and Maximum Number of Nodes Between Critical Points | Greedy | Linked List

[@ARYANMITTAL]

Okay July easy going so far, means next week is gonna be 🤐, what do you guys think 💭

[@karthikmadan]

aryan bhai pls check mail by me

[@abinash1878]

For sure😢😢

[@kgjr.6224]

hello bhai I have used your tips and got job. Thanks brother.

[@codingkart245]

great explanation, I think there were some problem with the mic while you were recording this.

[@sanukumar256]

Great Explanation 🤩

[@Mehul_14403]

@15:21 shouldn’t ans[1] be equal to max of ans[1], id-first rather than max of ans[0], id-first??

[@manishgaming4638]

Easy Question if u are familiar with linked list.
Solved on my own

[@naamnhibataunga5897]

my solution:
similar approach
class Solution {
public:
vector nodesBetweenCriticalPoints(ListNode* head) {
vector ans(2,-1);
ListNode *slow=new ListNode();
ListNode *curr=head;
ListNode *fast=head->next;
if(!fast || !fast->next) return ans;
int firstcritical=-1;
int lastcritical=-1;
int mindistance=INT_MAX;
int count=1;
slow=curr;
curr=fast;
fast=fast->next;
while(fast){
if((curr->val>slow->val && curr->val>fast->val) || (curr->valval && curr->valval)){
if(firstcritical==-1){
firstcritical=count;
}
else{
mindistance=min(mindistance,count-lastcritical);
ans[1]=count-firstcritical;
ans[0]=mindistance;
}
lastcritical=count;
}
count++;
slow=curr;
curr=fast;
fast=fast->next;
}
return ans;
}
};

[@karthikmadan]

aryan bhai check krlijiye pls goldman ka issue aapse mail kr rkha

[@sabbyasachichakraborty1824]

first comment

[@ARYANMITTAL]

❤️❤️🫡