<p>You are given the <code>head</code> of a linked list.</p>

<p>Remove every node which has a node with a greater value anywhere to the right side of it.</p>

<p>Return <em>the </em><code>head</code><em> of the modified linked list.</em></p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2022/10/02/drawio.png" style="width: 631px; height: 51px;" />
<pre>
<strong>Input:</strong> head = [5,2,13,3,8]
<strong>Output:</strong> [13,8]
<strong>Explanation:</strong> The nodes that should be removed are 5, 2 and 3.
- Node 13 is to the right of node 5.
- Node 13 is to the right of node 2.
- Node 8 is to the right of node 3.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> head = [1,1,1,1]
<strong>Output:</strong> [1,1,1,1]
<strong>Explanation:</strong> Every node has value 1, so no nodes are removed.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li>The number of the nodes in the given list is in the range <code>[1, 10<sup>5</sup>]</code>.</li>
	<li><code>1 &lt;= Node.val &lt;= 10<sup>5</sup></code></li>
</ul>

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    ListNode* removeNodes(ListNode* head) {
        ListNode* ptr=head;
        ListNode* start=head;
        ListNode*temp=head;
        vector<int>v,t;
        while(temp!=NULL ){
            v.push_back(temp->val);
            temp=temp->next;
        }
        reverse(v.begin(),v.end());
        for(int i=0;i<v.size();i++)cout<<v[i]<<" ";
        int min=v[0];
        t.push_back(min);
        for(int i=1;i<v.size();i++){
            if(v[i]>=min){
                t.push_back(v[i]);
                min=v[i];
            }    
        }
        reverse(t.begin(),t.end());
        for(int i=0;i<t.size();i++)cout<<t[i]<<" ";
        int n=t.size(),i=0;
        temp=head;
        while(temp!=NULL && i<n){
            if(t[i]==temp->val){
                if(temp!=head)ptr->next=temp;
                ptr=temp;
                if(i==0)start=temp;
                i++;
            }
            temp=temp->next;
        }
        return start;
    }
};
176538