255th Commit

README.md

@@ -289,10 +289,12 @@ Ace Coding Interview with 75 Qs
 [435]: ./src/page-5/435.%20Non-overlapping%20Intervals/eraseOverlapIntervals.ts
 [452]: ./src/page-5/452.%20Minimum%20Number%20of%20Arrows%20to%20Burst%20Balloons/findMinArrowShots.ts
 
-| Monotonic Stack         |          |        |
-| ----------------------- | -------- | ------ |
-| 739. Daily Temperatures | Solution | Medium |
-| 901. Online Stock Span  | Solution | Medium |
+| Monotonic Stack         |                 |        |
+| ----------------------- | --------------- | ------ |
+| 739. Daily Temperatures | [Solution][739] | Medium |
+| 901. Online Stock Span  | Solution        | Medium |
+
+[739]: ./src/page-7/739.%20Daily%20Temperatures/dailyTemperatures.ts
 
 </details>
 

src/page-7/739. Daily Temperatures/dailyTemperatures.test.ts

@@ -0,0 +1,23 @@
+import { dailyTemperatures } from './dailyTemperatures';
+
+describe('739. Daily Temperatures', () => {
+  test('dailyTemperatures', () => {
+    {
+      const temperatures = [73, 74, 75, 71, 69, 72, 76, 73];
+      const expected = [1, 1, 4, 2, 1, 1, 0, 0];
+      expect(dailyTemperatures(temperatures)).toStrictEqual(expected);
+    }
+
+    {
+      const temperatures = [30, 40, 50, 60];
+      const expected = [1, 1, 1, 0];
+      expect(dailyTemperatures(temperatures)).toStrictEqual(expected);
+    }
+
+    {
+      const temperatures = [30, 60, 90];
+      const expected = [1, 1, 0];
+      expect(dailyTemperatures(temperatures)).toStrictEqual(expected);
+    }
+  });
+});

src/page-7/739. Daily Temperatures/dailyTemperatures.ts

@@ -0,0 +1,20 @@
+type DailyTemperatures = (temperatures: number[]) => number[];
+
+/**
+ * Accepted
+ */
+export const dailyTemperatures: DailyTemperatures = (temperatures) => {
+  const answer: number[] = Array(temperatures.length).fill(0);
+  const stack: number[] = [];
+
+  for (let i = 0; i < temperatures.length; i++) {
+    while (stack.length > 0 && temperatures[i] > temperatures[stack[stack.length - 1]]) {
+      const index = stack.pop() as number;
+      answer[index] = i - index;
+    }
+
+    stack.push(i);
+  }
+
+  return answer;
+};