I hope you had a great week! I was on vacation with my sister and friends myself and am ready to get back to it. Onwards!
Was this forwarded to you? You can subscribe here!
It was so fun having vacation time with my sister and friends this week! I read more of my book that I’ve been neglecting (Atomic Habits), started another one (Dark Matter), and played a lot of Boggle. What more could ya want?
The ReadME Project is part of GitHub’s ongoing effort to amplify the voices of the developer community. In our Guides series, expert developers and teams discuss topics from trending technologies to best practices in software engineering, collaboration, and culture.
Whether you’re interested in a new framework or want to hear from the maintainer of your favorite OSS project, you’re sure to learn something new!
Check-out the The ReadME Project Guides.
This week’s question:
Given an array of integers, find the length of the longest sub-sequence such that elements in the sub-sequence are consecutive integers, the consecutive numbers can be in any order.
$ longestSubSeq([1, 9, 87, 3, 10, 4, 20, 2, 45]) $ 4 // 1, 3, 4, 2 $ longestSubSeq([36, 41, 56, 35, 91, 33, 34, 92, 43, 37, 42]) $ 5 // 36, 35, 33, 34, 37
The Koibloom 40%
Wooden Apple Sculptures by Yosuke Amemiya Melt Into Succulent Puddles
Meet the Woman Preserving the History of Oregon’s Black Loggers
Peter Rofé, LA Phil Bassist covers “Every Breath You Take” by The Police
Why didn’t the sun go to college?
Because it already has thousands of degrees!
That’s all for now, folks! Have a great week. Be safe, make good choices, and stop planning, start acting!
Special thanks to Gabor, Stephen, IceSloth, Emad, Alaska, Josh, Conor, Ezell, Pedro, Karthic, Ximena, Paige, Zev, Sebastián, and Ben for supporting my Patreon and this newsletter!
website | twitter | patreon | github | twitch | codepen | polywork