Time & Space Complexity - Big O Notation - DSA Course in Python Lecture 1
Vložit
- čas přidán 25. 07. 2024
- Master Data Structures & Algorithms for FREE at AlgoMap.io/
Complete DSA Pathway Zero to Hero: • Data Structures & Algo...
Please check my playlists for free DSA problem solutions:
• Fundamental DSA Theory
• Array & String Questions
• 2 Pointers Questions
• Sliding Window Questions
• Binary Search Questions
• Stack Questions
• Linked List Questions
• Tree Questions
• Heap Questions
• Recursive Backtracking...
• Graph Questions
• Dynamic Programming (D...
My Data Science & ML CZcams Playlist: • Greg's Path to Become ...
Learn Python and Data Science FASTER at mlnow.ai :)
Support the content: / @greghogg
Follow me on Instagram: / greghogg5
Connect with me on LinkedIn: / greghogg
Follow me on TikTok: / greghogg5
Coursera Plus: imp.i384100.net/P0E3J6
My Favorite Courses:
Data Structures & Algorithms:
- UCalifornia San Diego DSA: imp.i384100.net/LP31oV
- Stanford Algorithms: imp.i384100.net/vNBoxd
- Python Data Structures: imp.i384100.net/NkZn47
- Meta Coding Interview Prep: imp.i384100.net/Y96rBJ
Python:
- UMichigan Python for Everybody: imp.i384100.net/QOLM73
- Python Mastery from MLNOW.ai: mlnow.ai/course-material/python/
- Google IT Automation w/ Python: imp.i384100.net/5g6Xyj
Web Dev / Full Stack:
- Meta Front-End Developer: imp.i384100.net/q4Jemy
- IBM Full Stack Developer: imp.i384100.net/Gj9dMn
- Meta Back-End Developer: imp.i384100.net/xkW0r5
- John Hopkins HTML, CSS & JS: imp.i384100.net/QyoRAA
- IBM DevOps: imp.i384100.net/kjd2r0
Cloud Development:
- AWS Fundamentals: imp.i384100.net/anqBjZ
- GCP Cloud Engineer: imp.i384100.net/g1jvqB
- Microsoft Azure Fundamentals: imp.i384100.net/EKm5O4
Game Development:
- Michigan State Unity Development: imp.i384100.net/6eOBnr
- UColorado C++ for Unreal Engine: www.coursera.org/specializati...
SQL & Data Science:
- SQL by MLNOW.ai: mlnow.ai/course-material/sql/
- Python for Data Science by MLNOW.ai: mlnow.ai/course-material/data...
- Google Data Analytics: imp.i384100.net/1rkWAR
- IBM Data Science: imp.i384100.net/P0ZRL6
- IBM Data Engineer: imp.i384100.net/4PbZyZ
Machine Learning & AI:
- ML Mastery at MLNOW.ai: mlnow.ai/course-material/ml/
- ML w/ Andrew Ng: www.coursera.org/specializati...
- Deep Learning w/ Andrew Ng: imp.i384100.net/a1kjJj
Master Data Structures & Algorithms For FREE at AlgoMap.io!
Great video Greg!
Maybe this playlist will turn into one of the best Python DSA course on youtube ;)
Please continue adding more videos on data structures and algorithms (DSA) in Python; they are really helpful.
Wow. Huge thank you, best explanation yet. Your teaching abilities seem magical.
Awe thank you so much, that's so kind of you to say
your explanation is so soothing. Already watched DSA 1-6. Please bring more.
Glad to hear it!
Really loved how well scaffolded and structure this video is! Knew about big O but your video was definitely one of the best explanations I've come across 🎉 with simple to understand functions before delving into the concepts mathematically. Thanks for the great work done
Very glad to hear it, thank you ☺️
Lets gooooo!
Awesome
@GregHogg this video is under "Linked List Questions" Featured playlist, which can be seen in video description.
starts with
1.7K views 4 days ago _Linked List Questions_
I was aware of your channel for quite some time, read and churned through numerous dsa and python da books. This content is golden and the best that I have seen on youtube to date. Keep up the great work Greg!
Haha really glad to hear it 🥰
Thanks alot bro!
Your videos are amazing.. Please keep teaching DSA!
Thanks so much!
here we go!!!!
Babe new video dropped from Greg Hogg new DSA series..
HAHAHA
Yes I also waiting for machine learning
I’m confused. Isn’t the second example O(n*logn) since you’re not traversing through the entire array for each number? Just the remaining possibilities of unique numbers? With n^2 you’d get 25 possibilities but here you get 15
It's actually about 1/2 n^2 which simplifies to O(n^2).
Imagine generating every pair of inputs including 'duplicates' like (1,5) and (5,1). You would get the full 25 options.
Adding the rule "once the (1,5) pair is made (5,1) is redundant" can at most divide the number of outputs by 2.
It doesn't perfectly divide the input by 2 due to pairs like (2,2) and (5,5), making the formula 1/2 * (n^2 +n), but that simplifies to O(n^2).
W mans I love your content
Thank you!
Hey bro have you covered strings i am not able to find the lecture
Yes check my theory playlist
Do a video on tree and O(log n)