16:00 machine coding 😭 meri to sunke hi gandfat gayi Thanks for the extremely detailed video guys !

Nice

I have implemented below way. Please note isFull() condition and let me know if there is anything wrong with it. public class queueUsingCircularArray { static final int size = 5; static int queue[]=new int[size]; static int front = -1; static int rear = -1; public boolean isFull() { if(front == ((rear+1)%size)) return true; else return false; } public boolean isEmpty() { if(front==-1) return true; else return false; } public void enqueue(int val) { if(isFull()) { System.out.println("Queue is full"); } else { rear = (rear+1)%size; queue[rear]=val; if(front==-1) front++; System.out.println("Enqueue is successfull"); } } public int dequeue() { if(isEmpty()) { // Queue is already empty System.out.println("Queue is empty"); return -1; } else { int val; if(front==rear) { // Only one element is present in Queue val = queue[front]; queue[front]=-1; front=rear=-1; // We reset our queue to initial state } else { val = queue[front]; queue[front]=-1; front = (front+1)%size; } System.out.println("Dequeue is successfull"); return val; } } public void display() { for(int x: queue) { System.out.print(x+" "); } System.out.println(); } public static void main(String[] args) { queueUsingCircularArray obj = new queueUsingCircularArray(); obj.enqueue(2); obj.enqueue(3); obj.enqueue(5); obj.enqueue(5); obj.enqueue(5); obj.enqueue(10); obj.display(); obj.dequeue(); obj.enqueue(5); obj.display(); obj.dequeue(); obj.display(); obj.dequeue(); obj.display(); obj.enqueue(5); obj.display(); obj.dequeue(); obj.dequeue(); obj.dequeue(); obj.dequeue(); obj.dequeue(); obj.display(); } }

Thanks for the video, it opened new doors for me on how to use graph.

this is so helpful

Hey , My coding round is in this month I wanna ask that for DSA coding round can I use python language????

Which youtube channel we refer to for learning commvault ?

using dequeue instead of list in python code... nicely explained.

Nice explanation for two pointer by finding entry point of LL cycle

Nice explanation for duplicate element using two pointer

nice explanation

Awesome series.

2nd ques is really good!

Amazing🤩

select score, dense_rank() over(order by score desc) as 'rank' from Scores. work smart

For 10 th question I have got 62 sir . could you please reply me whether it is correct or not

out of all solutions I found on KZbin, this is the best explanation. Thank you so much. !

when will you post dp series . i just love yr teaching .

Wrong height is highest number of edges from a node to reach a leaf node

G

Yes sir provide code example of composition

Awsome

Sir number send me please 🙏

W

Thank u....thank u so much...

My approach: for(i=0; i<length; i++){ while(!stack.empty() && numbers[stack.peek()]<=numbers[i]) stack.pop(); if(stack.empty()) answer[i]=i+1; //Cause if stack is empty, then current number is greater than all it's previous elements else answer[i]=i-stack.peek(); //Stock span = Current index - index of next greater element to left stack.push(i); }

Continue daily ques series

badhiya samjhaya

nice explanation

Great Sir thank you so much for this and one more thing will you please provide syntax or codes explanation of aggregation, association and composition in c++???

❤❤❤❤❤❤❤❤❤

Mam/Sir, I am going to do the RHCE exam, I am 20 years old. Is RHCE exam passed out is enough for the job or anything else to be required ? Please help me and tell out what i shall do ?

gazab explaination sir

Can you also share the code please, i got an error and cannot solve ahead.

This is a pattern now, I see a hard problem, I get disappointed, I come to you channel, I see you explain the problem. And boom! all of a sudden, it becomes a medium level problem. Same i felt for meeting room III, it was such a hard problem and you made it look so easy. Thank youuuu so much Ma'am😭😭😭💙💙💙 Please make something for the "Leetcode 679. 24 Game"😖

Such clean explanation. Simply wowwww. I watched the video till 4:12 and I was able to code it myself. So, much thanks for the good work. Subscribing NOW.

Awesome ❤

The representation of NI & I in the code is also super helpful and easy to visualise while coding or thinking of logic. Nice!

This was the 3rd video i have watched on this question. The cooldownPeriod = n + 1 part was sooooo unique and easy to understand. Thanks for the explanation (that too for free). This is simply god's work.😐💙

Watched the neetcode guy solution first, it was good, but not intuitive, this was great.

well explained sir

When the next full dsa course batch will start?

Making a video program in c++ Students understand easily way

Best explanation amazing, very helpful👌🙏

Your code will fail for this test case Tree=[1,2,3,null,null,4,5] with target=3 Since 2 doesnt have any children there wont be any element present in the queue after 3 thus you cannot return the next element of 3.

Good Explanation

VERY NICE EXPLAINATION

🤙👍🤟✌

Good Explanation Mam

Great