Statistics

Problem Statement for "FindStringEasy"

Problem Statement

A palindrome is a string which reads the same when reversed. For instance, "aba", "b", and "abba" are palindromes, whereas "baabb", "ab", and "abaaa" are not.

A substring is a nonempty contiguous part of a given string. For instance, "aba" is a substring of "aaba" but "aaa" isn't.

Two substrings are considered different if they are located at different positions in the string. For instance, there are two distinct substrings "aba" in the string "ababa".

You are given an int n. Find and return any string with the following properties:

  • Its length is at most 100.
  • Each character is either 'a' or 'b'.
  • The string has exactly n palindromic substrings.

If there are no such strings, return an empty string instead.

Definition

Class:
FindStringEasy
Method:
withPalindromicSubstrings
Parameters:
int
Returns:
String
Method signature:
String withPalindromicSubstrings(int n)
(be sure your method is public)

Notes

  • You do not have to minimize the length of the returned string.

Constraints

  • n will be between 1 and 1000, inclusive.

Examples

  1. 3

    Returns: "aa"

    Any valid solution will be accepted. In this case, another correct return value is "bb".

  2. 9

    Returns: "aaaba"

    The nine palindromic substrings of "aaaba" include four copies of "a", two copies of "aa", and one copy each of "b", "aaa", and "aba".

  3. 12

    Returns: "aabbaba"

  4. 20

    Returns: "bbbaabbaba"

  5. 29

    Returns: "aaaaaaab"

  6. 33

    Returns: "aaaaaaabba"

  7. 35

    Returns: "aaaaaaabbab"

  8. 1

    Returns: "a"

  9. 2

    Returns: "ab"

  10. 4

    Returns: "aab"

  11. 5

    Returns: ""

  12. 6

    Returns: "aaa"

  13. 7

    Returns: "aaab"

  14. 8

    Returns: "aabba"

  15. 140

    Returns: "bbaababaabaabbbabbbabbbaabaaaabbbaabbabbabababbbaaa"

  16. 72

    Returns: "aaaaaaaaaaabbb"

  17. 199

    Returns: "aaaaaaaaaaaaaaaaaabbbbbbb"

  18. 17

    Returns: "aaabbbaa"

  19. 255

    Returns: "aaaaaaaaaaaaaaaaaaaabbbbbbbbb"

  20. 258

    Returns: "aaaaaaaaaaaaaaaaaaaaaabba"

  21. 1000

    Returns: "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaabbbb"

  22. 799

    Returns: "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaabbbbaaa"

  23. 822

    Returns: "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaabbbbbbbaaaa"

  24. 116

    Returns: "aaaaaaaaaaaaaabbbaa"

  25. 106

    Returns: "aaaaaaaaaaaaaab"

  26. 19

    Returns: "aaabbbaab"

  27. 989

    Returns: "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaabbbbbbbbaab"


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: