Bro keep it 1080p otherwise , it will take more storage for u

Yessir

Very beautiful.

Wow

I’m really proud of u, my dream school😊😊🎉🎉🎉😅😅😅

Ok you use poo. what c++ version are you using. If possible, Could you make a beginner tutorial✌

Your videos are very interesting and I hope you make more videos

Hi bro

Nice, but what's all that coming from the background ?

gg bro!

Wonderful!! You sir are champ in more than one domain. All the best for your endeavours!! Looking forward to learn more from you!😊

Very Lively and informative🙌 Btw I'm not really sure if it is the best time to ask but, I was wondering if I can help you create good thumbnails, As your Content is valuable!

GG bro

what compiler are you using?

which IDE you are using?

Far more better than any paid course Easy and great explanation

I don’t understand why you used .count().

Thank you soo much bro please complete this series

This is good!! Its so enjoyable watchin the video... Slow and steady... Jazz music in background!! Feels like waltzing and learning C++ at the same time!! Unique!! And awesome!!!

I love Beluga whales !

Great work bro , you earned a subscriber , keep it up !

Nice

Which sorting algorithm is a must for a programmer to know?

1.5 hours of Trees!! You sir made my day! Thank you for this! Time to strap on and learn!!😊😊

Hi! What IDE do you use?

All right 4 videos a day!! We are on the roll!! Time to learn!😊

Queue: #include <iostream> using namespace std; class Queue { int front, rear, size; static const int maxSize = 3; int arr[maxSize]; public: Queue() : front(0), rear(maxSize - 1), size(0) {} bool enqueue(int x) { if (size >= maxSize) { cout << "Queue Overflow" << endl; return false; } else { rear = (rear + 1) % maxSize; arr[rear] = x; size++; return true; } } int dequeue() { if (size <= 0) { cout << "Queue Underflow" << endl; return 0; } else { int x = arr[front]; front = (front + 1) % maxSize; size--; return x; } } int frontElement() { if (size <= 0) { cout << "Queue is Empty" << endl; return 0; } else { return arr[front]; } } bool isEmpty() { return (size == 0); } // Display all elements void display() { if (isEmpty()) { cout << "Queue is Empty" << endl; } for (int i = front; i <= rear; ++i) { cout << arr[i] << " "; } } }; int main() { Queue queue; queue.enqueue(10); queue.enqueue(20); queue.enqueue(30); queue.display(); cout << queue.dequeue() << " dequeued from queue "; // Output: 10 dequeued from queue cout << "Front element is : " << queue.frontElement() << endl; // Output: 20 cout << "Elements present in queue : "; queue.display(); return 0; } Queue Linked list: #include <iostream> using namespace std; class Queue { struct QueueNode { int data; QueueNode* next; }; QueueNode* front; QueueNode* rear; public: Queue() : front(nullptr), rear(nullptr) {} // Push (Enqueue) void enqueue(int x) { QueueNode* newNode = new QueueNode(); if (!newNode) { cout << "Heap Overflow" << endl; return; } newNode->data = x; newNode->next = nullptr; if (rear) { rear->next = newNode; } rear = newNode; if (!front) { front = rear; } } // Pop (Dequeue) int dequeue() { if (!front) { cout << "Queue Underflow" << endl; return -1; } QueueNode* temp = front; front = front->next; if (!front) { rear = nullptr; } int dequeued = temp->data; delete temp; return dequeued; } // Peek int peek() { if (!front) { cout << "Queue is Empty" << endl; return -1; } return front->data; } // Check if the queue is empty bool isEmpty() { return front == nullptr; } void display() { if (isEmpty()) { cout << "Queue is Empty" << endl; return; } QueueNode* temp = front; while (temp != nullptr) { cout << temp->data << " "; temp = temp->next; } cout << endl; } }; int main() { Queue queue; queue.enqueue(10); queue.enqueue(20); queue.enqueue(30); queue.display(); cout << "Popped from the queue: " << queue.dequeue() << endl; // Should print: Popped from the queue: 10 cout << queue.peek() << " is our front element." << endl; // Should print: 20 is our front element. cout << "Elements present in the queue: "; queue.display(); // Should print: Elements present in the queue: 20 30 cout << "Program ended with exit code: 0" << endl; return 0; }

//stack array format Stacks: //#include our libraries #include <iostream> using namespace std; class Stack { int top; const static int maxSize = 3; int arr[maxSize]; public: Stack() : top(-1) {} // Push bool push(int x) { if (top >= (maxSize - 1)) { cout << "Stack overflow" << endl; return false; } else { arr[++top] = x; // Corrected increment order return true; } } // Pop int pop() { if (top < 0) { cout << "Stack Underflow" << endl; return 0; } else { int x = arr[top--]; // Corrected decrement order return x; } } // Peek int peek() { if (top < 0) { cout << "Stack is Empty" << endl; return 0; } else { return arr[top]; // Corrected to use top } } // Check to see if the stack is empty bool isEmpty() { return (top < 0); } }; int main() { Stack stack; stack.push(10); stack.push(20); stack.push(30); cout << "Popped from the stack: " << stack.pop() << " "; // Peek at the updated stack after popping cout << stack.peek() << " is our top element." << endl; cout << "Elements present in the stack: "; while (!stack.isEmpty()) { cout << stack.peek() << " "; stack.pop(); } return 0; }

//#include our libraries--Linked List Stack #include <iostream> using namespace std; class Stack { struct StackNode { int data; StackNode* next; }; StackNode* top; public: Stack() : top(nullptr) {} void push(int x) { StackNode* newNode = new StackNode(); if (!newNode) { cout << "Heap Overflow" << endl; return; } newNode->data = x; newNode->next = top; top = newNode; } int pop() { if (!top) { cout << "Stack Underflow" << endl; return -1; } StackNode* temp = top; top = top->next; int popped = temp->data; delete temp; return popped; } int peek() { if (!top) { cout << "Stack is Empty" << endl; return -1; } return top->data; } bool isEmpty() { return top == nullptr; } void display() { if (isEmpty()) { cout << "Stack is Empty" << endl; return; } StackNode* temp = top; while (temp != nullptr) { cout << temp->data << " "; temp = temp->next; } cout << endl; } }; int main() { Stack stack; stack.push(10); stack.push(20); stack.push(30); cout << "Popped from the stack: " << stack.pop() << endl; // Should print: Popped from the stack: 30 cout << stack.peek() << " is our top element." << endl; // Should print: 20 is our top element. cout << "Elements present in the stack: "; stack.display(); // Should print: Elements present in the stack: 20 10 cout << "Program ended with exit code: 0" << endl; return 0; }

#include <iostream> using namespace std; class Queue { int front, rear, size; static const int maxSize = 3; int arr[maxSize]; public: Queue() : front(0), rear(maxSize - 1), size(0) {} bool enqueue(int x) { if (size >= maxSize) { cout << "Queue Overflow" << endl; return false; } else { rear = (rear + 1) % maxSize; arr[rear] = x; size++; return true; } } int dequeue() { if (size <= 0) { cout << "Queue Underflow" << endl; return 0; } else { int x = arr[front]; front = (front + 1) % maxSize; size--; return x; } } int frontElement() { if (size <= 0) { cout << "Queue is Empty" << endl; return 0; } else { return arr[front]; } } bool isEmpty() { return (size == 0); } // Display all elements void display() { if (isEmpty()) { cout << "Queue is Empty" << endl; } for (int i = front; i <= rear; ++i) { cout << arr[i] << " "; } } }; int main() { Queue queue; queue.enqueue(10); queue.enqueue(20); queue.enqueue(30); queue.display(); cout << queue.dequeue() << " dequeued from queue "; // Output: 10 dequeued from queue cout << "Front element is : " << queue.frontElement() << endl; // Output: 20 cout << "Elements present in queue : "; queue.display(); return 0; }

The cat said thanks on 2nd image when he got adopted

Your dad is the starman waiting for big kitties

You adopted the cat???🤨.No you were adopted by the cat

Poor thing must have gotten into a fight. Thank you for helping him out. He'll never forget your act of kindness

Thank you

Ля какая тумба

Dark turn, it was actually filled with laxative

I dont think that was a stray cat

New videos, Lets go!!!!

Pls consider teaching C++ from scratch. I am following your Blind 75 series, and find your approach very useful, like how you break down the question into sub problems, and first you start by writing comments about how to solve the problem, and then finally writing the code. This is first time I am seeing this approach out of all C++ tutorial. Unique approach and leads to good solution. Thank you sir, for what you do. Its a wonderful opportunity for me to learn from you about blind 75 questions. Thank you.

Thank you so much! There are very few ppl teaching in C++, glad to find these videos. Can you do neetcode 150 series next! And also please stay consistent with uploads of dsa, I am coming here regularly now!

Wonderful!! Thank you for this info😊

I need a bit of help if you can