Time & Space Complexity - Big O Notation - DSA Course in Python Lecture 1

[@GregHogg]

Master Data Structures & Algorithms For FREE at AlgoMap.io!

[@phokchanrithisak]

Hi Greg, this is the best underrated free course on DSA! People aren’t dumb; it's just that very few can explain concepts as clearly and effectively as you do. Thanks for making it easy to understand!

[@Dovakin72]

Thanks, that's the most understandable explanation of Big O I've ever seen. It makes more sense to me now

[@MohammedAhmed-y9r]

I've never though in my life that data structures is that interesting , thanks for the tutorial Greg

[@GregHogg]

Hahaha you're very welcome!

[@takuya-f6b]

Literally saw one the best approaches to learn DSA, super intuitive, not many people out there teach it this way- need more content like this

[@Jafar801]

Please continue adding more videos on data structures and algorithms (DSA) in Python; they are really helpful.

[@hello_there79]

Great video Greg! Maybe this playlist will turn into one of the best Python DSA course on youtube ;)

[@GregHogg]

Sorry for the slow reply... Hope so!!!

[@shiyun2811]

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

[@GregHogg]

Very glad to hear it, thank you ☺️

[@HarshVerma-k9z]

You're so good at teaching, Greg! I'll buy your membership once I land a job. Thanks for your guidance.

[@mohdshafiek]

I've been trying to understand Big O Notation. Your video help me a lot. Thank you Greg !

[@blazenetic]

Wow. Huge thank you, best explanation yet. Your teaching abilities seem magical.

[@GregHogg]

Awe thank you so much, that's so kind of you to say

[@ahnaftanjid5531]

your explanation is so soothing. Already watched DSA 1-6. Please bring more.

[@GregHogg]

Glad to hear it!

[@turmoilstabilizer9054]

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!

[@GregHogg]

Haha really glad to hear it 🥰

[@shantanujha6477]

Amazing content Love from India ❤❤

[@mkz2386]

This is a fantastic playlist, thanks man

[@chakradharkalla2857]

here we go!!!! Babe new video dropped from Greg Hogg new DSA series..

[@GregHogg]

HAHAHA

[@aaronlobo3106]

Thanks alot bro! Your videos are amazing.. Please keep teaching DSA!

[@GregHogg]

Thanks so much!

[@MohsenHossam-li8dn]

strong video i follow you from egypt

[@hello_there79]

​ ​ @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_

[@Marceline1120]

Thank you so muchhh !!!!!!! 😭

[@Al0Al0]

This was very helpful.

[@th3graduate292]

Good revision video

[@muniswamivikram]

Yes I also waiting for machine learning

[@tareqoweinat5952]

awesome thank you so much

[@santhu-hw2qw]

Done❤😊

[@GregHogg]

Amazing

[@PostMeridianLyf]

Lets gooooo!

[@I_world]

Hi I’m a beginner at DSA , should I watch all the tutorials before jump to the leetcode?

[@jamestacular]

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

[@epicman9181]

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).

[@siddharthaher3266]

Wow, thanks you!

[@Carlos123-zk7qw]

Thanks a lot !!!

[@KingJon777]

Thanks for this definitely going to check it out. Would you recommend using this over the San Diego dsa course on coursera?

[@GregHogg]

Easily.

[@ParthMakwana-dz9yh]

Can you please tell me which whiteboard you are using?

[@dejaphoenix]

The whiteboard is a free website called Miro Lite.

[@wilsonchen5224]

W mans I love your content

[@GregHogg]

Thank you!

[@juhi_rathor]

have you made notes for whatever you are covering up in the videos?

[@alanmathew7247]

Do a video on tree and O(log n)

[@firdousProgrammer]

Awesome

[@Andrew_N_G]

Hey bro have you covered strings i am not able to find the lecture

[@GregHogg]

Yes check my theory playlist

[@BiplobKumarSutradhar-d1i]

O(1) O(log n) O(n) O(n log n) O(n^2) O(2^n) O(n!)

[@roshanrosh7416]

guys can anyone say what is the type of whiteboard that he uses please?

[@solitary984seat5]

whats the app name for drawing , pls?

[@eblan]

Canva

[@jenex5608]

Bruh where were you 2 years ago. In my undergrad

[@llcarry5882]

I'm sorry but i'm so frustrated by the n² drawn under the n after 1