ALL Python Programmers Should Know This!!

⭐ Join the Byte Club to practice your Python skills! ($2.99/mo): / @b001
🐦 Follow me on Twitter: / b001io
This quick demonstration shows you how powerful Python's filter() function can be!
Background Music:
a night full of you by ikkun (ex. Barradeen) | / ikkunwastaken
Music promoted by www.free-stock-music.com
Creative Commons Attribution-ShareAlike 3.0 Unported
creativecommons.org/licenses/...

[@b001]

Correction: 1 is not prime. My is_prime function is flawed!

[@JimMaz]

You've made a b001 of yourself

[@damian4601]

just make nums range(2,1000) to exclude 1 instead of making 999 num!=1 comparison

[@careca_3201]

@@damian4601 or just add another condition, because you might want to use 1 in a non prime numbers list

[@thefredster55]

Couldn't you just set nums equal to 1000 instead of range(1,1000) since you're passing it into a range in the function? (Genuine question, literal n00b here)

[@Killercam1225]

@@thefredster55 Nope, because it creates an array of numbers in that given range. So the function iterates through each number in the list and and the filter function creates an object, which then he passes the object through the [list] method which puts all of the values contained in that object into a [list] where the output can be comprehended.

[@boredd9410]

Minor thing, but you can make the prime checking function faster by going up to floor(sqrt(n)) instead.

[@slammy333]

Could make it even faster by only iterating over odd numbers as well

[@programmertheory]

def is_prime(x): if x < 2: return False if x

[@darkfireguy]

​@@slammy333 you can make it even faster by only checking n-1 and n+1 where n is each multiple of 6

[@sidneydriscoll5579]

def isPrime(x): if x == 1: return False if x == 2: return False if x == 3: return True if x == 4: return False This is what you call fast!

[@FuzioN2006]

Why is a youtube comment thread more productive than my work team... FML

[@foxerity]

my man actually made the least efficient function in the history of functions

[@chervilious]

Not only that, it's also wrong

[@chemma9240]

😂

[@rkidy]

Crazy that when doing a demonstration you focus on ease of understanding the concept rather than efficient of an algorithm unrelated to what he is demonstrating 🤯🤯🤯

[@fruitguy407]

False, I can and do write worse code with more flaws. You're welcome.

[@ImThatGuy000]

im new to python, could you explain why?

[@philfernandez835]

primes = [x for x in range(2, 1000) if isPrime(x)]

[@krakenzback7971]

yeah cuz 1 is not prime

[@BookOfSaints]

I think his point is to use list comprehension which is the better choice here.

[@krakenzback7971]

@@BookOfSaints yeah this is list comprehension

[@BeasenBear]

It says "isprime" or "Prime" is not defined when I tried this code. What did I miss?

[@ItzMeKarizma]

@@BeasenBear kinda late but he's calling a function called isPrime and you probably didn't define that function (I don't know if it's supposed to be imported or written by yourself, I use C++).

[@aciddev_]

"all python programers should know this: pep-8" when

[@yujielee]

💀💀💀

[@feDUP1337]

So damn true

[@Cristobal512]

What is that?

[@vorpal22]

@@Cristobal512 PEP-8 consists of the Python recommended standards and best practices.

[@user-cg1ul8bh8w]

Pep8 is just for jealous and mean programmers..... It just unreadable

[@rutabega306]

Okay that time complexity tho

[@TheG7]

Ikr, it would’ve help to use the root of num but still

[@moy92]

newbie here, how would you improve? i thought list comprehensions but dont know ways improve on time complexity

[@rogerab1792]

​@@moy92 memoization

[@rutabega306]

@moy92 There are a few ways you can reduce the time complexity because the one in the video is so suboptimal (quadratic time) You can bring it down to O(Nsqrt(N)) by just checking for factors below the square root. But since we are already collecting a list of primes, we can use some kind of sieve algorithm (look up Sieve of Eratosthones on wikipedia). This will be O(NloglogN) or even less depending on the algorithm.

[@TheG7]

you don't even need if statements to find prime numbers

[@AndrewMycol]

Even as a junior web developer, I really like how you do these shorts. It concisely and simply explains whats going on in the shorts.

[@b001]

Thanks so much! Glad you enjoy!

[@originalbinaryhustler3876]

​@@b001 keep these shorts coming ❤❤❤❤

[@prouddesk6577]

His code is horrible. I am sorry but dont watch this guy.

