Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6560 |

@blackshadows | 6400 |

@mb1973 | 5777 |

@Quandray | 5271 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 5074 |

@kirtidee18 | 4356 |

@sanjay05 | 3762 |

@mantu_singh | 3638 |

@gfgaccount | 3601 |

@marius_valentin_dragoi | 3525 |

Complete Leaderboard | |

Handle | Score |

@anish5256 | 991 |

@vimleshpratapsingh321 | 980 |

@skj7 | 871 |

@akhileshkumar562002 | 862 |

@pradeeppatidar1999 | 840 |

@kanewilliamson123 | 837 |

@pd420786 | 813 |

@infilooop | 800 |

@bunnybug320 | 796 |

@smitabose7826 | 784 |

@virgat | 768 |

Complete Leaderboard |

Given an array **s **containing **n **strings, find the length of the string obtained by combining the strings. Two strings can be only combined if the last character of the first string and the first character of the second string are the same.

**Example 1:**

**Input:
**n = 3
s[] = {"RBR", "BBR", "RRR"}
**Output: **9
**Explanation: **Combined string can
be: BRR + RBR + RRR

**Example 2:**

**Input:
**n = 2
s[] = {"RRR", "BBB"}
**Output: **0
**Explanation: **Since combining condition
isn't fulfilled answer is 0.

**Your Task:**

Your task is to complete the function **combine() **which takes 2 arguments(integer n and array of n strings) and returns the maximum length of combined strings possible. If no 2 strings can be combined return 0.

**Expected Time Complexity: **O(n).

**Expected Auxiliary Space: **O(1).

**Constraints:**

2<=n<=1000

1<=|s_{i}|<=1000, where 0<=i<n

s will only contain {R,B}

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

YesLoading...

Combine the strings

...