SDE - 1

You are given a certain format of books and their authors.

For example -

NameOfAuthor1 Book1 Book2

NameOfAuthor2 Book1

Your task is to print the given information in the following manner:

1. NameOfAuthor1

    A. Book1

    B. Book2

2. NameOfAuthor2

    A. Book1

You are given a 2D array of strings ‘S’ where each vector is the information about the i-th author, the first index of this vector is the ‘NameOfAuthor’ and the other indexes are the ‘Books’ written by the author. You are supposed to print the Authors and their books in the above mentioned format.

You have been given a linked list of integers. Your task is to write a function that deletes a node from a given position, 'POS'.

Note :

Assume that the Indexing for the linked list always starts from 0.

If the position is greater than or equal to the length of the linked list, you should return the same linked list without any change.

Illustration :

The following images depict how the deletion has been performed.

Image-I :

Image-II :

You are given a graph with 'N' vertices numbered from '1' to 'N' and 'M' edges. You have to colour this graph in two different colours, say blue and red such that no two vertices connected by an edge are of the same colour.

Note :

The given graph may have connected components.