วีดีโอ

What about moving all words that didn't pass the suggestion into a different list on every keypress, and at the beginning (with the provided pool) too? That way discarded words don't need to be checked again

like get 4 views

Thanks for this cool video 😁, all that’s left to do is advertise it

Hey, came from Another Roof, and great video! What first popped into my mind was that if "bagged" is a spellable word, then words such as "bag", "bad", "ad", "age", etc. must also be spellable. Algorithm-wise, one could construct a directed graph beforehand where e.g. the node "bagged" points to the node "bad", which points to "ad", and if "bagged" is added to the list then all of its descendant nodes are also added to the list. But your optimization already runs pretty fast, so I'm not sure how much this would improve the performance.

I wonder what this would look like with a markov chain helping you predict which words are most likely to appear after the last ones you typed, and therefore more likely to make a coherent sentence.

“In the event of daily map karate, punish time as degrading warm socialism. Pick on dk” I didn’t try very hard, but it’s fun.

I like that this kind of stuff is on TH-cam. Ty.

Are you a v tuber?

The sandman bit got me good

I speak, "I think the sources are magic and point kindly at prim gals of vim." We add, "Amen. " - My attempt.

Cool

Bitwise operations on ordinary word sizes (like 32 bits which I assume you used) should be about the same speed in any mainstream language because the CPU can do them directly and the compiler or interpreter should just call that hardware operation.

That was fun! My attempt (uses all letters): "Hi, I'm no average taskmaster chick. I know no fear. I demand my island, digital puppets."

8:00 - "If you look closely, you'll notice I have too much free time" that one caught me off guard 😂

Your program wins! It indicateth in-demand skill. Damn, math is peak! Ace! Fave! P.S.: go Ike!

ah, great vid, friend! you seem smart, like a wise monk. in addition, cat is a champ, k? gn, ppl (had to rely on abbreviations, but better than my initial strategy of making up an acronym for my leftover letters)

this is such a good video

Excellent! Here's my attempt: A key detail changes how environmental issues mark a damp format: "I'd nick pi digit" (P.S. It explains why I wouldn't be able to participate in Matt's calculations as I would cause a tsunami of tears) (P.P.S. That definitely wasn't written after I solved the anagram)

"Canvas-fueled parents dare erect painting shop! I dig silk, okay? Hmm- into wiki, madam!" Uses all the letters, makes none of the sense.

My attempt: "And if i did Taskmaster, my language machine appropriates lives with one dim knock"

I spake real lies, wham!

I'll second what I've seen others say: I'm surprised this doesn't have more views! I had fun trying my hand at it. My attempt is spoken by someone with the name Ace Dims. Maybe came out as more of a threat than anything inspiring, but ah well. "Ace Dims: If you don't make grampa king, I will take his ice heart and end it. Ransoms. PVP."

"Personally I disagree with our concept. Adapt, madam; invest in hags. Damn Mike!" Unused: fiikk

Great vid! Meathod was genius. I press red channel notification pad (Trying to say "Subscribed" with the letters provided was a nightmare)

Im always down for these „I wrote a software for x“ videos but each and every time I am surprised the video maker actually explains the code and all that. I understand nothing, nodding happily along and stay for the results 😊 great idea and video 👍

"Hold onto the new feels and anticipate sudden kia aaaak! mimsy vim pricks grip grim" Edit: I did one more and actually looked at the suggested words this time "Alice overassessment guidance: helping thwart ironman amid pimp kid kayak. Do it. F. "

Some would call this a TASmaster. (I hope this joke isn’t made in the video)

My attempt: "I am king Ammu. Apply what visions I declare: Go, think, make it, proceed and end as first."

Such a good video!

I note that if it's a *speech* , it doesn't have to be spelled entirely correctly. The clip you showed at the beginning had upside-down flags. So, you need either-or letters, so the pair is removed if you use either of them.

I did something like that in the 80's to quickly search a database -- on floppy disk. I actually used a 32x32 bit square noting letter combinations.

I absolutely love this! Taskmaster, math, and computer science. What could be better?

i train no more fad maps, the way i- akk! Damn deeds in great value. Click things, i pop sim.

My attempt at the Task (in under 20 mins) using your website: Did I speak an acid poem? Aging vinyl foes wrecked! I am triumphant on Taskmaster. Letters remaining: H, i, L edit: grammer lol

"I faked depth, keep a grip. To whom it may concern: a divined skill in anagrams is a must."

The year is 2030, coding interviews have moved on from leetcode. The challenge? Solve Taskmaster tasks.

Another idea instead of bitfields could be to use vectors/matrices. That way you can easily encode the letter quantities, and instead of 26 comparisons you just subtract two vectors. Should be a lot faster than loops and ifs, even in JS.

I know the agenda for this: marked speed uptick mainly via minimal data processing.

Here's a quick attempt that kind of makes sense: "Look under the desk and make an anagram within limits of massive cryptidic pipage"

Man, I wanna see that cat one more time.

This reminds me of a leetcode problem find max value within window. Because we are only modifying the letter pool at the cursor, the rest of the letter pool is unchanged and recalculated over and over unnecessarily. You may want to look into the KMP algorithm as I believe it was the optimal (though not easily implementable) algo for this.

"w. a cool video guy. i like it thanks mn. math mind transfer, same page. n rapid pick ideas" Here's my attempt. I've substituted sounds for words with "m[a]n" and "[a]n[d]" and had to completely drop the "[we are on the] same page" to express it's cool how we're on the same wavelength.

task master AND matt parker?? like

Oh my god this is the most niche combination of my hyper-specific interests I love this

You have made me think I should watch Taskmaster.

I love taskmaster (especially series 13)! And I love 3b1b! And I'm a CS major learning C++! It's like this video was made for me omg thank you ^_^

like and supscripe for more pi content and shit i make, and i always might give a dam, k!

I got “Could information help me manage the system. A Kid died via writing Paprika snacks”

Great video, the quality from new youtubers is amazing! I saw this episode the other day and this is just great! You got yourself a new subscriber.

This seems too complicated. What we need is to spend six months writing an even more complicated program that will create a program that can quantify how to turn any task into a formula that can be programmed.