You are organizing a set of training sessions for employees. Each session has a start time, an end time, and awards a certain number of skill points. Employees cannot attend overlapping sessions. Your task is to maximize the total skill points obtained by selecting a set of non-overlapping sessions.
- Describe an algorithm that runs in \( O(n) \) time. Must be in O(n) time, not O(nlogn)