[@Siirxe]

You can also do primes = [i for i in list(nums) if is_prime(i)]

[@kazzaaz]

this is the way it should be done

[@danielf5393]

You don’t need to cast to list (and you shouldn’t if nums is a long generator)

[@kazzaaz]

​@@danielf5393 For long inputs or generators, another generator also outperforms map/filter pipeline. gen = (i for i in list(nums) if is_prime(i)) for x in gen: print(x)

[@danielf5393]

@@kazzaaz hence prime_generator = ( i for i in nums if is_prime(i) ) I’m complaining about “list(nums)” specifically.

[@hrocxvid]

This was the first thing I thought of

[@Tomyb15]

I would use a generator function to generate a (possibly infinite) sequence of primes by keeping a record of all previously found primes and checking if the next number is divisible by any of those (that should all be smaller than the number) in order. Uses a tiny bit more memory but cuts down on a lot of division operations.

[@jaserogers997]

Using a sieve (if you had an upper limit) would be faster than that.

[@plaskut]

generator with sieve

[@OMGclueless]

@@plaskut It's possible to make an infinite generator with a sieve but it's actually pretty complicated. The sieve by default marks all multiples of a prime the first time you encounter that prime, which is impossible if the generator is infinite. Instead you'd need to suspend and then resume the markings later as you advance through the generator, which is possible but pretty tricky to get right.

[@plaskut]

@@OMGclueless I think I might try doing this. I believe it's a divergent function, so at some point it might have to check to see if the universe has ended yet.

[@ubiabrail6773]

Sieve of Eratosthenes is much better for this , but only if u need nums from 1 sieve works with O(n) in spite of this which works withO(n*sqrt(n))

[@vorpal22]

Doesn't this actually run in O(n^2) since for a prime number, he's checking up to n-1 instead of sqrt(n)? Agreed that Sieve of Eratosthenes is the way to go, and it's a really easy algorithm to understand.

[@brianhull2407]

A better is_prime function would be: def is_prime(num): if num == 1 or num == 0: return False for x in range(2, floor(sqrt(num))): if num % n == 0: return False return True This does three things. First, it factors in the fact that 1 is not prime. (It’s neither prime nor composite.) Second, it accounts for the fact that 0 isn’t prime either (as 0 is highly composite, having literally every integer as a factor). And third, it increases the speed of the function since it only needs to go to the square root of the number. This works because every composite number has at least one factor that is greater than 1 and less than or equal to its square root. Indeed, given any integer x such that x > 1, for every factor _a_ of x that is less than √x, there is exactly one other factor _b_ of x that is greater than √x such that _a_ × _b_ = x. (For 1, it has exactly one factor (itself), and its lone factor is also its square root. For 0, it has infinite factors (everything), but its square root (itself) is less than all other whole numbers.) Incidentally, if num is less than 2, then both range(2, num) and range(2, floor(sqrt(num))) will return an empty iterable that will cause the body of the for loop to never be executed. As such, any value for num that is less than 2 will return True for the original version of is_prime, and any value for num that is less than 0, between 0 and 1, or between 1 and 2 will return True for my version of is_prime. We could add a check for nonintegers: if num != floor(num): return False However, that isn’t strictly necessary, since the input should be an integer, and in Python, we assume the developer would not put a fraction into the function. And it’s not like the code would throw an error in such a case, anyways. The better question is with regards to negative numbers. There are four ways to consider this. First, we could just assume that the developer would never input a negative number. This is fine… unless we’re getting input from a user, in which case either the developer or the function should do a check. The second way is to treat all negative numbers as composite on the grounds that they each have at least three factors: 1, itself, and −1 (where we only include −1 as a factor if the number itself is negative), and prime numbers must have exactly 2. In that case, our first conditional would instead be: if num == 1 or num

[@themusicremixco]

As a mathematician, #3 and #4 are the correct options here. Either you're working over positive integers, in which case you should throw an exception if negative, or you are working over all integers, which you can use the general definition of a prime element over a commutative ring: p is prime if p is non zero, p is not a unit (here a unit is 1 or -1), and if p=a*b for a and b integers then either p divides a or p divides b. You can see based on this definition that 6 is not a prime: 6=2*3 but 6 does not divide 2 or 3 evenly (i.e. 2/6 and 3/6 are not integers). Similarly for (-6)=(-2)*3, so -6 is not prime. And for positive primes p, we must have p=(±1)*(±p), and p divides ±p. Similarly, -p=(∓1)*(±p), and -p divides ±p. So p is prime is equivalent to saying -p is prime. Notice that over all integers, all primes p have 4 factors: 1, -1, p, -p. It is incorrect to assume all primes have 2 factors, otherwise the only primes over the integers would be 1 and -1.

