I hope your week was a good one! Mine was fairly busy with housework, but no complaints about that. Let’s goooo!
Was this forwarded to you? You can subscribe here!
This week was a week of catching up on some projects that I’ve been putting off for a while. I didn’t actually finish any of them, BUT the fact that I’ve had progress is really motivating for me!
Also, I started reading Deep Work by Cal Newport, which has been interesting. I admit I was skeptical about it at first (I figured it would be just, “stop being distracted, Cassidy, you don’t need to scroll Twitter so much, the end,” which is… partially accurate), but it’s been interesting to think about how we view work as a society and how we should change our mindsets around it. Not sure if I’ll recommend it to everyone yet (it’s… almost entirely men-focused examples, and it definitely comes from a privileged perspective), but it helped motivate some of my project work this week, so I’ll take it.
Teleport is the easiest, most secure way to access all your infrastructure. The open-source Teleport Access Plane consolidates the four essential infrastructure access capabilities every security-conscious organization needs: connectivity, authentication, authorization, and audit.
By consolidating all aspects of infrastructure access into a single platform for software engineers and the applications they write, Teleport reduces attack surface area, cuts operational overhead, easily enforces compliance, and improves productivity. The Teleport Access Plane replaces VPNs, shared credentials, and legacy privileged access management technologies, improving security and engineering productivity. Learn more at goteleport.com!
Last week, I had you hide email addresses. Great job Aodhan, Phil, Jesper, Nicole, Philip, Pranav, Robin, Saad, Jagadish, Ten, Jack, Kelvin, Miguel, Leyan, Amine, Connor, Joel, Divyansh, Andrew, Les, Don, Constant, Brett, Ivana, and Hristiyan!
This week’s question:
Given two arrays
B, return the indices at which the two arrays intersect. If the two arrays have no intersection at all, return
null. Extra credit: how would you change your code if they were linked lists instead of arrays, if the input were the two head nodes, and you returned the intersection node?
let listA = [1,4,5,6] let listB = [2,3,4,5,6] > findIntersection(listA, listB) > [1, 2]
(see this diagram if it helps you visualize it)
What do you call a Dragon that failed medical school?
That’s all for now, folks! Have a great week. Be safe, make good choices, and do that thing you care about!
Special thanks to Gabor, Stephen, IceSloth, Alaska, Josh, Conor, Ezell, Karthic, Ximena, Paige, Zev, Sebastián, Ben, Sema, Kinetic Labs, and Vadim for supporting my Patreon and this newsletter!
website | twitter | patreon | github | twitch | codepen | polywork