There is an elitist atmosphere during hiring. You are expected to be a ninja before they hire you, rather than being given opportunities to grow after joining.

The telephonic interview bar is "crazy high," and you need to crack a hard dynamic programming problem within 30 minutes.

Cocky "kids" fresh out of college who interview you are quick to judge and reject you if you fumble in the first few minutes.

I would definitely not be comfortable working in such a hostile environment where you are constantly being judged.

Given a set of numbers in an array which represent the number of consecutive days of AirBnB reservations requested, as a host, pick the sequence which maximizes the number of days of occupancy, while also leaving at least one day as a gap between bookings for cleaning. The problem reduces to finding the maximum sum of non-consecutive array elements.

For example, consider the array [5, 1, 1, 5]. This array represents booking periods as follows:

• Dec 1 - 5 (5 days)
• Dec 5 - 6 (1 day)
• Dec 6 - 7 (1 day)
• Dec 7 - 12 (5 days)

The optimal choice is to select the reservation from Dec 1-5 (5 days) and then the reservation from Dec 7-12 (5 days), for a total of 10 days of occupancy. This leaves a gap for cleaning between the reservations.

Similarly:

• [3, 6, 4] results in 7 days of occupancy.
• [4, 10, 3, 1, 5] results in 15 days of occupancy.