Видео

What is the presentation app you used in the video?

I really like the penguin in the backround

3:05 Doubly linked list can do that though

6 Years Later, Still Immensely Helpful. Thankful for this gem of a video. Clear, concise, and beginner-friendly.

Please try to stop using "ahhhh"

for the person class it also represent its function p1.sitDown(),p1.standUp(),p2.sitDown(),p2.standUp() right I think you missed it

Great job on the video! Thank You!

Python: def count_nodes(head): length = 0 while head: length += 1 head = head.next return length This is what worked for me

Thank you for not making a "Learn Python in 10 min" They are impossible to follow and move wayyyy to fast. This is perfect!

Wow, great explanation. was struggling with the basics , thanks a lot😀.

Vue >>>>>>> react

It's a pity you don't demonstrate the sitting functions you created. Would be nice to see.

Really Found something which i could understand clearly ... ......

are you doing web dev💩? I thought you guys doing programming 😅

Your video is really good! I like the fact that you start with givenName etc when creating the constructor. This to avoid any confusion, these are actually very good explanatory skills, that is to image yourself in the perspective of a noob. Really great 👍🏻

Using c#: public int NodeCounter(Node head) { int counter = 0; Node currentNode = head; if (currentNode != null) { counter++; } while (currentNode.next != null) { counter++; currentNode = currentNode.next; } return counter; } }

data structure = different ways of storing data on your computer Algorithms = operations on different data structures + sets of instructions for executing them

Thank You So Much Sir. Very Great and Very Beautiful Explanation Sir. Love From Pakistan. ❤

Thanks man

It's awesome tutorial👏👏 but you're not 2 meter😁😁

Good video 😊 tyvm for the lessons

Tyvm for the video 😊

Am watching in 2024😅😊

Learn assembly on a simple 8 bit processor like an ATMega. You will understand why compilers write the code they do. Pointers, structures, loops and conditionals become obvious. Assembly on an ATMega is easy to learn.

nice tree introduction for beginner, thanks!

another way: b[0] = "microsoft" b[2] = "banana"

Wow. Great. Watched another from a channel called Inside code. Your one is far better.

miles = 5 km = 1.6 * miles print(kilometer)

Thank you CS Dojo!

a RMIT University Student here - 24/07/2024

My C++ solution: int fib(int n) { if (n == 1 || n == 2){ return 1; } return fib(n-1) + fib(n-2); }

yesss! I needed to see the visuals explained alongside the code like this. Thank youu!! ily

I used c++ and this is my solution. class Node{ public: int data; Node *next; Node(int data) : data(data), next(nullptr){} int CountNodes(){ if(next==nullptr){ return 0; } return 1 + next->CountNodes(); } };

Your a very good teacher ❤

Simpler solution that also avoid errors if the list is empty: static int countNodes(Node node) { int count = 0; while (node != null) { count++; node = node.next; } return count; }

Can u please do full videos on dsa

My teacher explained it like it is some type of phd level stuff lmao all the math stuffs when it can be understand like this sure it is useful but she didnt even explain anything she is using

Great explanation..

To everyone who say "Thanks for taking number of different sizes", actually there is another method to sort integers of different lengths. Let's say the biggest number has n digits. Create n arrays. Put in the i-th array all digits of length i (this is basically a bucket sort, it can be done in O(n)). Now radix sort each bucket (easy, every number in each bucket has same length) Now concatenate the buckets; there is your sorted list. However this method only work if the numbers are roughly of random size. If all number have size 1 and one number is of size 2, you're in the worst case of bucket sort and the complexity is NOT linear anymore.

Im watching in 2024 👇

It's so simple but i woulfn't have thought about doing something like this in a million years. Props to the guy who found that.

Crystal clear. Thanks!

r = list(range(1,100)) [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99] total8 = 0 for i in r: if i % 3==0 or i % 5==0: total8 += i print(total8) 2318

❤

What's the difference between Java and Java scripts

6:02

01:51

here's the solution for CPP (C++) #include <iostream> #include <vector> using namespace std; struct Node { public: int data; Node* next; Node(int data) { this -> data = data; this -> next = NULL; } }; class linked_list { Node* head = NULL; public: void insert_node(int data) { Node* newNode = new Node(data); if (head == NULL) { head = newNode; return; } Node* temp = head; while (temp->next != NULL) { temp = temp->next; } temp->next = newNode; } void printList() { Node* temp = head; if (head == NULL) { cout << "list empty" << endl; return; } while (temp != NULL) { cout << temp->data << endl; temp = temp->next; } } int countLength() { if (head == NULL) { cout << "list empty" << endl; return 0; } int length; Node* temp = head; while (temp != NULL) { temp = temp->next; length++; } return length; } }; int main() { linked_list list; list.insert_node(6); list.insert_node(0); list.insert_node(3); list.insert_node(56); cout << endl; list.printList(); int length = list.countLength(); cout << "length = " << length << endl; return 0; }

Why does video have so less views and far less likes? Cmon people

Thank you so much. Now I understood and will practice!