Input: linkedList = [1]

Output: []

Explanation:

Note that the value of head is null here.

","example3":"

Input: linkedList = [7, 8]

","constraints":"

1 <= number of nodes in the Linked List <= 1000
0 <= ListNode.val <= 100

","misc":{"tags":["McKinsey & Company","ARM","Oracle","Bloomberg","Goldman Sachs","Salesforce","Texas Instruments","IBM","Databricks","Riot Games","Ubisoft","Stripe","PwC","Red Hat","Flipkart","DoorDash","NVIDIA","JPMorgan Chase","Philips Healthcare","Micron Technology","Dropbox","Broadcom","Airbnb","Western Digital","Johnson & Johnson","TCS","Cognizant","Accenture","Infosys","Capgemini","Wipro"],"facts":"","hints":[{"hint":"If the list is empty (head == None), return None. If there is only one node (head.next == None), removing the tail leaves an empty list, so return None."},{"hint":"Traverse to the last node (tail), which is the node where next == None. Update the second last node’s next = None to remove the tail. Return the updated head of the list."}],"language":["cpp","java","python","javascript","csharp","go"],"topicTags":["Linked List","Hash Table"],"difficulty":"Easy","similarProblems":[{"name":"Deletion of the head of LL","slug":"/deletion-of-the-head-of-ll","isPaid":false},{"name":"Deletion of the Kth element of LL","slug":"/deletion-of-the-kth-element-of-ll","isPaid":false},{"name":"Delete the element with value X","slug":"/deletion-of-the-tail-of-ll","isPaid":false}],"frequently_occuring_doubts":[{"answer":"To update the second last node’s next to None, correctly removing the tail.","question":"Why do we need to traverse to the second last node instead of directly removing the last node?"},{"answer":"No, removing the head requires updating head.next and its prev pointer.","question":"Can we use the same logic for removing the head node?"}],"interview_followup_questions":[{"answer":"Update prev.next and next.prev to unlink the node.","question":"How would you modify this to remove a node from the middle of the list?"},{"answer":"Store the removed node in a temporary variable before modifying pointers.","question":"How would you modify this to return the deleted node instead of just updating the list?"}]},"editorial":[{"name":"Solution","asset_id":"E5MHmUzAbxu","editorial":"$1c"}],"hasGamification":1,"gamificationOptions":["[7, 8]","[8]","[7]","[8, 7]"],"testcases":[{"inputs":{"linkedList":"[1, 2, 3]"}},{"inputs":{"linkedList":"[1]"}}],"publicCpp":"/*\nDefinition of singly linked list:\nclass ListNode{\n public:\n int data;\n ListNode *next;\n ListNode() : data(0), next(nullptr) {}\n ListNode(int x) : data(x), next(nullptr) {}\n ListNode(int x, ListNode *next) : data(x), next(next) {}\n};\n*/\n\nclass Solution {\n public:\n ListNode* deleteTail(ListNode* &head) {\n //your code goes here\n }\n};","publicJava":"/*\nDefinition of singly linked list:\nclass ListNode{\n public int data;\n public ListNode next;\n ListNode() { data = 0; next = null; }\n ListNode(int x) { data = x; next = null; }\n ListNode(int x, ListNode next) { data = x; this.next = next; }\n}\n*/\n\nclass Solution {\n public ListNode deleteTail(ListNode head) {\n //your code goes here\n }\n}","publicPy":"# Definition of singly linked list:\n# class ListNode:\n# def __init__(self, x=0, next=None):\n# self.data = x\n# self.next = next\n\nclass Solution:\n def deleteTail(self, head):\n \"\"\"\n :type head: Optional[ListNode]\n :rtype: Optional[ListNode]\n \"\"\"","publicJs":"/*\nDefinition of singly linked list:\nclass ListNode{\n constructor(x, next){\n this.data = x;\n this.next = next;\n }\n}\n*/\n\n/**\n * @param {ListNode} head\n * @return {ListNode}\n */\n\nclass Solution {\n deleteTail(head) {\n //your code goes here\n }\n}","publicCsharp":"/*\nDefinition of singly linked list:\nclass ListNode{\n public int data;\n public ListNode next;