- Tubelator AI
- >
- Videos
- >
- Science & Technology
- >
- Master Big-O Notation: Essential for Coding Interviews
Master Big-O Notation: Essential for Coding Interviews
Learn the common Big O runtime complexities crucial for acing coding interviews. Access free code on NeetCode.io to prepare with Python, JavaScript, Java, and C++. Available courses on data structures and algorithms for beginners.
Install Tubelator On Chrome
Video Summary & Chapters
No chapters for this video generated yet.
Video Transcript
hey everyone welcome back and let's
write some more neat code today so today
I want to run through all the common Big
O runtime complexities that you'll need
for coding interviews and by the way all
of the code from this video will be
available for free on neetcode.io if
you're not familiar with it it's
basically a site that I created it's got
a ton of free content to help you
prepare for coding interviews including
code in Python JavaScript Java and C
plus and I've also started making
courses so far I completed the data
structures and algorithms for beginners
course and the advanced algorithms
course and I just started uploading the
system design for beginners course you
can use code neat for 10 off lifetime
access that means you'll have lifetime
access to all current and future courses
so first of all what even is Big O time
complexity well it's basically a way of
analyzing the run time the amount of
time it takes for our algorithm to
execute as the input size of our
algorithm grows typically we can expect
as the input what size of our algorithm
grows the execution time of the
algorithm is also going to grow but it
could grow linearly which you know this
is a function you might be familiar with
we're used to Y equals X in terms of Big
O this is represented as Big O of n
where n is just a single variable that's
our x-axis now this is where we take a
different turn from algebra you could
have another function like this which is
for example n divided by 2 but we
actually don't care about the
differences when those differences are
constant values we only care about the
variable here which is n we don't care
about the divided by two and that's true
for all Big O run times we also don't
care if you know we have n plus some
constant like five like that might look
something like this on our chart it just
starts at a different spot and has the
same exact slope but we don't care about
