Another June problem done

problems/237/main.py

@@ -0,0 +1,35 @@
+# Definition for singly-linked list.
+class ListNode:
+    def __init__(self, x):
+        self.val = x
+        self.next = None
+
+class Solution:
+    def deleteNode(self, node):
+        """
+        :type node: ListNode
+        :rtype: void Do not return anything, modify node in-place instead.
+        """
+        node.val = node.next.val
+        node.next = node.next.next
+
+def printList(l):
+    while l is not None:
+        print(l.val, end=" ")
+        l = l.next
+
+s = Solution()
+print("Expected: 4 1 9")
+l = ListNode(4)
+node = ListNode(5)
+anode = ListNode(1)
+bnode = ListNode(9)
+anode.next = bnode
+node.next = anode
+l.next = node
+
+s.deleteNode(node)
+print("Got:", end=" ")
+printList(l)
+print("")
+        

problems/237/problem.txt

@@ -0,0 +1,27 @@
+Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.
+
+Given linked list -- head = [4,5,1,9], which looks like following:
+
+ 
+
+Example 1:
+
+Input: head = [4,5,1,9], node = 5
+Output: [4,1,9]
+Explanation: You are given the second node with value 5, the linked list should become 4 -> 1 -> 9 after calling your function.
+
+Example 2:
+
+Input: head = [4,5,1,9], node = 1
+Output: [4,5,9]
+Explanation: You are given the third node with value 1, the linked list should become 4 -> 5 -> 9 after calling your function.
+
+ 
+
+Note:
+
+    The linked list will have at least two elements.
+    All of the nodes' values will be unique.
+    The given node will not be the tail and it will always be a valid node of the linked list.
+    Do not return anything from your function.
+

problems/237/run.sh

@@ -0,0 +1,3 @@
+#!/bin/bash
+
+python3 main.py