Easy JAVA O(1) space complexity solution
public ListNode removeNthFromEnd(ListNode head, int n) {\n\n        ListNode start = new ListNode(0);\n        ListNode n1 = start, n2 = start;\n        n2.next
    public ListNode removeNthFromEnd(ListNode head, int n) {\n\n        ListNode start = new ListNode(0);\n        ListNode n1 = start, n2 = start;\n        n2.next = head;\n        \n        for(int i =0;i<n+1;i++){\n            n2 = n2.next; // trying o create gab n between two pointers\n        }\n        \n        while(n2 != null){\n            n1 = n1.next;\n            n2 = n2.next;\n        }\n        \n        //time to change\n        n1.next = n1.next.next;\n        return start.next;\n    }
['Linked List', 'Two Pointers', 'Java']