Testing if a string is different than any other in a set
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{ height:90px;width:728px;box-sizing:border-box;
}
I have a set of strings. I am trying to see if there are any outliers in the set. For example, assuming the set contains the following:
Jade Jone
Jone Bone
Dade Bone
Tigger Trap
I am trying to identify Tigger Trap since it does not contain any word in common with the other strings in the set.
java string set
add a comment |
I have a set of strings. I am trying to see if there are any outliers in the set. For example, assuming the set contains the following:
Jade Jone
Jone Bone
Dade Bone
Tigger Trap
I am trying to identify Tigger Trap since it does not contain any word in common with the other strings in the set.
java string set
And what is your question? If it is "how to do it" it is off-topic here. You have to ask specific question about programming. Try to solve this problem yourself and ask question if you have specific problem.
– talex
Jan 4 at 2:55
Welcome to SO. Unfortunately your question presents as though you want someone to write the code for you. Can you explain what you have tried and where you are stuck?
– sprinter
Jan 4 at 2:56
Maybe generate some kind ofMap
based on tokens
– MadProgrammer
Jan 4 at 2:58
add a comment |
I have a set of strings. I am trying to see if there are any outliers in the set. For example, assuming the set contains the following:
Jade Jone
Jone Bone
Dade Bone
Tigger Trap
I am trying to identify Tigger Trap since it does not contain any word in common with the other strings in the set.
java string set
I have a set of strings. I am trying to see if there are any outliers in the set. For example, assuming the set contains the following:
Jade Jone
Jone Bone
Dade Bone
Tigger Trap
I am trying to identify Tigger Trap since it does not contain any word in common with the other strings in the set.
java string set
java string set
asked Jan 4 at 2:52
Precise ProfilePrecise Profile
1
1
And what is your question? If it is "how to do it" it is off-topic here. You have to ask specific question about programming. Try to solve this problem yourself and ask question if you have specific problem.
– talex
Jan 4 at 2:55
Welcome to SO. Unfortunately your question presents as though you want someone to write the code for you. Can you explain what you have tried and where you are stuck?
– sprinter
Jan 4 at 2:56
Maybe generate some kind ofMap
based on tokens
– MadProgrammer
Jan 4 at 2:58
add a comment |
And what is your question? If it is "how to do it" it is off-topic here. You have to ask specific question about programming. Try to solve this problem yourself and ask question if you have specific problem.
– talex
Jan 4 at 2:55
Welcome to SO. Unfortunately your question presents as though you want someone to write the code for you. Can you explain what you have tried and where you are stuck?
– sprinter
Jan 4 at 2:56
Maybe generate some kind ofMap
based on tokens
– MadProgrammer
Jan 4 at 2:58
And what is your question? If it is "how to do it" it is off-topic here. You have to ask specific question about programming. Try to solve this problem yourself and ask question if you have specific problem.
– talex
Jan 4 at 2:55
And what is your question? If it is "how to do it" it is off-topic here. You have to ask specific question about programming. Try to solve this problem yourself and ask question if you have specific problem.
– talex
Jan 4 at 2:55
Welcome to SO. Unfortunately your question presents as though you want someone to write the code for you. Can you explain what you have tried and where you are stuck?
– sprinter
Jan 4 at 2:56
Welcome to SO. Unfortunately your question presents as though you want someone to write the code for you. Can you explain what you have tried and where you are stuck?
– sprinter
Jan 4 at 2:56
Maybe generate some kind of
Map
based on tokens– MadProgrammer
Jan 4 at 2:58
Maybe generate some kind of
Map
based on tokens– MadProgrammer
Jan 4 at 2:58
add a comment |
1 Answer
1
active
oldest
votes
Here is a general approach you could try:
- Find the number of times each word appears
- Find all set that only consist of words that appear once
The first of these likely involves creating a map from string to integers.
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f54032560%2ftesting-if-a-string-is-different-than-any-other-in-a-set%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
Here is a general approach you could try:
- Find the number of times each word appears
- Find all set that only consist of words that appear once
The first of these likely involves creating a map from string to integers.
add a comment |
Here is a general approach you could try:
- Find the number of times each word appears
- Find all set that only consist of words that appear once
The first of these likely involves creating a map from string to integers.
add a comment |
Here is a general approach you could try:
- Find the number of times each word appears
- Find all set that only consist of words that appear once
The first of these likely involves creating a map from string to integers.
Here is a general approach you could try:
- Find the number of times each word appears
- Find all set that only consist of words that appear once
The first of these likely involves creating a map from string to integers.
answered Jan 4 at 3:00
sprintersprinter
16.9k42961
16.9k42961
add a comment |
add a comment |
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f54032560%2ftesting-if-a-string-is-different-than-any-other-in-a-set%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
And what is your question? If it is "how to do it" it is off-topic here. You have to ask specific question about programming. Try to solve this problem yourself and ask question if you have specific problem.
– talex
Jan 4 at 2:55
Welcome to SO. Unfortunately your question presents as though you want someone to write the code for you. Can you explain what you have tried and where you are stuck?
– sprinter
Jan 4 at 2:56
Maybe generate some kind of
Map
based on tokens– MadProgrammer
Jan 4 at 2:58