Translation:
First problem: Loading... … -Linux-Find-Command
Second problem:
OOD: Design the game Battleship
Third problem:
You need a score above 150 to view the following content.
“”"
We have n jobs, where every job is scheduled to be done from startTime[i] to endTime[i], earning a profit of profit[i].
Given the startTime, endTime, and profit arrays, please return the maximum profit
you can obtain, such that no two jobs in the selected subset overlap in time.
If you choose a job that ends at time X, you will be able to start another job that begins at time X.
Examples:
Input: startTime = [1,2,3,3], endTime = [3,4,5,6], profit = [50,10,40,70]
Output: 120
Explanation: The selected subset includes the first and fourth jobs.
Time range [1-3] + [3-6] , yielding a profit of 120 = 50 + 70.
Input: startTime = [1,1,1], endTime = [2,3,4], profit = [50,60,40]
Output: 60
Input: startTime = [1,3,4,6], endTime = [3,10,6,9], profit = [20,100,70,60]
Output: 150
Explanation: The selected subset includes the first, third, and fourth jobs.
Total profit achieved is 150 = 20 + 70 + 60.
1 - 2 - 3 - 4 - 5 - 6 - 7 - 8 - 9 - 10
—20—
--------------100-------------
—70----
------60----
“”"
System Design:
Design TinyURL
The most challenging part at Amazon is always the BQ questions, as they are included in every round, and there’s even a entire round dedicated entirely to BQs… Thankfully, I’ve made it through.
Ready to accept the offer. I’m wondering if anyone is part of an Amazon group in the Bay Area who could add me? I would prefer to communicate privately, thank you!
The above content is collected through the Internet, translated and processed by GPT.