Talk:Longest string challenge: Difference between revisions
Content added Content deleted
(→Generalization: Not really similar) |
No edit summary |
||
Line 14: | Line 14: | ||
== Can't load https link == |
== Can't load https link == |
||
:Firefox won't load the reference link due to invalid SSL cert. --[[User:Ledrug|Ledrug]] 00:08, 13 August 2011 (UTC) |
:Firefox won't load the reference link due to invalid SSL cert. --[[User:Ledrug|Ledrug]] 00:08, 13 August 2011 (UTC) |
||
==Rereading== |
|||
I think the task description should ''explicitly'' forbid (or permit, if that was the intent) reading the input twice. —[[User:Kevin Reid|Kevin Reid]] 03:08, 13 August 2011 (UTC) |
Revision as of 03:08, 13 August 2011
Generalization
This is an interesting programming challenge. An active discussion is needed to strike a balance between generalization and defeating the task.
- I would expect to see a number of languages mark this as omit.
- Would this only be possible for languages with implicit iteration?
- Would it be fair to relax the lists to lists of lists or supplementary lists in cases of languages like C that represent strings as arrays?
- Etc.
How about a discussion here of how this would apply to a few languages (say in the top 20 or so)?
Similar to Averages/Mode
The problem statement itself (without the restrictions) is very similar to Averages/Mode, except that you do not need to compute the counts of elements, instead taking the length of the string serves as its "count". --208.80.119.69 00:43, 13 August 2011 (UTC)
- Except that in mode you can use comparison operators and arithmetic operators. You're not allowed to do either here. Besides that, I still don't think it's really that similar. --Mwn3d 00:59, 13 August 2011 (UTC)
Can't load https link
- Firefox won't load the reference link due to invalid SSL cert. --Ledrug 00:08, 13 August 2011 (UTC)
Rereading
I think the task description should explicitly forbid (or permit, if that was the intent) reading the input twice. —Kevin Reid 03:08, 13 August 2011 (UTC)