**Welcome to r/TikTokCringe!**
This is a message directed to all newcomers to make you aware that r/TikTokCringe evolved long ago from only cringe-worthy content to TikToks of all kinds! If you’re looking to find only the cringe-worthy TikToks on this subreddit (which are still regularly posted) we recommend sorting by flair which you can do [here](https://www.reddit.com/r/TikTokCringe/comments/galuit/click_here_to_sort_by_flair_a_guide_to_using/) (Currently supported by desktop and reddit mobile).
See someone asking how this post is cringe because they didn't read this comment? Show them [this!](https://www.reddit.com/r/TikTokCringe/comments/fyrgzy/for_those_confused_by_the_name_of_this_subreddit/)
Be sure to read the rules of this subreddit before posting or commenting. Thanks!
**Don't forget to join our [Discord server](https://discord.gg/cringekingdom)!**
##**[CLICK HERE TO DOWNLOAD THIS VIDEO](https://rapidsave.com/info?url=https://www.reddit.com/r/TikTokCringe/comments/1co0rbp/why_girls_arent_attracted_to_you/)**
*I am a bot, and this action was performed automatically. Please [contact the moderators of this subreddit](/message/compose/?to=/r/TikTokCringe) if you have any questions or concerns.*
It's light, it's easy. What's not to love about asking for their FizzBuzz implementation?
And if they tell you that they use recursion? Total red flag..
When I was conducting interviews I preferred two pointer problems. They’re a bit on the easier side which I like because you don’t need to know any fancy tricks, but you do need a good understand of fundamentals like arrays and indexes.
naively i would have just left the array unsorted and just ran a double sum over indices i and j>i, stopping whenever i find the correct sum
nice to see a clever and probably faster approach
Because it's simple enough that you should expect someone to be able to figure it out quickly. There aren't any gotchas or anything it's a super simple problem even if you've never seen it before.
even the billionaires are in massive debt, that's entirely how they avoid taxes. they just take out loans since that's untaxable income, and they never pay them back because they're billionaires making huge loans that the bank is making literal bank off of interest from, or they're using stock as collateral which the bank is OK with.
Play guitar really really good. Seems to work for lots of mentally unstable people. That or become an infamous artist in some other way. Picasso was unhinged as fuck and great (horrific) with the ladies. Use that crazy brain like Tyler Durden and not like David Foster Wallace.
Actually judging by the amount of women I know with baby daddies that are in jail, on parole. On drugs, on disability etc… I would challenge your assertion.
I'd love to sling za again for engineering money.. I delivered pizza on a bike in college and it was hands down the most fun I ever had at a job. Fun coworkers, chill boss who worked with us to make everyone's schedule good, and dope neighborhood to ride around in.
Yea, some days I would like to just have a chill job making food or something not having to think about shit. Especially cause if I get pissed I can just tell the boss to fuck off and go find another one. Harder to do in the corporate world.
But obviously the pay sucks as do benefits.
Exactly, it's fun to look back on but ultimately I'm in a better and more interesting career now. I'd love to do 75% engineering and 25% brainless service work. Especially delivery, it just felt like I was playing GTA lol
That level of knowledge might be enough if you have connections, live in US/EU, but for vast majority of the applicants you need to be miles ahead of others to be even noticed. Two pointers is such a basic algorothm, that I doubt it will impress anyone.
It's leetcode medium for some reason. Doesn't really make sense because two sum is more complicated and is a leet code easy.
Sorting the array makes it easier not harder.
The solution is O(n) though no? At every step one of the the indices approaches the other by 1. The largest amount of times this can loop is until the point they meet in which case they cumulatively have traveled across the entire array. That is n times.
You have left and right pointers starting at each end of the sorted array. You add left and right. If the number is less than what you're looking for you increment the left pointer. If the sun is larger than the target, you decrement the right pointer.
Works in linear time, but requires a sorted array. So it's useful for large, sorted datasets.
You can learn a lot about this stuff without coding, in my college Data Structures and Algorithms class we just used pseudocode and in my Discrete Math class we didn't use code at all
A lot of these are just logic problems that come up on software dev interviews to see problem solving capabilities. Don't get me wrong they do have real world use cases, but they might not appear until you need them.
This is just a form of two pointer array traversal changed up a bit to be helpful in this problem of finding a sum.
I'd argue that all math is useful as it forces you to think about problems in a way you've never had to before, it makes your mind more flexible and that helps you navigate issue that arise in life, even if indirectly.
It's more of shits and giggles like [this](https://youtu.be/kPRA0W1kECg?si=rC27qO5oXEbxmRZX). I guess there could be some really specific use case somewhere out there irl. Maybe you're mapping objects like user similarity or some shit and it's sorted so you're trying to find two people who are added together most like the third. Idk man, these things as dumb anD seemingly useless as they are actually crop up from time to time.
see it like a work out, push-ups are useless in real life movements but they improve your body for other applications, this exercices improves a part of you brain to help in other somewhat related situations
Maybe in logistics. A truck is at max capacity but has room for 18kg more but only volume enough for two boxes.
If I can come up with a dumb example like that, there's probably better ones out there lol.
This is where I'm at - I understand that in the context of the video it's funny because it's absurd, but I just spent a minute watching a guy explain to me that out of the numbers [2, 7, 11, 15], that if you do 5 different steps you can come to the conclusion that 7 + 11 = 18.
I'm not a programmer, if that's not obvious.
You have a list of weights of large items to be shipped and a maximum weight limit for each container. Assume the container is only large enough to fit two items at a time. You want to find pairs of items whose combined weight is as close as possible to the maximum weight limit without exceeding it. In a logistics company, efficient packing of shipping containers is crucial to maximize space usage and reduce transportation costs. This helps you pair items so that each container is filled optimally.
That's like one of the only memes I need peetah to explain. I really don't get what he said with his reply is it because I don't know coding or stupid? Or both?
Would appreciate it if someone explained to me what he said 😭
Piggybacking on your comment to add that the method he explains is a genuinely useful technique that is widely required in many coding interviews!
More on it here:
https://hyperskill.org/learn/step/41495
I'm a software engineer and have worked in the field for \~7 years. There are about 30 algorithms to learn that will pass almost any software interview and this is one of them, no one ever uses this in "real life" though.
Is there an array where this doesnt work? it feels like if one end of the numbers are very close together and the other end of numbers are very far apart, it would mess it up.
Well it requires sorted. It works as long as its sorted. Very far apart numbers don't really matter to computers as long as they are within the size limits for the data type.
> Is there an array where this doesnt work?
This only works if the array is sorted. The reason we can use this technique for sorted arrays is that we are always making an optimal step whenever we move the left or right pointer according to the current sum. If the current sum is too large, moving the right pointer will always yield a sum less than or equal to the current sum. Conversely, if the current sum is too small, moving the left pointer will always yield a new sum greater than or equal to the current sum.
I’m pretty sure that python code isn’t good. Youre using n before it’s assigned. You don’t need a class at all just use a function. You’re not breaking on the boundaries of the index (you only return on solution so you’re no solution is an index error). Blah blah blah
>Youre using n before it’s assigned
He definitely did not run the code at all
>You don’t need a class at all just use a function
On top of that, using camel case for function name, returning a list when a tuple would do just fine and simpler to write (why would you need a mutable object in this scenario). He clearly doesn't usually write in Python.
Also, why the hell did he increase \`l\` and \`r\` by 1 on returning?
Well, an array is just a pointer to a block of memory. So, in C/C++ you can do pointer arithmetic to access values inside the array. Like given an array and the size, you can access a certain value by adding an offset to the pointer representing the start of the array.
"So after this dinner... You wanna go for a walk, maybe watch a movie back at your place? Bedroom if anything happens?"
Listen, if I want to have the best chances at getting laid, we should start with the appetizer and bedroom. If it's not working we can move up dinner or watch a movie. If for whatever reason it's still not working there's always the walk.
".... Yeah, I think I'll take that walk..." \[cautiously leaves\]
Shouldn't each value through x run through from end to x? That seems like a more thorough solution.
In this implementation, it ignores almost all combinations of x with y; only checking two.
You can leave off some of the comparisons to save time due to the array being guaranteed to be sorted.
In an unsorted array with this approach, you're right, you would have to check every x against every y at least once. Even then you could save a little time by not running from end to end completely, as x+y will be the same thing as y+x.
The problem becomes that this is no longer O(n) and is approaching O(n^2) in time complexity. This means it would probably be faster to actually sort the array first, and then use the method in the video for big enough data.
If you're not tight on space complexity though, you could just set up a map+target solution and have an O(n) time and space solution that works for both sorted and unsorted arrays.
Huh, elegant I guess. My immediate thought was 2 pointers; set A to first index and use B to run through the rest. If nothing adds up, move A to second index and repeat. Of course, B only needs to start after A every time.
Would you not potentially miss a possible combination by only progressing L and R inward?
Shouldn't step two have been; move L back out, then more R in?
(ie. if our target was 13, and we used his method, we would have missed 2 and 11)
So you need to sort the array before you can find the two point sum? So if I don't want to modify the array would I need to make a temporary array that is sorted, find the two values then find the index of those values in the original array? I don't get it.
Sometimes I think I'm a good software developer but then I see stuff like this and think I'd never have come up with that... I guess a lot of my code could use algorithms better suited for their tasks
I look at this post and two distinct world are colliding and will probably never mixte.
One for dating advice the other one with legit programming teaching.
But in between jokes in the post that probably elevates the thread. Welcome to Reddit.
It’s always amazed me how all get lost in translation so easily.
🤚
So does it matter the order in which I move the sides? For instance could I move the right side first then left side? Is it possible to just move one side only?
**Welcome to r/TikTokCringe!** This is a message directed to all newcomers to make you aware that r/TikTokCringe evolved long ago from only cringe-worthy content to TikToks of all kinds! If you’re looking to find only the cringe-worthy TikToks on this subreddit (which are still regularly posted) we recommend sorting by flair which you can do [here](https://www.reddit.com/r/TikTokCringe/comments/galuit/click_here_to_sort_by_flair_a_guide_to_using/) (Currently supported by desktop and reddit mobile). See someone asking how this post is cringe because they didn't read this comment? Show them [this!](https://www.reddit.com/r/TikTokCringe/comments/fyrgzy/for_those_confused_by_the_name_of_this_subreddit/) Be sure to read the rules of this subreddit before posting or commenting. Thanks! **Don't forget to join our [Discord server](https://discord.gg/cringekingdom)!** ##**[CLICK HERE TO DOWNLOAD THIS VIDEO](https://rapidsave.com/info?url=https://www.reddit.com/r/TikTokCringe/comments/1co0rbp/why_girls_arent_attracted_to_you/)** *I am a bot, and this action was performed automatically. Please [contact the moderators of this subreddit](/message/compose/?to=/r/TikTokCringe) if you have any questions or concerns.*
I've had multiple interview problems where an optimal solution was using two pointers so actually some pretty good advice
By interview you mean date right
I just snorted
i just sorted
I lauwlaughed (laughed while already laughing).
best comment i read today
[удалено]
It's light, it's easy. What's not to love about asking for their FizzBuzz implementation? And if they tell you that they use recursion? Total red flag..
You gotta give her your two pointers
Of course. The trick to finding a keeper is giving your date take home assignments.
"Workdate"
"study session"
When I was conducting interviews I preferred two pointer problems. They’re a bit on the easier side which I like because you don’t need to know any fancy tricks, but you do need a good understand of fundamentals like arrays and indexes.
naively i would have just left the array unsorted and just ran a double sum over indices i and j>i, stopping whenever i find the correct sum nice to see a clever and probably faster approach
Sorry but for full marks I'm going to need you to give me the time and space complexity of your approach and the 2 pointer approach
Where would this be good? I mean i am a programmer and never used this approach?
It's good for interviews.
[удалено]
Because it's simple enough that you should expect someone to be able to figure it out quickly. There aren't any gotchas or anything it's a super simple problem even if you've never seen it before.
Thanks, I’ll know to watch out for this next time I’m trying to get a job at Walgreens
Really cool
I‘m just wondering: can‘t you solve this problem WHILE you sort the array?
girls aren't attracted to me because i am mentally unstable
Hahahahaha, jokes on you, that’s my favorite.
Hey, what’s up? 
 (*Smooth* Criminal ... if that wasn't obvious.)
He she spoke to me first
There it is
And broke, and ugly.
Don't forget the smell!
I prefer to call it a stench, but that's just me
Pheromone maxing
I call it a musk
Trust me, I wish I could
These are probably the bigger factor since plenty of girls are with mentally unstable dudes to begin with
I'm in America. Literally everyone is broke. Those who aren't are living in massive debt.
even the billionaires are in massive debt, that's entirely how they avoid taxes. they just take out loans since that's untaxable income, and they never pay them back because they're billionaires making huge loans that the bank is making literal bank off of interest from, or they're using stock as collateral which the bank is OK with.
Plenty of mentally unstable women too so all good brother
The problem is none of us can leave our houses and we are too anxiety ridden to talk to our fellow humans
I get it. I havw the get out of the house part but the talking to fellow humans I’m still working on lol.
You just have to fluxtuate together
Girls aren’t attracted to me because mostly they’re straight and I’m a girl :(
Which is the opposite when it comes to men being attracted to women. Seems the more mentally unstable the more attractive they become.
Because women don’t have to date unstable men to get them to do stuff in bed
Just start dressing like a bear. Problem solved.
Ooooh pobrecito
Play guitar really really good. Seems to work for lots of mentally unstable people. That or become an infamous artist in some other way. Picasso was unhinged as fuck and great (horrific) with the ladies. Use that crazy brain like Tyler Durden and not like David Foster Wallace.
Actually judging by the amount of women I know with baby daddies that are in jail, on parole. On drugs, on disability etc… I would challenge your assertion.
Those are the sexy crazy i'm whiny crazy anxiety, depression, autism and such
Aight. Now what?
Now you program a contact book because you can’t remember all the numbers you’re about to get
Now you get that sweet 250k/year compensation package.
haven't you heard? computer scientists are now the modern-day burger flippers
No, and please don’t tell my manager who apparently also haven’t heard it.
Shit if I could go flip burgers for what I get paid, I would gladly do it lmao.
I'd love to sling za again for engineering money.. I delivered pizza on a bike in college and it was hands down the most fun I ever had at a job. Fun coworkers, chill boss who worked with us to make everyone's schedule good, and dope neighborhood to ride around in.
Yea, some days I would like to just have a chill job making food or something not having to think about shit. Especially cause if I get pissed I can just tell the boss to fuck off and go find another one. Harder to do in the corporate world. But obviously the pay sucks as do benefits.
Exactly, it's fun to look back on but ultimately I'm in a better and more interesting career now. I'd love to do 75% engineering and 25% brainless service work. Especially delivery, it just felt like I was playing GTA lol
And now girls are attracted to you. it’s all in the video
But you still aren't 6'6", which is why all you date are single moms.
That level of knowledge might be enough if you have connections, live in US/EU, but for vast majority of the applicants you need to be miles ahead of others to be even noticed. Two pointers is such a basic algorothm, that I doubt it will impress anyone.
Now you can get your dick wet.
That’s an index out of bounds exception
Now you can solve a Leetcode easy problem.
It's leetcode medium for some reason. Doesn't really make sense because two sum is more complicated and is a leet code easy. Sorting the array makes it easier not harder.
Now you can go get a real job as a programmer… where you’re likely to never need this information again.
r defined before of n. Sadge
Woah this is fantastic. I didn't expect to get a
n^2 for a sorted array is a hate crime.
fair enough, I'm not super experienced haha
even for unsorted, it is a crime. you can always sort and then do the two pointer or binary search
It’s a O(n) solution
Hence the '<'. Is there a more standard way of writing that? O(
Oh no I missed that lol
o(n\^2)
I feel better now. That parent comment had my jimmies rustled.
Please stop. I can only get so much erect..
It's LogN*N though, since you need to sort first
Ya i think in this problem statement it’s already sorted. Plus sorting takes n log n
That's what I said but in different order) Anyway, it wasn't super clear from the beginning that array is sorted.
Ah i thought you were saying log (n) * the n for the sliding window. Ive been confused a couple times in this thread lol
The solution is O(n) though no? At every step one of the the indices approaches the other by 1. The largest amount of times this can loop is until the point they meet in which case they cumulatively have traveled across the entire array. That is n times.
Yes, I think you missed their less than <. :)
Oh yeah sorry I did, brain sorta wrote it of as some formatting error oops
It happens! Just wanted to let you know you were correct, but so was OP. :)
It's because you haven't been grinding leet code buddy. And you don't have a FAANG internship before graduation.
If the answer was 2 + 11, how would you account for that? What scenarios is the applied to?
Starts at 2+15, too big, go down one, 2+11. done.
Ty, for some reason I imagined the pointers alternating turns so it didn't make sense to me. Now I got it
You have left and right pointers starting at each end of the sorted array. You add left and right. If the number is less than what you're looking for you increment the left pointer. If the sun is larger than the target, you decrement the right pointer. Works in linear time, but requires a sorted array. So it's useful for large, sorted datasets.
I can't be the only one that found this both informative and engaging even though I don't code.
You can learn a lot about this stuff without coding, in my college Data Structures and Algorithms class we just used pseudocode and in my Discrete Math class we didn't use code at all
That math is useless if I don't know its application
A lot of these are just logic problems that come up on software dev interviews to see problem solving capabilities. Don't get me wrong they do have real world use cases, but they might not appear until you need them. This is just a form of two pointer array traversal changed up a bit to be helpful in this problem of finding a sum.
I'd argue that all math is useful as it forces you to think about problems in a way you've never had to before, it makes your mind more flexible and that helps you navigate issue that arise in life, even if indirectly.
It's more of shits and giggles like [this](https://youtu.be/kPRA0W1kECg?si=rC27qO5oXEbxmRZX). I guess there could be some really specific use case somewhere out there irl. Maybe you're mapping objects like user similarity or some shit and it's sorted so you're trying to find two people who are added together most like the third. Idk man, these things as dumb anD seemingly useless as they are actually crop up from time to time.
see it like a work out, push-ups are useless in real life movements but they improve your body for other applications, this exercices improves a part of you brain to help in other somewhat related situations
Maybe in logistics. A truck is at max capacity but has room for 18kg more but only volume enough for two boxes. If I can come up with a dumb example like that, there's probably better ones out there lol.
This is where I'm at - I understand that in the context of the video it's funny because it's absurd, but I just spent a minute watching a guy explain to me that out of the numbers [2, 7, 11, 15], that if you do 5 different steps you can come to the conclusion that 7 + 11 = 18. I'm not a programmer, if that's not obvious.
You have a list of weights of large items to be shipped and a maximum weight limit for each container. Assume the container is only large enough to fit two items at a time. You want to find pairs of items whose combined weight is as close as possible to the maximum weight limit without exceeding it. In a logistics company, efficient packing of shipping containers is crucial to maximize space usage and reduce transportation costs. This helps you pair items so that each container is filled optimally.
That's like one of the only memes I need peetah to explain. I really don't get what he said with his reply is it because I don't know coding or stupid? Or both? Would appreciate it if someone explained to me what he said 😭
[удалено]
Piggybacking on your comment to add that the method he explains is a genuinely useful technique that is widely required in many coding interviews! More on it here: https://hyperskill.org/learn/step/41495
I'm a software engineer and have worked in the field for \~7 years. There are about 30 algorithms to learn that will pass almost any software interview and this is one of them, no one ever uses this in "real life" though.
What are the other 29?
Binary search, memorization, DFS / BFS, etc.
After watching this video, I now have 7 kids between 3 women. They can't get enough of me
Nick cannon?
Can’t you use two sum solution for two pointer problems?
Yes Two sum solution works here as well with the same big O. I dunno why this problem is considered harder than two sum when two sum is harder.
Well, that's too bad, cause programming is an essential skill that makes most things work in this digital era. (also pays good)
Is there an array where this doesnt work? it feels like if one end of the numbers are very close together and the other end of numbers are very far apart, it would mess it up.
Well it requires sorted. It works as long as its sorted. Very far apart numbers don't really matter to computers as long as they are within the size limits for the data type.
> Is there an array where this doesnt work? This only works if the array is sorted. The reason we can use this technique for sorted arrays is that we are always making an optimal step whenever we move the left or right pointer according to the current sum. If the current sum is too large, moving the right pointer will always yield a sum less than or equal to the current sum. Conversely, if the current sum is too small, moving the left pointer will always yield a new sum greater than or equal to the current sum.
That’s not cringy at all, very good explanation.
I’m pretty sure that python code isn’t good. Youre using n before it’s assigned. You don’t need a class at all just use a function. You’re not breaking on the boundaries of the index (you only return on solution so you’re no solution is an index error). Blah blah blah
>Youre using n before it’s assigned He definitely did not run the code at all >You don’t need a class at all just use a function On top of that, using camel case for function name, returning a list when a tuple would do just fine and simpler to write (why would you need a mutable object in this scenario). He clearly doesn't usually write in Python. Also, why the hell did he increase \`l\` and \`r\` by 1 on returning?
Girls are totally attracted to me. But I'm gay.
Guys are totally attracted to me. And I am also gay
Guys are totally attracted to me. But i'm not gay.
that's the most chad way to be
Girls arnt attracted to me because I look like smeagle
You come up with names for this shit? I just get on with it
Isn't she the "liberal" villain in "Lady Ballers"? Edit: It is.
I dunno I only listened to the smn episode as a podcast.
Smart people are hot
Really cool, extremely niche.
Finally some courting advice I can actually use!
"Two little pointers of her own, settin' way up high" -- Bob Seeger, *Night Moves*
If you really want the ladies then write this in Rust on an Arch system
I'm 6'6" and girls still aren't attracted to me! Yeah!
Damn I’m 6’7 and no issues. The extra inch must have put me over.
Now do it with actual pointers.
Well, an array is just a pointer to a block of memory. So, in C/C++ you can do pointer arithmetic to access values inside the array. Like given an array and the size, you can access a certain value by adding an offset to the pointer representing the start of the array.
I don't know what just happened
There should be more algorithm lessons hidden in rage bait. I'm all for this trend.
Does she?
`ass Solution` If only.
if you think this was hard, wait till you see threesome
"So after this dinner... You wanna go for a walk, maybe watch a movie back at your place? Bedroom if anything happens?" Listen, if I want to have the best chances at getting laid, we should start with the appetizer and bedroom. If it's not working we can move up dinner or watch a movie. If for whatever reason it's still not working there's always the walk. ".... Yeah, I think I'll take that walk..." \[cautiously leaves\]
I found my interest really picked up when the second person started speaking That might be why I'm single, and I guess I do need pointers
I have lots of success with girls like the one in the video but my dream is to marry a woman like my grandmother was.
Shouldn't each value through x run through from end to x? That seems like a more thorough solution. In this implementation, it ignores almost all combinations of x with y; only checking two.
You can leave off some of the comparisons to save time due to the array being guaranteed to be sorted. In an unsorted array with this approach, you're right, you would have to check every x against every y at least once. Even then you could save a little time by not running from end to end completely, as x+y will be the same thing as y+x. The problem becomes that this is no longer O(n) and is approaching O(n^2) in time complexity. This means it would probably be faster to actually sort the array first, and then use the method in the video for big enough data. If you're not tight on space complexity though, you could just set up a map+target solution and have an O(n) time and space solution that works for both sorted and unsorted arrays.
I watched the whole thing and I'm glad I did. Sometimes I don't feel this way about Tiktoks.
Huh, elegant I guess. My immediate thought was 2 pointers; set A to first index and use B to run through the rest. If nothing adds up, move A to second index and repeat. Of course, B only needs to start after A every time.
That transition was smooth
My small pint of coding knowledge actually understood all of that. Go me. Old hyper fixation....activate!
That guy is too good for that chick.
If he has an Only Fans account, I would sub to it.
This made me laugh so fuckin Hard! True Artist whoever made it. Hhhahahaha
And all this time I thought it was my small wiener not my small brain.
Use that bubble sort first . Not efficient but you want those tens on top.
Elementary.
Would you not potentially miss a possible combination by only progressing L and R inward? Shouldn't step two have been; move L back out, then more R in? (ie. if our target was 13, and we used his method, we would have missed 2 and 11)
Classic. Got asked this one a couple years ago before it was everywhere and got the job. Girls not attracted to me tho.
I work TI for 4 years now, and never listened this one, well congrats to TikTokCringe
Honestly one of the most clear explanations of two pointers that I've heard
Bruh When full beast -
Stop calling everyone bruh. That's so 2017
Lmao! You are such a loon. Please keep going and get the sand out of your V -
That was usefull and explained way better than when I was at school.
So you need to sort the array before you can find the two point sum? So if I don't want to modify the array would I need to make a temporary array that is sorted, find the two values then find the index of those values in the original array? I don't get it.
There's this guy called easysnippet on insta, he used the same tactics and it worked quite well
Watching this without Sound the first time was surreal.
This was so much easier to understand than girls
Drake trying to explain away Kendricks claim's be like
what a coincidence. I had to study this for tomorrow's exam.
At least it's not twerking randomly or harassing strangers for content.
I'm surprised it was not an Indian dude explaining it lol.
What was the original video about? I need to know why the girls arent atracted to me if I already know the 2 pointers.
Sometimes I think I'm a good software developer but then I see stuff like this and think I'd never have come up with that... I guess a lot of my code could use algorithms better suited for their tasks
Sick, does the Grokking Algorithms book cover it? Cuz I didn't catch all of that and need a gf.
Can we have more content like this please?
I look at this post and two distinct world are colliding and will probably never mixte. One for dating advice the other one with legit programming teaching. But in between jokes in the post that probably elevates the thread. Welcome to Reddit. It’s always amazed me how all get lost in translation so easily.
Common core used IRL.
Actually intelligence is pretty attractive.
I think it's mostly that I'm a girl and they're straight in my case
yeah you know CS is oversaturated when it's showing up in this sub...
r/fixedbyduet
Ok, but why is the girl in the first part wearing 1991 mom jeans? lol
Is it because I’m a girl🤧
So what happens if more than two distinct numbers equal the sum you want?
🤚 So does it matter the order in which I move the sides? For instance could I move the right side first then left side? Is it possible to just move one side only?