Пікірлер

• 
  @abodora5328 күн бұрын

  noice

• 
  @mod_cyber101518 күн бұрын

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

• 
  @Rip_pro25220 күн бұрын

  Yessir

• 
  @Rip_pro25220 күн бұрын

  Ur my inspiration, going to Oxford(my dream college), pushing me to get my goals, and staying fit,traveling. Ur my perfect life

• 
  @Lukasekt21221 күн бұрын

  Very beautiful.

• 
  @Rip_pro25221 күн бұрын

  Wow

• 
  @Rip_pro25223 күн бұрын

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

• 
  @GChief11723 күн бұрын

  @@Rip_pro252 you can do it!!! ❤️‍🔥❤️‍🔥❤️‍🔥

• 
  @GChief11723 күн бұрын

  @@Rip_pro252 kzread.info/head/PLPERBdDHWLi1wWwh2RMgM23SlqZe777vv&si=jhAvVs1j59K8-Jm8

• 
  @Rip_pro25223 күн бұрын

  Omg thx so much

• 
  @Rip_pro25223 күн бұрын

  lol I’m a sixth grader with a dream

• 
  @Rip_pro25223 күн бұрын

  And nice music BTW

• 
  @victorromeropena43124 күн бұрын

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

• 
  @GChief11724 күн бұрын

  Did you mean oop (object oriented programming) and yes way ahead of you on that, made multiple playlists, and expanded on data structures and algorithms first then moving over to the fundamentals of c++ Data structure and algorithms in c++ kzread.info/head/PLPERBdDHWLi1LIuLqNOUSp9RfWYcubF_2&si=W3PSDLx0gz4pBtS1 Fundamentals of C++ kzread.info/head/PLPERBdDHWLi2S6BFpoPX5gEjLieZDu1ua&si=qewuabvcqEnlvpxt

• 
  @GChief11724 күн бұрын

  Also since this is on Leetcode this version is C++14

• 
  @link260926 күн бұрын

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

• 
  @GChief11726 күн бұрын

  Thank you, already on the way!😎🔥please be sure to subscribe for further updates 🔥. Thank you!🔥

• 
  @latyo665126 күн бұрын

  Hi bro

• 
  @GChief11726 күн бұрын

  Hey👋

• 
  @user-vr8qp7tr7l27 күн бұрын

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

• 
  @GChief11727 күн бұрын

  Sorry about that was at an airport, will be in an isolated environment 😅

• 
  @GChief11727 күн бұрын

  The moment and times while Microsoft crashed 🙄🙄🙄🙄

• 
  @user-vr8qp7tr7l23 күн бұрын

  @@GChief117 keep going 👍👍

• 
  @GChief11723 күн бұрын

  @@user-vr8qp7tr7l Thank you for your support thus far!! ❤️‍🔥❤️‍🔥😎 Will do 😎❤️‍🔥❤️‍🔥and thank you especially for liking sharing the word 😎❤️‍🔥❤️‍🔥

• 
  @roboop981627 күн бұрын

  gg bro!

• 
  @grandmastergyorogyoro532Ай бұрын

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

• 
  @GChief117Ай бұрын

  Thanks a ton!! 😊

• 
  @pratapanurag757Ай бұрын

  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!

• 
  @ranjuranaut4952Ай бұрын

  GG bro

• 
  @GChief117Ай бұрын

  😎

• 
  @heyooeternal6006Ай бұрын

  what compiler are you using?

• 
  @GChief117Ай бұрын

  It’s all in Xcode

• 
  @shahidyasin_03Ай бұрын

  which IDE you are using?

• 
  @GChief117Ай бұрын

  @@shahidyasin_03 I’m using Xcode since I use QuickTime for screen recording

• 
  @RishabhAgarwal-k5qАй бұрын

  Far more better than any paid course Easy and great explanation

• 
  @GChief117Ай бұрын

  @@RishabhAgarwal-k5q Thank you 🙏😊☺️ good luck with this! Made more expansive playlists on such.

• 
  @tiara7624Ай бұрын

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

• 
  @tiara7624Ай бұрын

  I am confused because it says on Google .count() gives you the number of key/value pairs.

• 
  @GChief117Ай бұрын

  @@tiara7624 So to clarify, im using .count() to count the number of times we see the compliment from a given array. The defintion I stated for the compliment = the number that adds up with the two numbers to get our sum (target) + the number we are currently while scanning the array (nuts[i]) While scanning the array, we need to find where the compliment is at which specific index, because we do not know where the compliments are located, and we know there are going to be multiple. Hence using count. Does this part make sense?

• 
  @GChief117Ай бұрын

  If need to go further in depth Im also creating playlists for Data Sturcutres and Algorithms in C++ along with doing an Introduciton to C++, comments were suggesting to a fundamental basis between them: kzread.info/head/PLPERBdDHWLi1LIuLqNOUSp9RfWYcubF_2

• 
  @jeet904012 күн бұрын

  .count() gives you the number of elements matching the specific key. Also in c++ any number in an if statement besides 0 will evaluate to true.

• 
  @sandboxopАй бұрын

  Thank you soo much bro please complete this series

• 
  @GChief117Ай бұрын

  Will do!

• 
  @GChief117Ай бұрын

  Youre welcome as well and have a playlist here: kzread.info/dash/bejne/emaL2rGjo8K5Y7Q.html