[@brianhull2407]

@@themusicremixco Thank you for your input! I was unaware of how primes work under anything other than nonnegative integers, so I wasn’t aware of the “four factor” definition. I figured there probably _was_ something, though. That said, it is worth noting that, in computing, we don’t always want perfect mathematical accuracy. Sometimes, we prefer speed over accuracy.

[@salvatorearpino9243]

I usually prefer the list comprehension method instead of filter ie: [n for n in nums if is_prime(n)]

[@arjundureja]

List comprehension is also faster since. you don't need to convert it back to a list

[@salvatorearpino9243]

@@codeman99-dev timing performance was pretty similar between the two methods. When you check out the disassembled python bytecode (using the dis module), list comprehension has more operations with the python interpreter, so it will most likely not be preferable for code that uses multiple threads (it's more susceptible to global interpreter lock slowing it down)

[@vorpal22]

List comprehensions are faster, and in this case, a generator would be even better. Both map and filter are discouraged in Python 3.

[@reef2005]

For a relatively large number, the isprime func will take a long time to return true or false. Instead of checking every integer

[@alexwhitewood6480]

Previous primes upto square root of nums*

[@reef2005]

@@alexwhitewood6480 yes indeed

[@stareSimulVelCadere]

getting more and more declarative, love it

[@wiccanwanderer82]

You only need to check if it's divisible by smaller primes.

[@alpacalord507]

But than you need to have a list with primes, so this does not really help

[@thesnakednake]

@@alpacalord507 You can build the list as you go; if you let the is_prime function take the existing prime list into account, you can just append new primes you find until you reach the end of the range. However, you can only do this when you’re making the list in order from 2 like this, since you wouldn’t have all the prior primes otherwise

[@alpacalord507]

@@thesnakednake And? That's still not solving the problem of checking if a number is prime. You're making a list of primes now, which does not (really) help us checking if a number is prime.

[@dfsgjlgsdklgjnmsidrg]

@@alpacalord507 u stupid but your profilpic is meliodas so im not mad

[@thesnakednake]

@@alpacalord507 The task in the video is to make a list of the primes from 1 to 1000, not just to check if a number is prime. The function that checks it in this video is a means to an end, not the end goal

[@uselessschmuck190]

Dude makes me wanna get programing socks and learn python

[@DeepFriedOreoOffline]

This is really awesome! I was making a program the other day and I kept getting a similar return to the one you show at the end there and had no idea what was going on! Life saver!

[@FirstnameLastname-rl4qi]

Could be more efficient, when checking for a prime you only have to check for factos up too the square root of the number, so if you square root the high end of the range it should work faster!

[@rohakdebnath8985]

Sieve of Eratostenes where you take a vector bool of all trues, then you start a loop from i²(i = 2 to √N) and flag all the multiples in the vector. The position of the trues left in the vector are all the prime numbers till N. This is simpler shorter and well known.

[@AWriterWandering]

Alternatively, you can use a conditional within a list comprehension: [ n for n in nums if is_prime(n) ]

[@HussamHadi]

This is the correct pythonic way of solving it. Avoid using filter whenever possible

[@e1ke1k96]

Or even : [n for n in nums if n%2==0]

[@nullopt5174]

@@e1ke1k96 that’s not how you define a prime number.

[@patrickcuster2348]

The tradeoff is that a list comprehension is going to store the whole list in memory while filter keeps it as a generator until needed. Both are pythonic and have their uses

[@AWriterWandering]

@@patrickcuster2348 yes, but in the video he used to list function, so a list was the intended output anyway.

[@unknownman6978]

we have all of the prime numbers 1, 2, 3 💀💀

[@-sn4k3-94]

It’s prime, what’s wrong?

[@finnyass1407]

@@-sn4k3-94 1 isn’t a prime number tho

[@asi3136]

​@@finnyass1407argument of semantics, it's generally not considered a prime but the arguments are vibes

[@t.gmultiplex2838]

At every line for a sec I thought he missed; then remembered oh yeah it's python 🤣😂

[@back2710]

For those concerned for its complexity, remember you can always use sieve of eratosthenes in most cases, this only would be required in case of big numbers

[@nagyzoli]

Sieve works for any number, and it is the most optimal way of generating sequences of primes.

[@user-th2cp8uh8r]

I must admit that I'm a little mad that this didn't show up when I needed it but this tips are very cool and informative!

[@user-yj3mf1dk7b]

open book

[@davesharp5472]

Props to you for making videos where you know that 90% of the comments will be “well actually….” Or some other form of telling you how you are wrong and should have done it their way.

[@davesharp5472]

​@Harrod Thou Thanks for chiming in. Id say its more ironic you dont view comments like "Thanks for teaching job applicants to not format their code properly and also use a less readable alternative of list comprehensions." as negative. I'm offering support to b001 and props for sticking his neck out there. This field particularly is filled with people who love nothing more than to correct people, not too dissimilar to your response to me. See Stack Overflow for example. Have a good day.

[@zhairewelch8291]

@Harrod Thou the neg comments are there, it just doesn’t take up 90% of the comment section.

[@Pharisaeus]

Not sure if it's such a great idea. I personally always report such videos, eg. as "misinformation" and choose for them to not be recommended any more.

[@BeasenBear]

I tried your code and it worked! I'll check your channel for more!

[@newsjuice7404]

I love python even more bcoz of you. You are absolutely amazing thanks & keep uploading such clips

[@vorpal22]

He's not teaching you modern Python practices. You should not use filter and map in Python 3.

[@revenevan11]

I'm just learning python, thanks for showing me the filter function!

[@75424ht]

Thanks man you're the best!

[@soumilbinhani8803]

hey you can make this is_prime() function a bit more efficient by keeping x in the range(2,sqrt(num)+1) and keep an exception if-else for the number 1 hope that helps

[@newgamingchannel6805]

Thank you. I love your channel

[@Nikhil-Tomar]

You could also use primes = [x for x in nums if is_prime(x)]

[@rubenvanderark4960]

``` from math import floor, sqrt def is_prime(x): if x==1: return False for i in range(floor(sqrt(x)): if x%i == 0: return False return True ```

[@Jakku_Azzo]

He said, “Able Prize here I come”😂🔥

[@KillToGame]

scientists: use powerful computers to find new primes me: types infinity intead of 1000

[@mr.luciddream6634]

You could make it faster by defining a set where primes are stored and with each number check if it's a multiple of a prime in the set instead of the range [2,x). If it's not a multiple of 2 it ain't a multiple of 4 or 6.

[@TheSkepticSkwerl]

This also 100% explains why functions are amazing. Return is better than break.

[@gingeral253]

You can also remove checks by going up to the square root of the value because anything past that would a repeat of something already checked.

[@thesuperrancher9684]

This is a problem I was literally working on today. I saw a really similar solution on stack overflow

[@zakzak24]

wow filter function is a time saver, before I used to go for the slower solution : for num in nums: if is_prime(num): print(nums[num]) else: continue ty for the vid🎉

[@SolathPrime]

you can do the same function but better cause if you know that every prime number can be written in the form of 6n + 1 or 6n - 1 except the multiples of prime numbers: 2, 3, 5, 7, 11 where n is a natural number

[@zay1649]

bro what is that vscode theme its so nice

[@hezztia]

It's "SynthWave '84" from Robb Owen. It has an option (called "neon dreams") that makes the letters glowy, but i don't use it because i don't like it.

[@Matias-rx1wk]

@@hezztiafont?

[@Alpheamus]

What python extension do you use in vscode? It's more colorful than mine and I'm jealous!

[@AndoroidP]

Just use Sieve of Eratosthenes, get better time complexity of O(nloglogn)

[@SegFaultMatt]

That’s the way I’d do it. Much better than this method, sad your only upvote is me.

[@NathanSMS26]

The prime thing was just an example to show off the filter function

[@jackomeme]

Combine that with memorization, you can reduce the big O

[@eck1997rock]

Thanks for teaching job applicants to not format their code properly and also use a less readable alternative of list comprehensions.

[@archigan1]

beat me to it

[@kaniran1]

Was looking for the list comprehension answer :-D

[@johnr3936]

Actually terrible way to write python. Do you think its just bait? I would not merge that

[@the_lava_wielder6996]

Bro you guys unironically code in python it doesn't matter anyways

[@eck1997rock]

What should we use sensei?

[@CreateCG1]

I am mew to python and u are helping a lot! Thanks

[@RazeVX]

Love to see a beginner friendly version of this codeing practice because I know how it looks after generations of programmer optimized the shit out of it in countless different languages since primes are essential for cryptography 😅

[@davidmachado132]

Wow, that one was very helpful

[@thedeegan]

range is non inclusive, so it gives you a list of numbers between 1-999.

[@ryanhasmanners9997]

Or just do print([x for x in range(1000) if x%2==0])

[@FarhanAlam-jb5xy]

That just returns even numbers

[@ethannguyen2551]

You check if it's divisible by every number up to it, but you really only need to check the previous prime numbers, since if it's divisible by a non-prime, it will also be divisible by its prime factorization.

[@TarasZakharchenko]

Python dev meets functional programming for the first time :-D

[@Xiaika]

You can massively improve performance of finding primes by searching between 2 and sqrt(n) since if we have two integers x and y such that n = x*y then it’s not possible for both x and y to be greater than the sqrt(n).

[@natelance6713]

If you're going to immediately turn it back into a list, don't use filter, use a list comprehension because it's faster. If you only need an iterator, then use filter.

[@josgibbons6777]

With the Sieve of Eratosthenes, you don't judge each number like that: you create a list of bools you update to eliminate multiples of whatever's still prime. It's more efficient.

[@johannbauer2863]

if you want to have a list of primes, use a sieve (e.g. sieve or erasthostenes or atkin) instead of this

[@BlackLightning0Games]

Make the range go to the sqrt(num) instead of num, because that is the max you can go without the smallest and largest of the multiples switching. To check is 49 is prime, you only have to check up to 7 because 7*7 = 49 This changes from o(n) to o(sqrt(n)) If you can do this it will save you on at least one coding interview.

[@richardchurchill5181]

You do not need to check numbers from 2 to num. No divisor of greater than the square root of num needs to be checked if you check those less than that square root.

[@fire17102]

Really nice, can you cover map? Also for prime check count up to the square root of num, not num :) ❤

