EarliestPossibleDayOfFullBloom.java

class Solution {
	// TC : O(nlogn)
	// SC : O(n)/ O(1)
	public int earliestFullBloom(int[] plantTime, int[] growTime) {
		List<Seed> plant = new ArrayList<>();
		for(int i=0;i<plantTime.length;i++){
			plant.add(new Seed(plantTime[i], growTime[i]));
		}

		// GO for the one with max Growth Time
		Collections.sort(plant, (a,b) ->(b.growTime - a.growTime));

		int time=0;
		int max=0;
		//plant max grow time first and keep track of max time it can take
		for(int i=0;i<plantTime.length;i++){
			time += plant.get(i).plantTime;
			max = Math.max(max,time+plant.get(i).growTime);
		}
		return max;
	}


	private class Seed{
		int plantTime;
		int growTime;

		public Seed(int p, int g){
			this.plantTime = p;
			this.growTime = g;
		}
	}
}