I hope you had a good week! I was out of town seeing family and it was wonderful and much-needed.
Was this forwarded to you? You can subscribe here!
Because I was out with family this week, I got some very needed relaxation time where I got to catch up on some shows (…I’m deep in The Circle S4, it’s spicy) and play many games of Settlers of Catan (I am the queen of bricks)! I’ll be back at it this week. I’ve got an AMA with the COSS Community this week if you’d like to join in! Speaking of open source (COSS stands for Commercial Open Source Software, by the way), I talked about it a bit on the Stack Overflow podcast this week too, if you’d like to listen in!
Explore topics from space travel to filmmaking on The ReadME Project.
Last week, I had you find an array of maximums. Great job Matteo, Daniel, Jack, Karey, Phillip, Dan, Ben, Kelvin, Leyan, Johannes, Amine, Gabor, Olumide, Dan, Giovanni, Hristiyan, Divyansh, Wayne, Phil, Les, Gülşah, Enrique, Rafael, Chin, Will, Ten, Joe, Jorge, and Don!
This week’s question:
m matrix where all of the units are 0s except for an
1 for “start”, a
2 for “end”, and
3s for walls, find the shortest paths that you can take to get from
2, while working around
let grid = [ [1,0,0], [0,0,2] ] let grid2 = [ [1,3,0], [0,0,2] ] $ startToEnd(grid) $ [['right', 'right', 'down'], ['right', 'down', 'right'], ['down', 'right', 'right']] $ startToEnd(grid2) $ [['down', 'right', 'right']]
What programming language does IKEA use?
That’s all for now, folks! Have a great week. Be safe, make good choices, and take a walk!
Special thanks to Gabor, Stephen, IceSloth, Alaska, Josh, Conor, Ezell, Pedro, Karthic, Ximena, Paige, Zev, Sebastián, Ben, and Sema for supporting my Patreon and this newsletter!
website | twitter | patreon | github | twitch | codepen | polywork