Размер видео: 1280 X 720853 X 480640 X 360
Показать панель управления
Автовоспроизведение
Автоповтор
Okay July easy going so far, means next week is gonna be 🤐, what do you guys think 💭
aryan bhai pls check mail by me
For sure😢😢
hello bhai I have used your tips and got job. Thanks brother.
great explanation, I think there were some problem with the mic while you were recording this.
Great Explanation 🤩
@15:21 shouldn’t ans[1] be equal to max of ans[1], id-first rather than max of ans[0], id-first??
Easy Question if u are familiar with linked list. Solved on my own
my solution:similar approachclass 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; }};
aryan bhai check krlijiye pls goldman ka issue aapse mail kr rkha
first comment
❤️❤️🫡
Okay July easy going so far, means next week is gonna be 🤐, what do you guys think 💭
aryan bhai pls check mail by me
For sure😢😢
hello bhai I have used your tips and got job. Thanks brother.
great explanation, I think there were some problem with the mic while you were recording this.
Great Explanation 🤩
@15:21 shouldn’t ans[1] be equal to max of ans[1], id-first rather than max of ans[0], id-first??
Easy Question if u are familiar with linked list.
Solved on my own
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;
}
};
aryan bhai check krlijiye pls goldman ka issue aapse mail kr rkha
first comment
❤️❤️🫡