dude wtf am i watching, who even cares just write the code to do the job, both these examples are fine lol

you could just use the list to make a set get the len of the list and set and compare them if not == true

I would rather pay a fucking tuition

Also because you sort the list when you reach positive numbers there are 0 possible triplets that can be equal to 0

Thanks for this

Don't confuse it with "Product of subarry" problem. This is a different problem

Does the second solution even work? it presupposes that X has an integer square root.

ngl this is interstellar type thing my head litreally spinned after knowing u can print fibonacci like that.

Just an interesting fact ...I'm in another country and this price is like over 2 years of our family income....

What is hashset?

What is the black Friday special? The price is still $5500?

You’re the best Gregg! Thank you!

i am sure that it would be way faster together with a step of newton raphson approximation method :)

heap 🗿

stop with this nonsense. this is like asking someone trying to become a cashier at a gas station, what do you do when you see a crack head coke head and meth head get into a fight while the dude on Fytenll is struck by lightning and an 80 year old man is having a heart attack oh yhea and you cant use a for loop the solution needs to work on numbers f-q and letters 4 and 5 but not 6. while also working for the word Quinone. and returns the ancient Egyptian hieroglyph for warm apple pie on Tuesday and the sum of the inputs and the inputs that = 0 but it must use at least 3...

Algomap-io is amazing and free. But there's a commitment issue because it's a lot of stuff to learn on your own with no help. If you want a dedicated live class with me, it's a bit expensive at $5,500, but is the best option out there if it's affordable for you. I realize it won't be for most people reading this. That's okay. Check out the free version at algomap.io or the live class at algomap.io/bootcamp (black friday special)!

God I love for loops

Come on, I don't even understand the question

Hey Greg what white board u r using for explaining stuff if anyone knows pls let me know

Assembly in the garbage 🤣🤣🤣

Thanks for sharing the knowledge!

Why does he add L and R when dividing? Doesn't make sense if x=4 than M would be 5 and go through another iteration instead finding it the first

Assembly in the garbage 💀

You haven't discussed time complexity 😶

Watching him for a while now I get the impression that at Facebook all they do is to sum up stupid arrays the whole day 😂

bogosort

Why do you need a hash set, when you can have a bit map, as all values are integers and you only want to check if you have a duplicate?

As all numbers are integers and the array is already sorted, the square array will also be sorted. Except for the negative integers, in that case you can just use binary search (O(log(N)) or work with two moving pointers (O(1)).

Where are the curly braces?

wait, I distinctly remember using sets to optimize this problem's runtime. Was the problem recently changed?

best problem to learn all 3 traversal techniques

minesweeper

THEORETICALLY, BOGOSORT IS THE FASTEST SORT ALGORITHM BUT THAT'S ONLY IF YOU'RE REALLY, REALLY LUCKY. BEST CASE IF THE FIRST ITERATION OF THE ARRAY IS SORTED.

Forget it, time to switch majors

the name of the question is crazy

What whiteboard are youyou using using to draw the explanations?

heaps

No faang be asking two sum in 2024 💀

No Tensorflow is bad it has problems connecting with CUDA and cuDNN Pytorch is well built

11:11, as of now.

oh ok

😮🤯🤯🤯

if only getting a job was this easy

I solved it

Learn this stuff for FREE and find all the code solutions for this problem at algomap.io!

Which IDE you using

C is top tier because it makes you code BLINDLY but also in a way you can understand. You dont need any library save for2. Meaning you need to just understand what you’re doing.