Determine if a given array of numbers can be divided into two subsets with equal sums. Essentially, can you split the array so both sides add up to the same value?

Determine if removing a single element from an array can make the remaining elements strictly increasing. You need to check if it's possible to obtain a strictly increasing sequence by deleting at most one element.

Design a data structure that acts as a Least Recently Used (LRU) cache. Implement methods to get and put key-value pairs, evicting the least recently used entry when the cache is full.