Hello friends!
I hope you've had a great week! My friends and I went to a pumpkin patch/corn maze this past weekend, which was a pretty fun time. Onwards!
I have a ton of workshops coming up for work as we kick off the ! I'm currently on the east coast about to do my last training of October before the November tour begins. Teaching has been really fun, which I can say with confidence now that I have a few workshops under my belt! I really enjoy seeing people get those "ah ha" moments as they understand new things.
With this gig, I've had a lot of time to code on side projects to practice concepts that I'm teaching (and come up with answers to issues that students might run into over time). I finally have a little , which I haven't had in a while! Well, I should say, I have a streak, but then this weekend I took a little coding break and played Minecraft with instead. :)
find the length of the longest increasing subsequence. , , , , , , , , , , and did a great job in various languages!
This week's question:
Example:
> missingInts([1, 3, 3, 3, 5, 6])
> 2, 4
> missingInts([1, 2, 3, 4, 4, 7, 7])
> 5, 6
My friends say I'm the cheapest person they've ever met, but I'm not buying it!
That's all for now, folks!
,
cassidoo
| | | |