Great , how you explain each question in its own way, not spoon feeding but everytime motivating us giving hints to try solving the questions on ourself. Nice teaching methodology.
Bhaiya mza aa gya chuki apka vedio dekha stack par and cllge mai bhi start hua hai so jada relate kar pa raha hu thank you bhaiya and time stamp ke liye bhi
1:37:15 Jis element ka ka next greatest present nhi hai Ans wale array me us index par st.top()+1 store kar dena hai Example:- agar array me 60 ki jagah 150 store hota to ham ans wale array me 4th index par 5 store karte
bhai do ques hai mere shuru se dekhrhe ho ye dsa aur doosra ques ye hai kiiii "love babbar ka PAID" ya " rohit negi ka FREE" PLS THODA EXPLAIN KRNA bcoz mujhe start krna hai ab dsa and ig aap smjhrhe honge ki kya ques ya confusion mein hoonga mai
at 28:24 we can use while loop also which is TC=O(N) :---> class Solution { public: //Function to find the next greater element for each element of the array. vector nextLargerElement(vector arr, int n){ // Your code here vectorans(n,-1); stackst; int k=0; while(karr[st.top()]) { ans[st.top()]=arr[k]; st.pop(); } else { st.push(k); k++; } } return ans; } };
39:40 //Next grater element //This is to check next greater in circular manner which works for all test cases. class Solution { public: vector nextLargerElement(vector &arr, int n){ vectorans(n,-1); stackst; for(int i =0 ;i
Next Greater Element 2 Solution /* //Solution 1 //using an extra vector of 2 * n //looping from 2*n to 0 vector nextGreaterElements(vector& nums) { int n=nums.size(); vectorarr(n*2,0); vectorans(n*2,-1); for(int i=0;i=0;i--){ while(!st.empty()&&st.top()=0;i--){ while(!st.empty()&&st.top()
Where is My Rose?
Happy Rose Day bhaiya
Bhaiya aapko koi de to mujhe jarur dena😢😢
🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹
bhaiya you are great jo concept mujhko love baber or striver ka smjh ni aya pr apke videos dekh k aa gya . thank you.
🌹
love you brother ...Aapka pdhane ka trika bahot amezing hai .....
Great , how you explain each question in its own way, not spoon feeding but everytime motivating us giving hints to try solving the questions on ourself. Nice teaching methodology.
चमक चुका है बेहतरीन 😊
Bhaiya mza aa gya chuki apka vedio dekha stack par and cllge mai bhi start hua hai so jada relate kar pa raha hu thank you bhaiya and time stamp ke liye bhi
chamak chuka hai mind blowing concept bhaiya.
aaj bhi last tak dekha bhaiya kaafi ache question krwa rhe ho aap stack ki understanding ++
you are god of problem solving.....thank you very much for make my coding journey so easy❤❤❤
Bas 3 video or dekhni ha ...quality content ❤❤
Bhaiya aaj ka gulaab to aap hi deserve karte ho 🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹
1:46:02 bhaiya Aaj maja aa gya sach me bahut kuch sikhane ko mila aaj😊😊🤗🤗
Thank you bhaiyya❤
1:37:15
Jis element ka ka next greatest present nhi hai
Ans wale array me us index par st.top()+1 store kar dena hai
Example:- agar array me 60 ki jagah 150 store hota to ham ans wale array me 4th index par 5 store karte
Conceptual clearty next level
1:19:30 bhaiya khol diya problem ne dimag ko puri tarah se❤❤
Now I am feeling very confident in stack , thank sir from my bottom of my heart.... 💖💖
why my solution is not working for last problem ? Code:
int count(stack s,int n){
int ans=1;
while(!s.empty() && s.top()
mind blowing concept guru, the way you teach each by each step so patiently is irreplaceble❤
sir you have to be in universe 1st university not in world ---- what a method sir💚
One of the best DSA course ever
Badhiya Problems laye bhaiya aap with mast explanation
today learnt new concept thanku bhaiya
Bhaiya sab samajh aa gya thank you for giving this quality content 🤩
Sweep the video till last sec.., that amazing
01:17:38 kya logic lagaya h bhai, dil khush ho gaya. Maza aaya ❤
Best ever dsa course vaiya...I am from Bangladesh 🎉❤....because of payment problems,i didn't join your nexus course😢
crores ka package pe bhi free mai itna expensive content thnks bhaiya.
I LOVE U from bottom of my brain and heart
Amazing explanation of each step.
Last task dekha and samjha bhaiya.
Love you 3000❤
why my solution is not working for last problem ? Code:
int count(stack s,int n){
int ans=1;
while(!s.empty() && s.top()
Lecture Completed !!
Thanks a lot bhaiya 🙏🙏
bhaiya aaj k lecture mein bohut maja aaya🥰
Thank you sir this the best lecture on stack 😊❤❤ now understand this stack concept interesting ❤😊
daily kr rha hu bhaiya thanks you
most useful dsa course i have ever found
bhai do ques hai mere shuru se dekhrhe ho ye dsa aur doosra ques ye hai kiiii "love babbar ka PAID" ya " rohit negi ka FREE" PLS THODA EXPLAIN KRNA bcoz mujhe start krna hai ab dsa and ig aap smjhrhe honge ki kya ques ya confusion mein hoonga mai
All clear bhaiya❤❤
Awesome lecture
1:26:23 bhaiya yaha kuch sikhne ko mila aaj 🤗🤗❤...maja aa gya
bhaiya next greatest element 2 khud se hogya aapka solution dekhe begar bhut khushi ho rhi hain phli bar zindagi me
Last dekha bhaiya,pura chamak gaya
at 28:24 we can use while loop also which is TC=O(N) :--->
class Solution
{
public:
//Function to find the next greater element for each element of the array.
vector nextLargerElement(vector arr, int n){
// Your code here
vectorans(n,-1);
stackst;
int k=0;
while(karr[st.top()])
{
ans[st.top()]=arr[k];
st.pop();
}
else
{
st.push(k);
k++;
}
}
return ans;
}
};
Thanks bhaiya
Best explanation👍👍
Jai Shree Krishna🙏🙏🙏
thanks bhaiya. last tak
1:06:12
class Solution{
public:
vector leftSmaller(int n, int a[]){
vectorans(n,-1);
stackst;
st.push(0);
for(int i =1;i= a[i])
{
st.pop();
}
if(!st.empty()){
ans[i] = a[st.top()];
}
st.push(i);
}
return ans;
}
};
Great video ❤
bhaiya aap legend ho
just wow
thank u bhiaya
Great efforts bhaiya ❤
Great explantion bhaiya 📌📌📌📌
Dil khus ho gya bhaiya
Thank you sir ❤
Last tak ...❤crystal clear🔥
Chamak gaya last tak ❤❤
01:26:00 solution
vector ans(N,-1);
stack st;
for(int i=0;i
why my solution is not working for last problem ? Code:
int count(stack s,int n){
int ans=1;
while(!s.empty() && s.top()
You are genius bhaiyaa❤
Bhaiya last tak video dekh liya 😀
Bhaiya concept is clear😎😎😎
aagya bhaiya thanku
Done bhaiya 😊
Thanks
39:40
//Next grater element
//This is to check next greater in circular manner which works for all test cases.
class Solution {
public:
vector nextLargerElement(vector &arr, int n){
vectorans(n,-1);
stackst;
for(int i =0 ;i
Sir chamak gaya
Kya baat hai sir❤
Thanks bhaiya for the quality content
Chamak gya negi g❤
Great.....
Stack getting interesting now.
36:52 bhaiya sab ache se chamak gya .....😅
last tak ...... as you told....😁
Always i see whole video.
1:26:16 solution
public:
vector nextGreaterElement(int N, vector& arr) {
vectorans(N,-1);
stackst;
for(int i=0;i
I think the link given for next greater element here is for Next Greater Element in Circular Array
but the one solved in video is Next Greater Element
yes
Nice questions
53:33
vector nextSmallest(int arr[],int n){
vectorans(n,-1);
stackst;
for(int i = 0;i arr[i]){
ans[st.top()] = arr[i];
st.pop();
}
st.push(i);
}
return ans;
}
your course fee is love
Thank you Bhai
vectorans(N,-1);
stackmin;
for(int i=0;i
Best lecture
mast chamka bhaiya
For next greater element 2 I did the logic that if i run the code for next greater element twice then it will give me the correct answer
Next Greater Element 2 Solution
/*
//Solution 1
//using an extra vector of 2 * n
//looping from 2*n to 0
vector nextGreaterElements(vector& nums) {
int n=nums.size();
vectorarr(n*2,0);
vectorans(n*2,-1);
for(int i=0;i=0;i--){
while(!st.empty()&&st.top()=0;i--){
while(!st.empty()&&st.top()
great
great
Done Bhaiya... Day 135/180 ✅
Bhiya how to prepare for hackathons?
Can you give some advice plz 🙏
Good morning bhaiya ji❤
Last tak bhaiya♥
comment last tak
😍😍😍😍
ek kilo stack pack krdena bhaiya!!!!!!
first que abhi tak chamak gya badhte hai next question ki or ->
1:37:25 bhaiya aapko kaise pata chala mai muskura rha hu😂😂😂
ek no
Aaj Tak 3 baar stock span Kiya tha lekin us baar to lag rha hai ki stock span bahut easy hai aur bina explanation ke solve kar sakta hu
why my solution is not working for last problem ? Code:
int count(stack s,int n){
int ans=1;
while(!s.empty() && s.top()
1:20:01 it was simple logic of adding duplicate array but it didn't strike my mind, it was so irritating☹☹
Good morning master ji ❤❤
laap fool neela fool NEGI BHAIYA beautifool
Java ka class laye bhaiya 🙏
Last tak❤
Thanks bhaiya...❤🎉
Bhaiya smart board pe hi code likhe kro if it is possible class would be more interesting in my POV mtlb editor smart board me use kro
Good morning boss ❤❤
Good Morning bhai❣