Remove Nodes From Linked List - LeetCode 2487 - Python Solution Code Answer and Explanation 

here is iteratively class Solution: def removeNodes(self, head: Optional[ListNode]) -> Optional[ListNode]: # reverse the list pre, cur = None, head while cur: temp = cur.next cur.next = pre pre = cur cur = temp # remove the node that is less than the max(greater value to the right) head = pre cur = pre.next max = pre.val while cur: if cur.val < max: pre.next = cur.next cur.next = None cur = pre.next else: max = cur.val pre = cur cur = cur.next # reverse the list again pre, cur = None, head while cur: temp = cur.next cur.next = pre pre = cur cur = temp return pre

MASTER data structures and algorithms with this course - bit.ly/algoskillsyt

Interesting but can you do it iteratively?

public class Solution { public ListNode RemoveNodes(ListNode head) { ListNode current = head; ListNode l = current; ListNode r = current.next; ListNode prev = null; ListNode dummy = new ListNode(0); dummy.next = current; while(current != null) { while(l != null && r != null) { if(l.val