Insert a Node at the Tail of a Linked List HackerRank Solution.

Insert a Node at the Tail of a Linked List HackerRank Solution. You are given the pointer to the head node of a linked list and an integer to add to the list. Create a new node with the given integer. Insert this node at the tail of the linked list and return the head node of the linked list formed after inserting this new node. The given head pointer may be null, meaning that the initial list is empty.

Delete duplicate-value nodes from a sorted linked list Java (HackerRank)

Delete duplicate-value nodes from a sorted linked list Java. You're given the pointer to the head node of a sorted linked list, where the data in the nodes is in ascending order. Delete as few nodes as possible so that the list does not contain any value more than once. The given head pointer may be null indicating that the list is empty.

Insert a node at the head of a linked list in Java HackerRank.

Insert a node at the head of a linked list in Java

Static files and URL’s handling in Django

Django has changed the way of handeling URL's and static files like CSS, JavaScript ( Js ) and images in the field of web development. Developers now can experiment a lot with dynamic url's while using Django as the backbone for their website.

Loss Functions in Machine Learning

Machine learns by loss function. The Loss function is a method of assessing how accurately algorithm models the given data. Optimization problem use loss functions for minimizing errors. One of the most widely used losses functions is Mean Square Error (MSE) and Minimum Absolute Error (MAE). In this article, we’ll see these two loss functions in detail.