<p>Given an array of integers <code>temperatures</code> represents the daily temperatures, return <em>an array</em> <code>answer</code> <em>such that</em> <code>answer[i]</code> <em>is the number of days you have to wait after the</em> <code>i<sup>th</sup></code> <em>day to get a warmer temperature</em>. If there is no future day for which this is possible, keep <code>answer[i] == 0</code> instead.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> temperatures = [73,74,75,71,69,72,76,73]
<strong>Output:</strong> [1,1,4,2,1,1,0,0]
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> temperatures = [30,40,50,60]
<strong>Output:</strong> [1,1,1,0]
</pre><p><strong class="example">Example 3:</strong></p>
<pre><strong>Input:</strong> temperatures = [30,60,90]
<strong>Output:</strong> [1,1,0]
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;=&nbsp;temperatures.length &lt;= 10<sup>5</sup></code></li>
	<li><code>30 &lt;=&nbsp;temperatures[i] &lt;= 100</code></li>
</ul>

class Solution {
public:
    vector<int> dailyTemperatures(vector<int>& dailyTemps)
    {
        int len = dailyTemps.size(); // Length of the input vector
        std::stack<int> stk;         // Stack to store indices of temperatures
        stk.push(len - 1);           // Initialize the stack with the last index
        std::vector<int> resultVec(len); // Vector to store the result
    
        // Traverse the array from right to left (penultimate element)
        for (int i = len - 2, currTemp; i >= 0; --i)
        {
            currTemp = dailyTemps[i]; // Current temperature
        
            // Remove elements from the stack while the current temperature is greater or equal to the temperature at the index on top of the stack
            while (!stk.empty() && currTemp >= dailyTemps[stk.top()])
                stk.pop();

            // If the stack is not empty, calculate the difference between indices to find how many days until a warmer day
            if (!stk.empty()) resultVec[i] = stk.top() - i;

            // Push the current index to the stack
            stk.push(i);
        }

        return resultVec;
    }
};

98760