SWE Interview preparation

https://leetcode.com/problems/minimum-operations-to-make-the-array-increasing/description/ You are given an integer array  nums  ( 0-indexed ). In one operation, you can choose an element of the array and increment it by  1 . For example, if  nums = [1,2,3] , you can choose to increment  nums[1]  to make  nums = [1, 3 ,3] . Return  the  minimum  number of operations needed to make   nums   strictly   increasing . An array  nums  is  strictly increasing  if  nums[i] < nums[i+1]  for all  0 <= i < nums.length - 1 . An array of length  1  is trivially strictly increasing.   Example 1: Input: nums = [1,1,1] Output: 3 Explanation: You can do the following operations: 1) Increment nums[2], so nums becomes [1,1, 2 ]. 2) Increment nums[1], so nums becomes [1, 2 ,2]. 3) Increment nums[2], so nums becomes [1,2, 3 ]. Example 2: Input: nums = [1,5,2,4,1] Output: 14 Example 3: Input: nums = [8] Output: 0   Constraints: 1 <= nums.length <= 5000 1 <= nums[i] <= 10 4 ------

https://leetcode.com/problems/the-latest-time-to-catch-a-bus/description/ You are given a  0-indexed  integer array  buses  of length  n , where  buses[i]  represents the departure time of the  i th  bus. You are also given a  0-indexed  integer array  passengers  of length  m , where  passengers[j]  represents the arrival time of the  j th  passenger. All bus departure times are unique. All passenger arrival times are unique. You are given an integer  capacity , which represents the  maximum  number of passengers that can get on each bus. When a passenger arrives, they will wait in line for the next available bus. You can get on a bus that departs at  x  minutes if you arrive at  y  minutes where  y <= x , and the bus is not full. Passengers with the  earliest  arrival times get on the bus first. More formally when a bus arrives, either: If  capacity  or fewer passengers are waiting for a bus, they will  all  get on the bus, or The  capacity  passengers with the  earliest  arrival