Given two string, represented as linked lists (every character is a node->data in the linked list). Write a function compare() that works similar to strcmp(), i.e., it returns 0 if both strings are same, 1 if first linked list is lexicographically greater, and -1 if second is lexicographically greater.

**Input:**

First line of input contains number of testcases T. For each testcase, there will be 4 lines of input. First line of which contains length of first linked list and next line contains the linked list, similarly next two lines contains length and linked list respectively.

**Output:**

Comapare two strings represented as linked list.

**User Task:**

The task is to complete the function **compare**() which compares the strings through linked list and returns 0, 1 or -1 accordingly.

**Constraints:**

1 <= T <= 100

1 <= N, M <= 100

**Example:
Input:**

2

5

a b a b a

4

a b a a

3

a a b

3

a a b

**Output:**

1

0

**Explanation:
Testcase 1**: String consisting of nodes of first linked list is lexicographically greater than the second one. So, the result is 1.

Author: bhawnamait

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

codersanjeev | 66 |

snow_den_ | 60 |

BoggavarapuRamSaranSaiSrinivasGupta | 60 |

rajupraaa1234 | 53 |

SUZAKU | 49 |

mr_kksparrow | 433 |

manvirag982 | 258 |

snow_den_ | 232 |

arpit_anshuman | 228 |

SoumyaKaushik | 205 |

blackshadows | 5331 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4929 |

Quandray | 4567 |

Login to report an issue on this page.