Remove len - B th node from starting
int diff = len - B ; Node * prev = NULL ; Node * curr = head ; for ( int i = 0 ; i < diff ; i ++ ) { prev = curr ; curr = curr -> next ; } prev -> next = curr -> next ; return head ; } }