Alright, this Thrashing Code Metal Monday is going hard core sideways, with something a little different.
Next up is a another kick ass band with Bad Brains. Get a taste of early stuff and later material, like one I dig is Rise. There’s a bunch of other tunes that are spastic and frantic as you need. Throw around and check them out.
For the last two bands gonna dive in hard core to some local bands that’ll ruffle the feathers. Get woke, thrashed, and don’t brick your code.
Now that you’re awake. I’m going to throw out an extremely easy challenge this week. I’ll also be posting the winning victory prize via @Adron if you’re game to post a repo with your solution in your preferred language.
Given an unsorted array of integers, find the length of longest continuous increasing subsequence.
Explanation: The longest continuous increasing subsequence is [1,3,5], its length is 3.
Even though [1,3,5,7] is also an increasing subsequence, it’s not a continuous one where 5 and 7 are separated by 4.
Explanation: The longest continuous increasing subsequence is , its length is 1.
Also, I’ll be posting a link list of code challenges and answers I’ve posted on subsequent Thrashing Code Metal Monday posts. So answers are forthcoming, the first code challenge was just a bit bigger than I’d originally expected (it’s taken me a couple of days to finally write it all up!)