Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with array
Search options not deleted
user 33016
A competition to solve a particular problem through the usage and manipulation of arrays.
0
votes
Lisp Extraction Mission
Common Lisp, 168 155 bytes
Some stupid recursion thing, it could probably be condensed a bit more:
(lambda(l e)(labels((r(l o)(setf a(car l)d(cdr l)x`(car,o)y`(cdr,o))(if(equal e a)x(if(atom a)(r d y) …
- 181
2
votes
Non-Unique/Duplicate Elements
Common Lisp, 57 bytes
(remove-duplicates(remove-if(lambda(x)(<(count x d)2))d))
- 181