Statistics

Problem Statement for "MakeTwoConsecutive"

Problem Statement

Definition: a string is beautiful if it has two consecutive equal characters. Examples of beautiful strings are "KEEP", "ZZZZZ" and "TTORR", while the following are not beautiful: "A", "GH" and "ABCABCBX".


You are given the String S and you are going to remove exactly one character from S. Is it possible that the new string will be beautiful? If yes, return "Possible". Otherwise, return "Impossible".


Note that the return value is case-sensitive.

Definition

Class:
MakeTwoConsecutive
Method:
solve
Parameters:
String
Returns:
String
Method signature:
String solve(String S)
(be sure your method is public)

Constraints

  • S will contain between 1 and 50 characters, inclusive.
  • Each character in S will be an uppercase English letter: 'A' - 'Z'.

Examples

  1. "VIKING"

    Returns: "Possible"

    You can remove 'K' to obtain the string "VIING". This string is beautiful because it has two consecutive 'I'.

  2. "BCAB"

    Returns: "Impossible"

    You can only get one of the following strings: "CAB", "BAB", "BCB" and "BCA". None of these are beautiful, so the answer is "Impossible".

  3. "XX"

    Returns: "Impossible"

    After removing one character you will get the string "X" that isn't beautiful. Please note that you have to remove exactly one character.

  4. "A"

    Returns: "Impossible"

    After removing one character you will get the empty string "". It isn't beautiful.

  5. "AABB"

    Returns: "Possible"

    You can get either "ABB" or "ABB". Both these strings are beautiful.

  6. "QWERTYY"

    Returns: "Possible"

    There are a few beautiful strings you can get. Some of them are "WERTYY" and "QWETYY".

  7. "ITHINKYOUAREAHUMAN"

    Returns: "Impossible"

  8. "BOB"

    Returns: "Possible"

  9. "Z"

    Returns: "Impossible"

  10. "AB"

    Returns: "Impossible"

  11. "FF"

    Returns: "Impossible"

  12. "YYZ"

    Returns: "Possible"

  13. "YZZ"

    Returns: "Possible"

  14. "ROR"

    Returns: "Possible"

  15. "ABC"

    Returns: "Impossible"

  16. "ABAB"

    Returns: "Possible"

  17. "ABAC"

    Returns: "Possible"

  18. "ABDC"

    Returns: "Impossible"

  19. "ABCA"

    Returns: "Impossible"

  20. "ABCB"

    Returns: "Possible"

  21. "OOO"

    Returns: "Possible"

  22. "OOAB"

    Returns: "Possible"

  23. "ABOO"

    Returns: "Possible"

  24. "OAOO"

    Returns: "Possible"

  25. "OAAO"

    Returns: "Possible"

  26. "AAAAA"

    Returns: "Possible"

  27. "AAAAB"

    Returns: "Possible"

  28. "KSZHKB"

    Returns: "Impossible"

  29. "BBBAAAB"

    Returns: "Possible"

  30. "ABCBCAAB"

    Returns: "Possible"

  31. "BCABCABCAB"

    Returns: "Impossible"

  32. "DACDACBADBACB"

    Returns: "Impossible"

  33. "BBBAABBBBBBBABA"

    Returns: "Possible"

  34. "AABEBBEBBCEADCE"

    Returns: "Possible"

  35. "ACDBEDBECDBEDCAECDEA"

    Returns: "Impossible"

  36. "JOCHLOMBOADHNDHI"

    Returns: "Impossible"

  37. "EADBBACCBBEAAECEEDEBBCECDEACBE"

    Returns: "Possible"

  38. "IBCIAFEGJCGJBDIFEAHIGJHHEGCCHGG"

    Returns: "Possible"

  39. "TRYXMBWXBWEXNAGMAYGZYFNZPQFTOBTA"

    Returns: "Impossible"

  40. "BADEABDACDBCEBCAECADECDBCADBCABEADCEDBECDEBAECADBE"

    Returns: "Impossible"

  41. "YJDUGOFKLITXAOYKFOQKZSNJYARKUPREIVHUBPEHXMOYDAKLBD"

    Returns: "Impossible"

  42. "BBBBBAAABABABBBBABBABAABABABBBBABBABBAAAABBBAABBA"

    Returns: "Possible"

  43. "CCBDCEFCEBACDFBAEDAECFBDDFCEEACFDEEACEDCDDFBFFEF"

    Returns: "Possible"

  44. "BDBJEHJAIDJDCEJJBGEAGCDHHFEGHHHHFAAFEDIJIAIEIAAFJD"

    Returns: "Possible"

  45. "BESSRFAZDPRCOMDPJIMSFBUSLKSYVEERGCGMONCTCSVYPOLPLC"

    Returns: "Possible"

  46. "ZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZ"

    Returns: "Possible"

  47. "ABABABABABABABABABABABABABABABABABABABABABABABABAB"

    Returns: "Possible"

  48. "ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDE"

    Returns: "Impossible"

  49. "ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCEE"

    Returns: "Possible"

  50. "ABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABCDEABEDE"

    Returns: "Possible"

  51. "ABB"

    Returns: "Possible"

  52. "II"

    Returns: "Impossible"

  53. "AA"

    Returns: "Impossible"

  54. "AAB"

    Returns: "Possible"

  55. "AABCDEFG"

    Returns: "Possible"

  56. "BBA"

    Returns: "Possible"

  57. "ABCDAEA"

    Returns: "Possible"

  58. "ABCNN"

    Returns: "Possible"

This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2024, TopCoder, Inc. All rights reserved.
This problem was used for: