Відео

Oh 1080p!! Thank you!

Hello Wekoslav. you seems to be a very good developer and someone where it´s possible to learn a lot from but the quality of your video unfortunately makes this ability disappear. the proble isn´t that it´s just 480p. the probles is more that it´s more like a diashow or just running in like 10fps. i don´t know which recording tool you use but i recemmond you to change it or to work on the setting to get rid of these. anyways i´ll give you a like because you seems to be a nice guy and i hope you´ll grow to be able to reach more people and to help more people on they´re way. enjoy it. :)

this is the best video ever

Najdobre si bratle

You do what takes me a couple hours in minutes. I love watching you solve the problem though. Thank you for recording and sharing!

You are so smart! I wish i code like you. Cheers from Brazil.

Add metal music as a sound effect each time you say "brute force \m/" :D

Happy to see that you are finishing up the serie

It was something really good I saw after quite a while. I'm gonna stick around.

The part 2 was really a wake up call for me, that I need to really significantly improve in programming, because I didn't even think of oneight 18, actually lost for words. You are a great programmer.

Shoelace theorem.

hm, I did not have an offset I am pretty mad that it's ambiguous that every starting element only ever went over the same "element with last char being Z" and not any other, and not in random cycles I don't think "curious fact: the number of nodes with names ending in A is equal to the number ending in Z!" tells us enough to be of any value I dislike the fact that it's more of a cat and mouse, finding out that each element ever only went over the same element ending with Z and all of the starting ones had one for itself I think that should've been written in the task I tried to solve it by thinking that every every starting element can go in random cycles over many elements that end with Z, now that would be problematic to solve and it's still in line with the tasks problem explanation

Very happy to see that, for once, our solutions are very similar. Means I understood the problem.

Very nicely explained, backed with an example. Thanks Weko 😊

Nice one! I really enjoyed watching your explanation ;)

clever solution! looking forward for part2!

great explanation

My brute-force Rust solution ran in 9 minutes. Watching this because I'm curious how to optimize the solution without making it ludicrously complicated

Found this channel by chance, as a computer science student this is amazing to watch, I appreciate your efforts to record it and share it online.

You can watch the optimization of the second part here: ua-cam.com/video/JtKQ44qzzhQ/v-deo.html

I recognise that shirt! Hi from a fellow Geek! :)

Love you :-D. #1 subs provider -> "PromoSM"!!

Круто!

Why don't you finish day 7? BTW your explanations for the puzzles are extremely good.

Are you going to post Day 07? I have problem with that, actually I get proper result from example but not from the input data :/

I am just starting with JS and I only got very little of what you're doing , but your videos are satisfying to watch. Keep it up

Awesome Explaination !! Can typescript be used for industry scale applications ?

So quirky

🙋 P r o m o S M!!!

I'm happy that I finally found an explanation that I understand. Thanks for working it out in detail, it helped me a lot!

45:42 tip: In notepad++, if you hold ctrl+shift you can move 1 or more lines up and down with the arrow keys. No need to copy-paste :)

Thanks for sharing your solution!

Very nice explanation of this problem! You got a good way of explaining things. I am not familiar with ts, but it was easy to follow and makes this problem way better to understand. Thanks!

gods code kudos

For the first we can search near the median for the target value. As for the second one, I used mean and it worked, but don't know why though- My Haskell Solution- {-# LANGUAGE OverloadedStrings #-} import Data.List (sort) import Data.Maybe (fromMaybe) import qualified Data.Text as T import System.IO (hFlush, stdout) prompt :: String -> IO String prompt text = do putStr text hFlush stdout getLine -- O(n lg n) median :: (Ord a, Num a, Fractional a) => [a] -> Maybe a median [] = Nothing median xs = Just $ if even l then ((xs' !! l') + (xs' !! (l' + 1))) / 2 else xs' !! l' where l = length xs l' = div l 2 xs' = sort xs mean :: (Num a, Fractional a) => [a] -> Maybe a mean [] = Nothing mean xs = Just (sum xs / fromIntegral (length xs)) costs :: Num a => (a -> a -> a) -> [a] -> a -> [a] costs costFn xs y = [costFn x y | x <- xs] cost :: Num a => (a -> a -> a) -> [a] -> a -> a cost costFn xs = sum . costs costFn xs solver :: (Ord a, Num a) => (a -> a -> a) -> [a] -> [a] -> a solver costFn xs ys = minimum [cost costFn xs y | y <- ys] solvePart1 :: [Int] -> Int solvePart1 xs = solver (\x y -> abs (x - y)) xs xs solvePart1' :: [Int] -> Int solvePart1' xs = solver (\x y -> abs (x - y)) xs [tgt - 1, tgt, tgt + 1] where tgt = floor . fromMaybe 0.0 . median $ map fromIntegral xs sum1ToN :: Int -> Int sum1ToN n = div (n * (n + 1)) 2 solvePart2 :: [Int] -> Int solvePart2 xs = solver (\x y -> sum1ToN (abs (x - y))) xs [minimum xs .. maximum xs] solvePart2' :: [Int] -> Int solvePart2' xs = solver (\x y -> sum1ToN (abs (x - y))) xs [tgt - 1, tgt, tgt + 1] where tgt = floor . fromMaybe 0.0 . mean $ map fromIntegral xs main :: IO () main = do filename <- prompt "Enter file name: " nums <- map (read . T.unpack) . T.splitOn "," . T.pack <$> readFile filename let part1Ans = solvePart1 nums part1Ans' = solvePart1' nums part2Ans = solvePart2 nums part2Ans' = solvePart2' nums putStrLn $ "Part1: " ++ show part1Ans putStrLn $ "Part1 (Another Solution): " ++ show part1Ans' putStrLn $ "Part2: " ++ show part2Ans putStrLn $ "Part2 (Another Solution): " ++ show part2Ans'

Keep the good work !👌

Во првата задача ако во инпутот во првите броеви има 1010 ќе добиеш грешка резултат.