So nice to see the unfold-based solution in F#. It's definitely my favorite so far (the Scala solution looks like the most straight forward functional approach, but this one introduces a less familiar higher order function). I love these videos, thank you.
AMAZING walkthrough! For those solutions that map to hexadecimal three character value, it would be nice if they instead mapped to six bit, since there are only four valid acids, two bit each. The very big numbers are not meaningful, to my shallow brains, but numbers 0-63 are easy enough, especially as binary.
Thanks for the video. I have been working through my #48in24 and have loved all the videos so far. If I may, I would like to offer some suggestions: * This video may need an edit to allow us that are unfamiliar with Erlang to see lines 34 through EOF. You explained it beautifully but my Erlang syntax knowledge is limited. * I loved the compile time solutions in some of the other videos. The tradeoff of larger binaries for faster runtime is exciting to me and I would love to see more of the that in the future. Maybe with languages other than nim (though nim does such a great job of it). Again, thanks for the videos. I am learning a lot of what is possible and have been falling in love with functional programming in part because of the solutions you show.
Hey! Thank you so much for the thoughtful comment and support! Really means a lot 💙 1. Sadly, we can't edit YT videos once they're published. However, the links are in the description, so hopefully you can take a look there. Sorry we messed that bit up! 2. Awesome - I know Erik really enjoyed those too, so I'm sure he'll be glad to see this and encouraged to find more!
The compile time solutions are great. Off the top of my head, Zig and C++ and languages that also support this well, a well as many languages with macros. We'll try to feature it when applicable!
Solid, enjoyable video. However, I’m missing the mention of tail recursion as explanation for the accumulator trick and lazy iteration as explanation for why “take while” can work here…
I understand, but we have only limited time in these videos so we can't go into everything. That said, our next video (list-ops) will feature tail recursion.
Unfortunately the exercise was just added to the Prolog track, so we couldn't feature it, but I love how Prolog allowed me to solve this exercise: exercism.org/tracks/prolog/exercises/protein-translation/solutions/ErikSchierboom
I think the Scala solution violates the principle of `map`, as it is not meant to be used with a partial function. Using `collect` would be more appropriate, or better, adding a default case returning "STOP".
So nice to see the unfold-based solution in F#. It's definitely my favorite so far (the Scala solution looks like the most straight forward functional approach, but this one introduces a less familiar higher order function). I love these videos, thank you.
Awesome. Really glad you're enjoying them! I liked the F# one too - Erik's code always impresses me :)
Thank you for the recursion in this video! ❤
We love a bit of recursion! 💙
You're in luck, as we'll have more recursion in our next video!
@@ErikSchierboom 🥳🎉
AMAZING walkthrough!
For those solutions that map to hexadecimal three character value, it would be nice if they instead mapped to six bit, since there are only four valid acids, two bit each. The very big numbers are not meaningful, to my shallow brains, but numbers 0-63 are easy enough, especially as binary.
Thanks for the video. I have been working through my #48in24 and have loved all the videos so far.
If I may, I would like to offer some suggestions:
* This video may need an edit to allow us that are unfamiliar with Erlang to see lines 34 through EOF. You explained it beautifully but my Erlang syntax knowledge is limited.
* I loved the compile time solutions in some of the other videos. The tradeoff of larger binaries for faster runtime is exciting to me and I would love to see more of the that in the future. Maybe with languages other than nim (though nim does such a great job of it).
Again, thanks for the videos. I am learning a lot of what is possible and have been falling in love with functional programming in part because of the solutions you show.
Hey! Thank you so much for the thoughtful comment and support! Really means a lot 💙
1. Sadly, we can't edit YT videos once they're published. However, the links are in the description, so hopefully you can take a look there. Sorry we messed that bit up!
2. Awesome - I know Erik really enjoyed those too, so I'm sure he'll be glad to see this and encouraged to find more!
The compile time solutions are great. Off the top of my head, Zig and C++ and languages that also support this well, a well as many languages with macros. We'll try to feature it when applicable!
Solid, enjoyable video. However, I’m missing the mention of tail recursion as explanation for the accumulator trick and lazy iteration as explanation for why “take while” can work here…
I understand, but we have only limited time in these videos so we can't go into everything. That said, our next video (list-ops) will feature tail recursion.
Glad you enjoyed it! :)
Unfortunately the exercise was just added to the Prolog track, so we couldn't feature it, but I love how Prolog allowed me to solve this exercise: exercism.org/tracks/prolog/exercises/protein-translation/solutions/ErikSchierboom
❤
I think the Scala solution violates the principle of `map`, as it is not meant to be used with a partial function. Using `collect` would be more appropriate, or better, adding a default case returning "STOP".
❤
💙
I feel so dumb after reading some of the solutions to this. I guess I'm a long way from advanced programming.
Getting good at something is about learning. Every time you come across something you didn't know you just learnt and levelled up! :)