public void deleteNAfterMNodes(Node head,int m, int n){
        if(head == null){
            return;
        }
        while(head != null){
            int i = 0;
            while(head != null && i < m-1){
                head = head.next;
                i++;
            }
            if(head == null){
                break;
            }
            Node temp = head.next;
            i=0;
            while(temp != null && i < n){
                temp = temp.next;
                i++;
            }
            head.next = temp;
            head = temp;
        }
    }
http://www.geeksforgeeks.org/delete-n-nodes-after-m-nodes-of-a-linked-list/
Test cases:
neg value of m and/or n - not allowed
0 value of n and/or m - not allowed
even n and m
odd n and m
odd size of the list
even size of the list
src/com/interview/linklist/DeleteNAfterMNodes.java