[@EternalCelestialChambers]

You can make the prime checking faster by first checking 2 and 3 then checking every (6 - 1) and (6 + 1) untill sqrt(n)

[@tpd_]

Print(list(filter(list(map(lambda x: x is not any([x%y==0 for y un range (2,x)]), [i for i in range (1000)])))))

[@RayTracingX]

Imao😮

[@user-ns3js2ji4z]

The function is_prim can run til square of num to check if the number is prim😊

[@ShillingTechy]

Might save a few iterations if you check till x hits half of num instead if having num = 9 n you also check when x = 8

[@Wyrmver]

there's a mathmatical formula that returns 1 if n is a prime

[@lordfirespeed]

Nice demo of filter(). In reality one should use the Eratosthenes' sieve to obtain large lists of primes in python

[@Rugg-qk4pl]

In double reality one should download a large list of primes

[@GordieGii]

Is that because it takes less time, less ram, fewer lines of code, or is easier to understand?

[@Rugg-qk4pl]

@@GordieGii Sieve is going to be significantly faster, but more lines of code. Not sure on the memory usage. But as long as it's clear you are implementing the sieve, difficulty to understand shouldn't be an issue.

[@GordieGii]

@@Rugg-qk4pl That makes sense. The original video said that one objective was to save memory. Since range is an itterable, it only produces the next number and returns it to filter so the list only ever contains the primes. To do Eratosthenes' sieve you need to have all the numbers in the list and then prune them. I suppose you would only need a bool or a bit for each number, but then you would need bit handling routines. Probably already libraries for that sort of thing.

