Blog

Given a Singly Linked-List, implement a method to delete the node that contains the same data as the input data. Example: delete(1->2->3->4,3) ==> 1->2->4 class SinglyLinkedList: #constructor def __init__(self): self.head = None #method for setting the head of the Linked List def setHead(self,head): self.head = head #method for deleting a node having a certain dataRead more

This is an implementation of a singly linked list merge sort I did on paper during a job interview recently, using a bottom-up approach. The requirement was simply “implement a merge sort for a singly linked list whose last node is indicated by a null value in its next pointer. An empty list is simplyRead more

Hello and Good day to you, I got some assignment in programming using java. So the task is about a marble game, so when you entering a marble the marble has a color and value, when there’s 4 same color in row it will “gone” and the value will be calculated well it like ZumaRead more