Hey. Just wanted to give you a thanks for making these types of videos. Last year during the pandemic I was ~5 months out of school and was struggling to find a job in tech. I randomly found your Spring Security tutorial video and did my best to follow along consistently day after day. I believe I landed my first job because of you and here I am again because I know your content quality is amazing. Thanks again!
This is what I want!! Coding from the beginning and explaining why you writing that code. Unlike to the other youtubers who already have codes and expects that you already understands it
Hey Nelson! Good explanation as always, great job! One remark on 5:22. For arrays it's O(1), not O(n) complexity to get specific element by it's place in an array.
Would love more advanced videos/courses. You explain things so clear and concisely that I'd love for you to break down more complicated concepts and libraries with focus on real world use cases.
Thank you for making this. I'm doing terrible with my class because my life is so busy and my professor teaches nothing during class in practice, just powerpoints. I have to read like 250+ pages to learn things he's teaching like he assigns and I'm absolutely lost. thank you. this is amazing.
This is directed at Amigoscode!! -i normally dont comment on tutorial vids BUT i am making an exception for this channel..You are doing a fantastic, amazing job. Do NOT stop what you are doing! Your videos are well edited and your presentation and narration methods are truly excellent-FAR better than most of the MORONS on youtube who make feeble attempts to introduce complex coding and software engineering topics to the masses..Seriously man you are doing our community of global programmers a big favor, and I appreciate it-just wanted u to know this..
Retrieving an element from an array is O(1), not 0(n). That’s one advantage over a linked list, for example, which is 0(n). Now *removing* or *adding* an element is where we have the complete opposite situation, where linked lists are O(1) and arrays are O(n)
The latter part isn't necessarily true in practice (or theory for that matter). Linked lists don't play nice with modern processors and result in frequent cache misses. Unless you're dealing with an insanely large number of elements, there's no need to even consider linked lists. Also, if you're inserting and deleting to arrays you're already using a smart container like Java's ArrayList or C++'s vectors -- both of which allow for amortized O(1) operations. Translation: array insertions and deletions are O(1) most of the time, and O(n) occasionally.
Thanks for this content. I'm switching from Python to Java for a new job position. And this is very helpful for me to refresh and glance the data types in Java.
Wow man...awesome...I am a Java professional and I recently started to watch your video on youtube...you are superb...your teaching style is very good and gives important details point to point with the required practical approach...I have seen your course on your sites too...why don't you come to Udemy so your course is accessible globally conveniently...you really helping people!!...thanks for your efforts and your positive mindset!!!!
DUde you're awesome for this video. I took data structures and OOP in Java and struggled linking all the concepts together. You tied it all together concisely and in a very-well done manner. I'm confident stepping into LeetCode easies w/ a solid foundation. I can grind out the logic, but needed somewhere to start from :) I need to go over OOP concepts again but you made it a hell of a lot easier my friend. Best
Voaleykum assalam, bro. Awesome content. I have summed up before watching it. Because it is absolutely useful content for all javaholics. جزاك الله خيرا
Excellent video! :) Clear and concise. Now, I would really appreciate if you can post a video on Algorithms (Search, Sort), Big O notation, Space complexity.
@ 5:17 - "So for you to retrieve a element from an array is just O(n). Right, so it's really fast." Maybe this was just a mistake you made without realizing it, but retrieving an element from an array is O(1) Great video! Not trying to be mean or anything. Keep up the good work!
5:22 retrieving an element from an array (provided you have the index) is O(1) right? You’ve got the index of the element, so it’s a constant time operation. If you were searching for an item in the array (and you didn’t have the index) itd be O(n)
Awesome content Nelson ❤️ , consider one day to make another video about frontend and backend login with jwt,access token refresh token, session I'd and cookies
you have gr8 content I went from 0 to advanced in java and spring boot please we need more and more content, like advanced DBA(Postgres or MySQL), End2End Testing, more in deep in DS and Algos, we need your help tnx a lot and please keep going
Regarding Arrays 9:33, why System.out.println(colors) wouldn't work? Why the toString method is required? Thank you for all the content. I found it super usefull!
Hey. Just wanted to give you a thanks for making these types of videos. Last year during the pandemic I was ~5 months out of school and was struggling to find a job in tech. I randomly found your Spring Security tutorial video and did my best to follow along consistently day after day. I believe I landed my first job because of you and here I am again because I know your content quality is amazing. Thanks again!
Hey bro, can you create second part of it with advanced data structures like binary trees, heaps etc
Yes, that was what I was coming for ! It would be great! :))
Yeah that would definitely be beneficial.
^ not entirely, java can handle those data structures i.e BST, AVL Trees
@@marcuspaz4306 u mean we can't implement all ds in java😢 ?
That's gonna be awesome!
Asalamualeykoum bro from Russia! I'm recently a software engineer and I very appreciate your channel.
what's your tech stack?
@@gradientO Spring boot and Laravel
This is what I want!! Coding from the beginning and explaining why you writing that code. Unlike to the other youtubers who already have codes and expects that you already understands it
Needed this 2 months ago, but I'll take it now haha. Thank you so much! Great tutorial!
Hey Nelson! Good explanation as always, great job! One remark on 5:22. For arrays it's O(1), not O(n) complexity to get specific element by it's place in an array.
I was searching in comments to see if anyone pointed it out.
Would love more advanced videos/courses. You explain things so clear and concisely that I'd love for you to break down more complicated concepts and libraries with focus on real world use cases.
Thank you for making this. I'm doing terrible with my class because my life is so busy and my professor teaches nothing during class in practice, just powerpoints. I have to read like 250+ pages to learn things he's teaching like he assigns and I'm absolutely lost. thank you. this is amazing.
When I started gathering info about data structures you came up with this video, amazing stuff man!
Thanks for showing the shortcuts as well
Brother Neilson may Allah make things easy for you. Thank you very much ❣
i have expected this course for a long. Tks sir!
This is directed at Amigoscode!! -i normally dont comment on tutorial vids BUT i am making an exception for this channel..You are doing a fantastic, amazing job. Do NOT stop what you are doing! Your videos are well edited and your presentation and narration methods are truly excellent-FAR better than most of the MORONS on youtube who make feeble attempts to introduce complex coding and software engineering topics to the masses..Seriously man you are doing our community of global programmers a big favor, and I appreciate it-just wanted u to know this..
bismi alla bismi allah tank you my freind lah ybarak fik
Retrieving an element from an array is O(1), not 0(n). That’s one advantage over a linked list, for example, which is 0(n). Now *removing* or *adding* an element is where we have the complete opposite situation, where linked lists are O(1) and arrays are O(n)
I thought I misheard that lol.
The latter part isn't necessarily true in practice (or theory for that matter). Linked lists don't play nice with modern processors and result in frequent cache misses. Unless you're dealing with an insanely large number of elements, there's no need to even consider linked lists. Also, if you're inserting and deleting to arrays you're already using a smart container like Java's ArrayList or C++'s vectors -- both of which allow for amortized O(1) operations. Translation: array insertions and deletions are O(1) most of the time, and O(n) occasionally.
Thanks for the work you do. Greetings from Poland
Thank you so much for this course. I really liked learning while reading the java raw and original implementations in IntelliJ.
Thank you for your dedication 👏🏿. A lesson on Advanced data structures will be appreciated
Thanks for this content. I'm switching from Python to Java for a new job position. And this is very helpful for me to refresh and glance the data types in Java.
Your way of teaching is great... 💜
Best refresher on java DSA
oya alaikumussalaam oya rohmatollah...
Thanks a lot...Jazakallahu khoir
Amiiiiigoscode, YES, FINALLY, YESSS thank you !!! data structure, YESSS
Thank you very much bro 🙏🙏👊👊 May Allah bless you
Everytime you upload I'm always excited to watch your courses. Thank you for existing sir and creating Good quality content.
Thanks for this u read my mind!!!!
thank you very much man this course seems to be very good
Really Great Content bro.. with in depth explanation in a simple clear cut way. Millions of tonnes of Thanks for efforts in creating this content.
Voaleykum assalam. Awesome content. جزاك اللهُ خيراً
Wow man...awesome...I am a Java professional and I recently started to watch your video on youtube...you are superb...your teaching style is very good and gives important details point to point with the required practical approach...I have seen your course on your sites too...why don't you come to Udemy so your course is accessible globally conveniently...you really helping people!!...thanks for your efforts and your positive mindset!!!!
I really need to watch this from beginning to end.
DUde you're awesome for this video. I took data structures and OOP in Java and struggled linking all the concepts together. You tied it all together concisely and in a very-well done manner. I'm confident stepping into LeetCode easies w/ a solid foundation. I can grind out the logic, but needed somewhere to start from :) I need to go over OOP concepts again but you made it a hell of a lot easier my friend. Best
Thanks Nelson, always appreciate your efforts for the community.
Been looking so long for a good video on Data structure and algorithms in java..
thank so much, I got much better with you, And I finished this course also.
Thank you! You are a best teacher!
Wa aleikum assalam brother! Thanks a lot for great experience and informations :)
Alhamdulillah, the best course on DSA
Thank you Amigo you are the best.
Wa alkm salam just what i was looking for 👍
Thank you for constantly uploading high quality content that we just need.
Thank you, Brother you are the best. God bless you
Thanks a lot for this great explanation of Data structures in Java.
Thanks! That helped me a lot
Thanks for your sample explanation
1:38:40 Note to myself: if you don't override its classes, its comparison is based on object's memory address instead of its content.
Great video 😊 💯 thank you 👍
So great to watch and easy to follow, thank you!
Thank you, such an information and helpful video.
Awesome! The hashcode explain was amazing!
You are the 🐐. Holiday greetings from America!
Hash Functions and HashCode was the best part 🚀
Voaleykum assalam, bro. Awesome content. I have summed up before watching it. Because it is absolutely useful content for all javaholics. جزاك الله خيرا
Ma sha Allah bro
Excellent video! :) Clear and concise. Now, I would really appreciate if you can post a video on Algorithms (Search, Sort), Big O notation, Space complexity.
when you cant hate the video , love this mans videos , thanks :)
1:09:03 "Set of balls" caught me off guard lol
Very Useful Video Nelson! I agree with the MVP for you!
This is what I was looking for since last week. Thanks, this will be very useful to me.
Salamou Alaykom, great videos as usual
@ 5:17 - "So for you to retrieve a element from an array is just O(n). Right, so it's really fast."
Maybe this was just a mistake you made without realizing it, but retrieving an element from an array is O(1)
Great video! Not trying to be mean or anything. Keep up the good work!
Good job , thanks a lot , I watched the full videos and I learned a lot .... thanks once again
nice vid worth the time
if its too long for u just fasten it up
Thank you Amigos for your such a good dedication. You are helping a lot
Assalamu alaykum brother. Thanks for the tutorials 👍
You are awesome brother , please make new deeper videos about Data Structures in Java (contains Node please) 🙏
I've learned a lot from your videos, thanks!
This guy knows his Java.!
man you're a gem
5:22 retrieving an element from an array (provided you have the index) is O(1) right? You’ve got the index of the element, so it’s a constant time operation. If you were searching for an item in the array (and you didn’t have the index) itd be O(n)
If you have the index of an array then it is O(1) since you go directly to it always in one step.
Awesome content Nelson ❤️ , consider one day to make another video about frontend and backend login with jwt,access token refresh token, session I'd and cookies
You're epic bro! Your British accent makes it even better.
thanks much fam for the love
Good work Amigo I am a self-motivated self-taught Java
super, thank you bro
Awesome explaination
Love to see another muslim has this much knowledge and share it, Allah bless u brother and thanks for teaching us
you have gr8 content I went from 0 to advanced in java and spring boot please we need more and more content, like advanced DBA(Postgres or MySQL), End2End Testing, more in deep in DS and Algos, we need your help tnx a lot and please keep going
Assalamualaikum , I am from India. you are amazing .please make a video on threads , multithreading and it's applications.❤️
Thanks for the great material you create regards !
That was an amazing explanation dude, thanks so much!
Thank you for the quick course, It was very fun learning :)
Thank You for your effort!
Please make a series on Java 8 Stream APIs.
Thank you so much for this, great tutorial 👏
Thanks a lot. Awesome Video, great learning.....
thanks
Oya alaikumussalam oya rohmatollah
Thank you!
Please create a second part of it with advanced Data structures
you are great, fantastic channel, but I'd like to see a video about communication between java spring boot with DB, SQL and mongoDB
Amazing session. thanks brother
Regarding Arrays 9:33, why System.out.println(colors) wouldn't work?
Why the toString method is required?
Thank you for all the content. I found it super usefull!
Great stuff man, definitely gonna use maps that stuff is powerful
TQ...brooooooiio🎉
5:15 is wrong, Array lookup is always O(1). Arrays contain objs with fixed size so u can do size * i to have the position of lookup
Thank you sir.
This is such a good tutorial. Thank you sm
thank you, keep that good working bro esselamun aleyküm
Please create second part of it with advanced data structures like binary trees, heaps etc
I hope you do MAVEN tutorial in future.
You are a legend, very informative and easily understandable coverage.