[@piwi2775]

I wish I knew this before my interview

[@sven179]

I was about to comment 1 is not prime and you only need to check up to the square root of a number to check if it’s prime. I was happy to see others already said this.

[@philfernandez835]

square root + 1 right?

[@sven179]

@@philfernandez835 No, only up to the square root (and including it in the case that it happens to be an integer), but square root + 1 is completely unnecessary. The argument is as follows: suppose a number has no prime divisors

[@zackm2299]

I had to code that in assembly once

[@Jakku_Azzo]

Had to code it in brain fuck the other day *cracks knuckles* R/iamverysmart

[@llollercoaster]

Beautiful exponential time complexity

[@7268896]

It's quadratic, not exponential

[@llollercoaster]

@@7268896 good catch. you're right

[@oreoforlife720]

Alternative way that is much easier to remember: condition list comprehension

[@BlastGrip]

You only need to test up to the square root of any given number when checking for primes.

[@vorpal22]

How did this not get upvotes? I said the same thing. This is way too much work being done.

[@IThinkItsMe]

Thanks for this. Can I cast it to a set or tuple and get the same output? :-)

[@loganselner521]

The Pucci table

[@mistermiggens5555]

Def getPrimes(array): ReturnVal = [] For I in range(len(array)): If math.sqrt(array[i]) == int(math.sqrt(array[i])): ReturnVal.append(array[i]) Return ReturnVal

