Talk:Longest string challenge: Difference between revisions
Content added Content deleted
No edit summary |
No edit summary |
||
| Line 9: | Line 9: | ||
---- |
---- |
||
The problem statement itself (without the restrictions) is |
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". --[[Special:Contributions/208.80.119.69|208.80.119.69]] 00:43, 13 August 2011 (UTC) |
||
== Can't load https link == |
== Can't load https link == |
||
Revision as of 00:43, 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)?
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)
Can't load https link
- Firefox won't load the reference link due to invalid SSL cert. --Ledrug 00:08, 13 August 2011 (UTC)