PraveenKishore

/* https://www.hackerrank.com/challenges/reverse-a-linked-list
  Reverse a linked list and return pointer to the head
  The input list will have at least one element  
  Node is defined as 
  struct Node
  {
     int data;
     struct Node *next;
  }
*/

PraveenKishore

/* 
  https://www.hackerrank.com/challenges/merge-two-sorted-linked-lists
  Merge two sorted lists A and B as one linked list
  Node is defined as 
  struct Node
  {
     int data;
     struct Node *next;
  }
*/

PraveenKishore

/*
  Reference: https://www.hackerrank.com/challenges/delete-duplicate-value-nodes-from-a-sorted-linked-list
  Remove all duplicate elements from a sorted linked list
  Node is defined as 
  struct Node
  {
     int data;
     struct Node *next;
  }
*/

PraveenKishore

// Use Gists to store code you would like to remember later on
console.log(window); // log the "window" object to the console