TL;DR small data set: LinkedList = BAD large data set + lots of searching: LinkedList = BAD large data set + lots of inserting/deleting: LinkedList = GOOD import java.util.LinkedList; public class Main{
public static void main(String[] args) { // *******************************************************
// LinkedList = Nodes are in 2 parts (data + address) // Nodes are in non-consecutive memory locations // Elements are linked using pointers
// advantages? // 1. Dynamic Data Structure (allocates needed memory while running) // 2. Insertion and Deletion of Nodes is easy. O(1) // 3. No/Low memory waste
// disadvantages? // 1. Greater memory usage (additional pointer) // 2. No random access of elements (no index [i]) // 3. Accessing/searching elements is more time consuming. O(n)
What a godsend of a video. I'm crrently doing online CS 1103 course and literally the topic for this week is about linked lists. Thank you for this video. Your videos have truly helpful in my studies thus far.
it is unfair that this video only has 554 likes at the time of my viewing , you explained in under 15 minutes , what took my professor 3 hours and 2 slideshows
I did a happy dance because of how simply you explained this, so even those curious can see if this is something they want to do as far as becoming a programmer. I'm expanding into more complex concepts in Python. this has helped me grasp a concept faster than cheetahs racing. You got yourself a new subscriber!! :D
Hey bro, could you please do one on singlys like using the linked list class. This is eternally helpful, though I’m struggling to find tutorials on youtube that cover anything like the ListNode class, so if you could that would be amazing because your videos are the best!
So I am learning C for Windows development and Red Teaming from a source that is great but cuts a lot of bullshit and goes quite quick. Im learning a lot but some concepts could do with a little bit more explanation. Thats where my Bro comes in! And I know this is JAVA but the concept is the same and these are Absolutely FANTASTIC explanations. Great to fill in the missing pieces with padding where needed. Thanks a lot man ! you really really help!
TL;DR small data set: LinkedList = BAD large data set + lots of searching: LinkedList = BAD large data set + lots of inserting/deleting: LinkedList = GOOD better are arraylists for seraching and it works like queue and stack
Thank you very muchh! I've been struggling alot about linklist address pointers and arrays for so long , but i watched just 10 mins of yours and I now understand everything! Thanks again brooo T-T
Hey Bro, I just finished the java for beginners playlist, it was very well done btw! Prior to that, I had absolutely zero experience in coding, and that was a great start. What would you recommend for me next? maybe specific projects I could work on to improve my skills? because I feel kinda lost now :D Thank you!
I've been solving problems on leetcode and hackerrank That's how I ended up here, because I've never heard of a linked list despite following Bro Code for like 3 months now
Idk there's really nobody that explains anything like our fellow "Bro". Completely, underrated and undervalued! Thank you for what you do video after video. Btw we need more input more input lol
Hey, Bro! Could you (or any other of you folks grasping big Oh notation) explain, why inserting and deleting is O(1) and not O(n)? Would'nt the algorithm need to traverse the nodes to find the appropriate place to change the addresses for the newly created element?
I'm still learning, but i've also been thinking about this, and i think you're right. The time complexity of O(1) for deleting and adding data in a linked list is only at the beginning and end of the list, because there is no need to shift elements like in an array. However, the time complexity becomes linear, O(n), if the element is somewhere "inside" the list. Because linked lists do not have indexes (that's the whole point), the element you want to delete or change within a list has to be found first, and as i understand, it is done by traversing the list. You have to go through all the elements of the list until the end or until a matching element is found. So the main advantage of linked lists over arrays is that they can shrink and grow faster if elements are added or deleted from the beginning or end of a list.
@@Russ2049also learning but I think deleting at end is O(n) not O(1) since you need to transverse through the whole thing to know where the new end is. Deleting at the beginning is definitely O(1) though
Thx Bro for all your videos, i love them all, plz finish as much as u canbon data structure, then plz java design patterns, generics, functional prog. in java (lambda expressions), and parallel programing. Anything you like...
Thanks Bro, I always checkout your videos to finally understand these kind of topics. I would really love to meet the person who has hit the dislike button.
TL;DR
small data set: LinkedList = BAD
large data set + lots of searching: LinkedList = BAD
large data set + lots of inserting/deleting: LinkedList = GOOD
import java.util.LinkedList;
public class Main{
public static void main(String[] args) {
// *******************************************************
// LinkedList = Nodes are in 2 parts (data + address)
// Nodes are in non-consecutive memory locations
// Elements are linked using pointers
// advantages?
// 1. Dynamic Data Structure (allocates needed memory while running)
// 2. Insertion and Deletion of Nodes is easy. O(1)
// 3. No/Low memory waste
// disadvantages?
// 1. Greater memory usage (additional pointer)
// 2. No random access of elements (no index [i])
// 3. Accessing/searching elements is more time consuming. O(n)
// uses?
// 1. implement Stacks/Queues
// 2. GPS navigation
// 3. music playlist
//
// *******************************************************
LinkedList linkedList = new LinkedList();
/*
// LinkedList as a Stack
linkedList.push("A");
linkedList.push("B");
linkedList.push("C");
linkedList.push("D");
linkedList.push("F");
linkedList.pop();
*/
// LinkedList as a Queue
linkedList.offer("A");
linkedList.offer("B");
linkedList.offer("C");
linkedList.offer("D");
linkedList.offer("F");
//linkedList.poll();
//linkedList.add(4, "E");
//linkedList.remove("E");
//System.out.println(linkedList.indexOf("F"));
//System.out.println(linkedList.peekFirst());
//System.out.println(linkedList.peekLast());
//linkedList.addFirst("0");
//linkedList.addLast("G");
//String first = linkedList.removeFirst();
//String last = linkedList.removeLast();
System.out.println(linkedList);
}
}
🌹🌹🌹
may i know why 1. implement Stacks/Queues
// 2. GPS navigation
// 3. music playlist
is more suitable to use linked list?
😅
This channel doesn't have normal content.
rather masterpieces
I just love the way you teach， straightforward， easy, and clear。 Lucky to have you in this world
Your videos teach me more than my professor.
More knowledge in a shorter period of time
they're really practical
seriously same lol, learned in 10 min what took my professor a 90min lecture
True😹
Same here, I wish I could pinpoint why this is so common, honestly it's concerning that "professionals" are getting dunked on by youtube.
My bro who code;
You are the best man
I am a CS student in The Gambia 🇬🇲!
This channel is awesome
Yeah
Thanks Amadu!
What a godsend of a video. I'm crrently doing online CS 1103 course and literally the topic for this week is about linked lists. Thank you for this video. Your videos have truly helpful in my studies thus far.
Awesome! Looks like I made this video just in time!
I'm glad they're helping!
You are a god of programming, Thank you for making my life easier. you are way more better than my stupid college teachers.
I absolutely love the way bro introduces himself. i love you bro
Gosh! This channel is simply A TREASURE!
That was the most simple straightforward no bs explanation for a data structure ever. You make DS&A look approachable!! Thanks for the content 🙏
This is the only explanation I've been able to comprehend. Thank you
OMG you just helped me to understand in laymen's terms what my professor and multiple other youtubers couldn't
Awesome, simple explanation covering LinkedList thanks
Awesome teaching guide not only teach easily to understand but coding clearly. Thanks greatly!
A docx/pdf file of this courses source codes and notes will be really helpful...thanks for keeping this course free really means a lot!!
Thank you so much for the detailed explanation, along with the 'uses' at the end.
I buy 2500 rupees course to understand DSA but now i realise my money is waste .Because you more better than course
your videos make me LOOOVE coding!! never thought I would say that so THANK YOU 🙏🙏
Bro, just what I nedded for a project!!!!
You are awesome sir.
Nice! I made it just in time then!
@@BroCodez Bro, I want to contact you. How to do so?
The first 5 minutes of this explained it better than a year of university
Fun fact: he learned from your University
it is unfair that this video only has 554 likes at the time of my viewing , you explained in under 15 minutes , what took my professor 3 hours and 2 slideshows
Amazing teaching way really like it
OMG right on time!! Are you reading our minds?
The one million elements graphic gave me a good chuckle.
Bro, this is simply PERFECTION!
Nice job Man! Now that is a ALPHA!
Keep it up Bro!
I did a happy dance because of how simply you explained this, so even those curious can see if this is something they want to do as far as becoming a programmer. I'm expanding into more complex concepts in Python. this has helped me grasp a concept faster than cheetahs racing. You got yourself a new subscriber!! :D
You saved me during my data structures class
"666 Crime circle "....that adress sounds so dark...😅😅
This man teaches Programming better than any college would do.
Just found your channel. One of my fav dev channels on YT. Proud to call myself a bro 🤙🏼
i hope this discussion will be followed the instructions during my next meeting within my instructor
Awesome video, again Gold standard teaching methods!
Hey bro, could you please do one on singlys like using the linked list class. This is eternally helpful, though I’m struggling to find tutorials on youtube that cover anything like the ListNode class, so if you could that would be amazing because your videos are the best!
Thanks a lot bro your videos are amazing and the best in explaining
Fastest I have ever subscribed to a channel. I wasn't even half way through the video.
Well done bro. 😊
I'm here again to refresh my knowledge.
Pretty helpful thank you so much sir
Hlw Bro Code!
Keep updating this playlist at regular intervals.
The way you explain is Awesome..
😊😊😊😊😀😀😀
Thanks! I will!
Weekly is a good interval, these are tough topics to discuss 😅
🚀100K+ soon! Thanks, Bro you're our hero!
Thanks for the concise explanation, I feel confident for my quiz!
better than all my prof. much love
So I am learning C for Windows development and Red Teaming from a source that is great but cuts a lot of bullshit and goes quite quick. Im learning a lot but some concepts could do with a little bit more explanation. Thats where my Bro comes in! And I know this is JAVA but the concept is the same and these are Absolutely FANTASTIC explanations. Great to fill in the missing pieces with padding where needed. Thanks a lot man ! you really really help!
TL;DR
small data set: LinkedList = BAD
large data set + lots of searching: LinkedList = BAD
large data set + lots of inserting/deleting: LinkedList = GOOD
better are arraylists for seraching and it works like queue and stack
so many informations in one video :>. thanks
This was extremely helpful, thank you!
Thank you very muchh! I've been struggling alot about linklist address pointers and arrays for so long , but i watched just 10 mins of yours and I now understand everything! Thanks again brooo T-T
I've become BROOOOOO!!! Thanks broo, you are the best!!!
gave a like before watching coz i know it will be amazing as always
Great as always
Holy shit, that’s incredible man. I really like your tutorials
We on a roll tonight! Thanks for sharing bro.
Fantastic content!
Thanks neil!
Hahahaha never stop surprising me! Each video is literally blowing my mind, what a way of explaining! Keep it up!
Great video, simple and understandable
BRO!! THANK YOU SOOOO MUCH!!! I understand😭
Nice class
Hey Bro, I just finished the java for beginners playlist, it was very well done btw! Prior to that, I had absolutely zero experience in coding, and that was a great start.
What would you recommend for me next? maybe specific projects I could work on to improve my skills? because I feel kinda lost now :D
Thank you!
I've been solving problems on leetcode and hackerrank
That's how I ended up here, because I've never heard of a linked list despite following Bro Code for like 3 months now
Idk there's really nobody that explains anything like our fellow "Bro". Completely, underrated and undervalued! Thank you for what you do video after video. Btw we need more input more input lol
cleared my concept finally
Hey, Bro! Could you (or any other of you folks grasping big Oh notation) explain, why inserting and deleting is O(1) and not O(n)? Would'nt the algorithm need to traverse the nodes to find the appropriate place to change the addresses for the newly created element?
I'm still learning, but i've also been thinking about this, and i think you're right. The time complexity of O(1) for deleting and adding data in a linked list is only at the beginning and end of the list, because there is no need to shift elements like in an array. However, the time complexity becomes linear, O(n), if the element is somewhere "inside" the list. Because linked lists do not have indexes (that's the whole point), the element you want to delete or change within a list has to be found first, and as i understand, it is done by traversing the list. You have to go through all the elements of the list until the end or until a matching element is found.
So the main advantage of linked lists over arrays is that they can shrink and grow faster if elements are added or deleted from the beginning or end of a list.
@@Russ2049also learning but I think deleting at end is O(n) not O(1) since you need to transverse through the whole thing to know where the new end is. Deleting at the beginning is definitely O(1) though
Really awesome.
Amazing explanation
You are my real JavaBro =) thanks a lot
thank you bro , loved it , its so detailed and wasy to understand
Thanks for this great video. Can you implement the linked list from scratch?
very very helpful thank you!
my bro is here thank you :)+)
Thank you Bro!
Thank you so much bro💫life saving💓
Learn Linked Lists in 13 minutes 🔗
I ❤ your videos ❤❤❤❤❤
Awesome content, tks a lot!!!
I demand to see what's behind those D&D files!
Great video, thanks!
A video on how to reverse a Linked List please. Btw love your videos 🙌
Awsome
Perfect
Awesome.
Thx Bro for all your videos, i love them all, plz finish as much as u canbon data structure, then plz java design patterns, generics, functional prog. in java (lambda expressions), and parallel programing. Anything you like...
Self learner here I do driver development for fun and I could vouch u are him
better from the best coder i know . would you please consider doing it in pytohn
thanks , very clear
Much better than my professor,
Keep it up Bro
#brocode👍
bro please make a video about operations and all operators applicable with 'objects' in java.
thank you.
king , that is what you are , nothing more , nothing less
Awesome Bro
Nice
You are doing good...
I'm your new subscriber ^_^
Love your videos. They are so good. Did you add and remove an element but didn't show add working?
Thanks a Lott!!!!!!!!!. brooooooo
u r a legend
My exam's tomorrow 💀thank you man
random comment to help the algorithm :)
great, thank you, bro!
Thanks Bro, I always checkout your videos to finally understand these kind of topics. I would really love to meet the person who has hit the dislike button.
Please dont stop making videos although you are getting less views and likes we know your videos are worthy and very helpfull for us
Thanks brocode . this helped me a lot
super
Can you do some object oriented code for Java. Love your channel and need it to not fail my class. Threads and recursive methods and stuff 🥵🙈??