Skip to main content
deleted 437 characters in body
Source Link
user202729
  • 227
  • 2
  • 9

[I'm definitely not using the formatting sandbox as a free pastebin.]
[Draft[draft for something else.]

Given two strings S and A, call S a good suffix of A if (and only if) S is not longer than one third of the length of A, and is longer than 2 characters.

 

The challengeNote: Given arbitrarily many (more than 4) words, your goal is to find the longest string thatThis question is a good suffix of all of them.

If there's no such string, do not make any output.

All given words are separated by spaces; they only contain lower case English alphabetsoff-topic for Stack Overflow.

You can use any way to accept input, but output should only be in STDOUT See How to download video with blob url? on Super User instead.

[I'm definitely not using the formatting sandbox as a free pastebin.]
[Draft for something else.]

Given two strings S and A, call S a good suffix of A if (and only if) S is not longer than one third of the length of A, and is longer than 2 characters.

The challenge: Given arbitrarily many (more than 4) words, your goal is to find the longest string that is a good suffix of all of them.

If there's no such string, do not make any output.

All given words are separated by spaces; they only contain lower case English alphabets.

You can use any way to accept input, but output should only be in STDOUT.

[draft for something else.]

 

Note: This question is off-topic for Stack Overflow. See How to download video with blob url? on Super User instead.

added 176 characters in body
Source Link
user202729
  • 227
  • 2
  • 9

[draft[I'm definitely not using the formatting sandbox as a free pastebin.]
[Draft for something else.]

Note

Since currently there isn'tGiven two strings S and A, call S a lotgood suffix of people reviewingA if (and only if) S is not longer than one third of the sandboxlength of A, please review one post inand is longer than 2 characters.

The challenge: Given arbitrarily many (more than 4) words, your goal is to find the sandbox every time you postlongest string that is a question in the sandboxgood suffix of all of them.

If there's no such string, or you receive a reviewdo not make any output.

All given words are separated by spaces; they only contain lower case English alphabets.

You should leave a comment saying that the question is clear and can use any way to accept input, but output should only be posted on the main site (because upvotes can mean anythingin STDOUT. Most people are using upvotes on interesting questions)

[draft for something else.]

Note

Since currently there isn't a lot of people reviewing the sandbox, please review one post in the sandbox every time you post a question in the sandbox, or you receive a review.

You should leave a comment saying that the question is clear and can be posted on the main site (because upvotes can mean anything. Most people are using upvotes on interesting questions)

[I'm definitely not using the formatting sandbox as a free pastebin.]
[Draft for something else.]

Given two strings S and A, call S a good suffix of A if (and only if) S is not longer than one third of the length of A, and is longer than 2 characters.

The challenge: Given arbitrarily many (more than 4) words, your goal is to find the longest string that is a good suffix of all of them.

If there's no such string, do not make any output.

All given words are separated by spaces; they only contain lower case English alphabets.

You can use any way to accept input, but output should only be in STDOUT.

Source Link
user202729
  • 227
  • 2
  • 9

[draft for something else.]

Note

Since currently there isn't a lot of people reviewing the sandbox, please review one post in the sandbox every time you post a question in the sandbox, or you receive a review.

You should leave a comment saying that the question is clear and can be posted on the main site (because upvotes can mean anything. Most people are using upvotes on interesting questions)

Post Made Community Wiki by user202729