• 
  @grandmastergyorogyoro532Ай бұрын

  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!!!

• 
  @GChief117Ай бұрын

  Thank you 😁, keeping things simple and engaging👍

• 
  @jonnyparkkinen1013Ай бұрын

  I love Beluga whales !

• 
  @0nk4rk98Ай бұрын

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

• 
  @GChief117Ай бұрын

  @@0nk4rk98 Thank you for all the support 🙏 😊 you are awesome 🔥🔥🔥

• 
  @ranjuranaut4952Ай бұрын

  Nice

• 
  @GChief117Ай бұрын

  Yep again, the full file is in the github link in the description for reference just as well. Good luck!

• 
  @user-fw3vs7tm1vАй бұрын

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

• 
  @GChief117Ай бұрын

  @@user-fw3vs7tm1v sure so there’s bubble, merge, insert, quick, heap, and shell sort to name a few

• 
  @user-fw3vs7tm1vАй бұрын

  @@GChief117 I know you got videos on them in future we on trees rn then graphs right?

• 
  @GChief117Ай бұрын

  @@user-fw3vs7tm1v yessir that is correct, did a 1.5 hr video on trees, making them into smaller bits for viewership preference, and moving over to graphs and binary search trees. These are the fundamental data structures. Different algorithms will be explored to understand the use cases of applying these data structures.

• 
  @GChief117Ай бұрын

  @@user-fw3vs7tm1v for reference organizing all the videos in this playlist: kzread.info/head/PLPERBdDHWLi1LIuLqNOUSp9RfWYcubF_2&si=fpnmN_WUCPy3Bgbe

• 
  @user-fw3vs7tm1vАй бұрын

  @@GChief117 it’s helpful for real. Learning never ends yk. Thanks for the playlist.

• 
  @grandmastergyorogyoro532Ай бұрын

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

• 
  @GChief117Ай бұрын

  Yessir and condensing the information as well, all necessary code is in description for reference. Good Luck!

• 
  @DecoretumАй бұрын

  Hi! What IDE do you use?

• 
  @GChief117Ай бұрын

  This one is Xcode

• 
  @GChief117Ай бұрын

  You can do the same principles in Visutal Studio, or JetBrains, etc

• 
  @DecoretumАй бұрын

  @@GChief117 Yep! Thanks! I just liked the interface of xcode. Is there a way to make visual studio more optimized or look as smooth as your xcode setup?

• 
  @GChief117Ай бұрын

  @@Decoretum Other than going to settings and changing the font color, no. The closet thing you can do is either JetBrains IDE, CLion, or use a text editor in Sublime

• 
  @GChief117Ай бұрын

  @@Decoretum In general, be sure to have your necessary header and main file as well. Your code will comiple in the main file.

• 
  @grandmastergyorogyoro532Ай бұрын

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

• 
  @GChief117Ай бұрын

  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; }

• 
  @GChief117Ай бұрын

  //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; }

• 
  @GChief117Ай бұрын

  //#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; }

• 
  @GChief117Ай бұрын

  #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; }

• 
  @SussyBakaIsHappyАй бұрын

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

• 
  @lexodPEАй бұрын

  Your dad is the starman waiting for big kitties

• 
  @EggNuceАй бұрын

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

• 
  @GChief117Ай бұрын

  Yeppers you are right

• 
  @maverickmagic6132Ай бұрын

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

• 
  @GChief117Ай бұрын

  Thank you, she loves my Dad especially and is called Missy❤

• 
  @H4STEGGАй бұрын

  Thank you

• 
  @dench6639Ай бұрын

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

• 
  @Angry-BirbАй бұрын

  Dark turn, it was actually filled with laxative

• 
  @SuperHeroStoriesUnlimitedАй бұрын

  I dont think that was a stray cat

• 
  @GChief117Ай бұрын

  We found her during Christmas with an injured leg, she was coming to us, and adopted us

• 
  @SuperHeroStoriesUnlimitedАй бұрын

  @@GChief117 okay

• 
  @Rutik9999Ай бұрын

  New videos, Lets go!!!!

• 
  @grandmastergyorogyoro532Ай бұрын

  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.

• 
  @GChief117Ай бұрын

  Way ahead of you, had this as a placeholder for a couple of months, on the way 😎: kzread.info/head/PLPERBdDHWLi2S6BFpoPX5gEjLieZDu1ua&si=yB8SSdVo6hnthsU_

• 
  @GChief117Ай бұрын

  As the great neurosurgeon Joseph Davids PhD of Imperial College London said, “Focus and push on the fundamentals”😎😎

• 
  @grandmastergyorogyoro532Ай бұрын

  @@GChief117 Great quote by Dr Joseph Devids! Will add that to my list. Thank you for the playlist! I wish you a million subscribers! For the valuable wealth of knowledge you have shared with the world!

• 
  @Rutik9999Ай бұрын

  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!

• 
  @GChief117Ай бұрын

  Thanks brodie, will keep that in mind😎🔥be sure to subscribe then for further updates. Thank you.

• 
  @GChief117Ай бұрын

  Also, just in case, did the blind 75 in C++ if need be: kzread.info/head/PLPERBdDHWLi1x0ZxbnCd5t8yxEudSrxxH