2 problems I’m working on right now:

1. Evaluate $latex\sum_{k=1}^{k=n}(n-k)2^{k-1}$ by somehow interpreting the term as a sum of disjoint sets.

2. Longest possible monotonic subsequence. Fun thinking about this in terms of directed graphs.