HACKERRANK delete-node-ll Solution

| August 22, 2016

The correct, optimal and working solution for programming question delete-node-ll on hackerrank

/*
 *  Author: Arpit Bhayani
 *  http://arpitbhayani.me
 */
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <climits>
#include <deque>
#include <iostream>
#include <list>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>

#define ll long long

#define MIN(a, b) a < b ? a : b
#define MAX(a, b) a > b ? a : b

using namespace std;

int readline(char *str) {
    int i = 0;
    char ch;
    while((ch = getchar()) != '\n') {
        str[i++] = ch;
    }
    str[i] = '\0';
    return i;
}

struct Node {
    int data;
    struct Node *next;
};

void Print(struct Node *head) {
    struct Node *p = head;
    while(p) {
        printf("%d\n", p->data);
        p = p->next;
    }
}

struct Node * new_node(int v) {
    struct Node * p = (struct Node *) calloc(1, sizeof(struct Node));
    p->data = v;
    return p;
}

struct Node * Delete(struct Node *head, int position) {
    struct Node * p = head;

    if(position == 0) {
        head = head->next;
        return head;
    }

    while(--position) {
        p = p->next;
    }
    p->next = p->next->next;
    return head;
}

int main(int argc, char *argv[]) {
    struct Node * head = new_node(3);
    head->next = new_node(4);
    Print(head);
    head = Delete(head, 1);
    Print(head);
    return 0;
}