The Google coding interview was challenging but well-structured.

I was asked to solve several algorithmic problems and write code on a shared screen.

The interviewer was friendly and helpful.

Overall, it was a great learning experience.

We have n jobs. Every job is scheduled to be done from startTime[i] to endTime[i], obtaining a profit of profit[i].

You're given the startTime, endTime, and profit arrays. Return the maximum profit you can take such that there are no two jobs in the subset with overlapping time ranges.

If you choose a job that ends at time X, you will be able to start another job that starts at time X.