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 string
Search options not deleted
user 44684
A competition to solve a particular problem through the usage and manipulation of strings.
12
votes
Type uniqchars!
JavaScript ES7, 37 33 25 bytes
Pretty simple approach using ES6 Set and ES7 Array comprehensions spread operator:
s=>[...new Set(s)].join``
22 bytes less than the indexOf approach. Worked on a han …
- 221