[@PriestPoppy]

You can also do: primes = [x for x in nums if is_prime(x) == True] And this will output a list of prime numbers without needing to convert it (if you instantly need to use the list and not the object)

[@gavinhofer4588]

You don’t need the == True

[@PriestPoppy]

@@gavinhofer4588 you're right! my bad

[@OctagonalSquare]

If you ever have to find if a number is prime, you don’t have to divide by every number up until that number. You just have to divide by every number until half of that number. Cuts the amount of calculations by half

[@raba9808]

There are so many ways to find prime, I'm surprised that finding prime numbers isn't already a built in function

[@technowey]

This is a good tutorial for how to use a filter. However, there is an error in the program. 1 is *not* a prime number. There are also more efficient ways to filter prime numbers.

[@1Richmar]

pretty cool. You could also do list comprehensions which is native to the language. I believe it's the fastest native way to do this. Not sure though, as I'm a beginner in python lol

[@Rushabh3d]

Wonderful bro !!!

[@wz8881]

What VS Code color theme is this? I love it!

[@BobChess]

Why does I get an energy drink after running this code 💀

[@user-dk2tz1ww9x]

Well if all you wanted was to print you could iterate through the filter generator, and print each number, so no need to fill memory with list. In most cases you don't need to convert generator to concrete collection.

[@Cristobal512]

This is so much easier to do in R.

[@ai_panorama]

Thanks for sharing.

[@leroyjenkins1911]

When you eliminate every number which is dividable by num from the list you can improve your time complexity drastically.

[@fri_punt_so]

How do you record this? Audio while typing are seperate from the screen

[@giovannip.6473]

Little tip from me: The for loop doesn't need to loop over n, but is enough in range(2, n//2 + 1) 😉

[@biank23]

In fact, the loop is only necessary up to the square root of n

[@alexwhitewood6480]

@@biank23 this!

[@darrenxavierjohan861]

1 is definitely my favorite prime number, innit?

[@calvindibartolo2686]

is your prime number filter dividing a number by every number between 2 and the number? Can you modulo it by the primes less than the sqrt of tested number as it's built? then you're only dividing it by the primes because if a number cannot be divided by a prime, then it must be prime. I'd imagine this would be significantly faster

[@PabloEscobarmitzvah]

Good to check the potential factors twice to ensure we can display a nice "Loading..." screen 😊but in case you're looking for efficiency you could start by checking up to sqrt(n), because I'm pretty sure a*b = b*a for integers so if one of the factors is > sqrt(N), the other will for sure have to be below sqrt(N) and we can stop the primality check. I think you'd better show the use of a library rather than careless "tricks"

[@mathadventuress]

Hey this is awesome thanks

[@Broadsmile1987]

I thought you will do some clever caching of values to optimize the algorithm, and it's just a filter 💀 also you could unpack inside of print, no need to convert to list.

[@AWriterWandering]

btw, your is_prime function has one oversight: 1 is not prime.

[@genalkali1779]

if you want primes in a certain range it is faster to use the Sieve of Eratosthenes (look it up) it is actually really easy

[@Saverax._33]

You can use MATCH and on the CASE put the IF statement

[@midclock]

I would focus on writing a condition that returns true as soon as possible, instead of having the truthy condition at the end of the function. The condition in the video is "pessimistic", as it defines something, by saying "something is not x". This example is simple, but there are complex scenarios where you want to have an exception at the bottom of your function, thrown when you're not able to determine an outcome. Cheers!

[@utkarshsharma7459]

Informative🎉

[@Yupppi]

This is really nice, but you can't save shorts to your playlists so you'd have a library of useful tips and methods.

[@Lurkartiist]

I want to learn to code but it’s intimidating tbh . I’m no genius . Not gonna let that stop me from going for it though 💯

[@AbdulRehman-rf2cc]

less gooo

[@bonquaviusdingle5720]

it has a steep learning curve in the beginning but gets very easy, like learning to drive a car