/* You will be given N strings.You have to create a circular linked list and then insert the given strings into it. After Insertion, You have to traverse the complete circular linked list using a starting node. You will be provided with a string denoting the starting node. Input Format First line will contain an integer n. Each of the Next n lines will contain a string. Next line will contain a string S denoting the starting Node for traversal. Constraints 1 <= N <= 10^3 1 <= |S| <= 10^3 Output Format You have to traverse the circular linked list and print content of each node separated by space starting from the given string S. Sample TestCase 1 4 varun monti arpit ashutosh arpit output arpit ashutosh varun monti */ #include using namespace std; #include using namespace std; struct node { string data; node* next; node(string data) : data(data),next(nullptr){} }; node* head = nullptr; node* tail = nullptr; void addNodeAtEnd(string& str) { node* newnode = new node(str); if(head==nullptr)//first node { head = newnode; tail = newnode; newnode->next = head; } else // next nodes at end { tail->next = newnode; tail = newnode; tail->next = head; } } void printCircularLinkedList(node* root) { node* cur = root; if(head==nullptr) { cout << "Empty list" << endl; return; } else { int cnt = 0; do { if(cnt==0) cout << cur->data; else cout << " " << cur->data; cur = cur->next; ++cnt; }while (cur!=root); } } node* findNode(string data) { if(head==nullptr)//empty list return nullptr; if(head->data==data) return head; node* cur = head; while(cur->data!=data) { cur = cur->next; } return cur; } int main() { int N; cin >> N; string str; for(int i=0;i> str; addNodeAtEnd(str); } //Name to start with cin >> str; node* nodeToStart = findNode(str); printCircularLinkedList(nodeToStart); return 0; }

Challenge [Circular single link list]