Advertisement

11.25.2006 at 01:32PM PST, ID: 22072245
[x]
Attachment Details
[x]
The Solution Rating System

With so many solutions, how can you tell which solutions are most likely to help you and which ones are not? To provide you with a tool to use, we rate our solutions based on various elements that most accurately determine if a solution is a quality solution. To explain what factors affect the solution rating, here are the elements we take into consideration when formulating our solution rating.

  • The Grade of the Solution
  • The Zone Rank of the Expert Providing the Solution
  • The Number of Author and Expert Comments
  • The Number of Experts Contributing
  • The Feedback of the Community

Your Input Matters
Because of the way the system is set up, the most important variable in this equation is you. As a member of Experts Exchange, you are able to cast your vote on the quality of the solutions in regard to how complete, accurate, helpful and easy to understand each solution is. When you provide your feedback, each rating is adjusted accordingly. So, if you see a solution that has a poor rating that you think is a good solution, let us know by rating it. As you do, the rating will be adjusted and will become more accurate for other members of our site.

If you have any suggestions that you would like to make for our rating system, please ask a question in the Suggestions Zone of Community Support.

Thank you!
7.8

I'm looking for a fast algorithm to identify the shortest unique string prefixes in a list of strings.

Asked by billmercer in Miscellaneous Programming

Tags: , , ,

I have a list of unique names, some of which are pretty long, and begin with the same set of characters.
I'm trying to write a simple script to take this list of names, and reduce each name to the shortest string (reading from left to right) that is still unique for that name. Put another way, I want to truncate all characters from the right that are not needed to uniquely identify the item in the list.
For example, if the list of names looks like this:
  "Big Shaggy Dog"
  "Big Shaggy Badger"
  "Big Shaky House"
  "Bigger Shaggier Dog"
  "Small Fluffy Bunny"
  "Dead Cat"
  "Deadly Vorpal Rabbit"
 
...then the truncated list would look like this:
  "Big Shaggy D"
  "Big Shaggy B"
  "Big Shak"
  "Bigg"
  "S"
  "Dead "
  "Deadl"

Because only one item begins with S, the S alone is sufficient to identify that item on the list. But since multiple names begin with "Big", more characters are needed to uniquely identify these items.

The idea is to have the script "type" items into a user dialog box one character at a time, but not type in any more characters than are actually needed to uniquely identify the string.
Start Free Trial
 
Keywords: I'm looking for a fast algorithm to ident…
Title
1 Rabbits
2 Rabbits
3 Rabbits - Waskely Wabbits
4 Killer rabbits
5 Easter Eggs / Bunny
6 Badgers
 
Loading Advertisement...
 
[+][-]11.25.2006 at 01:45PM PST, ID: 18012587

At Experts Exchange, members can ask their questions to thousands of technology professionals, also known as Experts. Experts compete and collaborate to answer those questions by leaving comments like this one.

Start your 7-day free trial to view this Expert Comment or ask the Experts your question.

 
[+][-]11.25.2006 at 02:12PM PST, ID: 18012657

At Experts Exchange, members can ask their questions to thousands of technology professionals, also known as Experts. Experts compete and collaborate to answer those questions by leaving comments like this one.

Start your 7-day free trial to view this Expert Comment or ask the Experts your question.

 
[+][-]11.25.2006 at 02:34PM PST, ID: 18012744

At Experts Exchange, members can ask their questions to thousands of technology professionals, also known as Experts. Experts compete and collaborate to answer those questions by leaving comments like this one.

Start your 7-day free trial to view this Expert Comment or ask the Experts your question.

 
[+][-]11.25.2006 at 02:40PM PST, ID: 18012765

Assisted solutions are selected by the member who asked the question as a comment that contributed to their question's solution.

Start your 7-day free trial to view this Assisted Solution or ask the Experts your question.

 
[+][-]11.25.2006 at 03:01PM PST, ID: 18012803

Often, when Experts are collaborating with members who have asked questions, they will request additional information about the problem. Askers respond with an author comment like this one.

Start your 7-day free trial to view this Author Comment or ask the Experts your question.

 
[+][-]11.25.2006 at 03:20PM PST, ID: 18012847

Assisted solutions are selected by the member who asked the question as a comment that contributed to their question's solution.

Start your 7-day free trial to view this Assisted Solution or ask the Experts your question.

 
[+][-]11.25.2006 at 03:39PM PST, ID: 18012878

View this solution now by starting your 7-day free trial. Setting up your free trial is quick, easy, and secure. We will return you to this solution, unlocked, when you're done.

 

About this solution

Zone: Miscellaneous Programming
Tags: algorithm, shortest, unique, string
Sign Up Now!
Solution Provided By: ozo
Participating Experts: 7
Solution Grade: A
 
 
[+][-]11.25.2006 at 03:52PM PST, ID: 18012897

Often, when Experts are collaborating with members who have asked questions, they will request additional information about the problem. Askers respond with an author comment like this one.

Start your 7-day free trial to view this Author Comment or ask the Experts your question.

 
[+][-]11.25.2006 at 03:57PM PST, ID: 18012904

Often, when Experts are collaborating with members who have asked questions, they will request additional information about the problem. Askers respond with an author comment like this one.

Start your 7-day free trial to view this Author Comment or ask the Experts your question.

 
[+][-]11.25.2006 at 04:44PM PST, ID: 18012985

At Experts Exchange, members can ask their questions to thousands of technology professionals, also known as Experts. Experts compete and collaborate to answer those questions by leaving comments like this one.

Start your 7-day free trial to view this Expert Comment or ask the Experts your question.

 
[+][-]11.26.2006 at 07:49AM PST, ID: 18014437

Assisted solutions are selected by the member who asked the question as a comment that contributed to their question's solution.

Start your 7-day free trial to view this Assisted Solution or ask the Experts your question.

 
[+][-]11.26.2006 at 12:45PM PST, ID: 18015286

At Experts Exchange, members can ask their questions to thousands of technology professionals, also known as Experts. Experts compete and collaborate to answer those questions by leaving comments like this one.

Start your 7-day free trial to view this Expert Comment or ask the Experts your question.

 
[+][-]11.26.2006 at 12:54PM PST, ID: 18015319

Assisted solutions are selected by the member who asked the question as a comment that contributed to their question's solution.

Start your 7-day free trial to view this Assisted Solution or ask the Experts your question.

 
[+][-]11.26.2006 at 09:26PM PST, ID: 18017319

Assisted solutions are selected by the member who asked the question as a comment that contributed to their question's solution.

Start your 7-day free trial to view this Assisted Solution or ask the Experts your question.

 
[+][-]11.27.2006 at 02:15PM PST, ID: 18023250

Often, when Experts are collaborating with members who have asked questions, they will request additional information about the problem. Askers respond with an author comment like this one.

Start your 7-day free trial to view this Author Comment or ask the Experts your question.

 
[+][-]11.27.2006 at 03:11PM PST, ID: 18023604

At Experts Exchange, members can ask their questions to thousands of technology professionals, also known as Experts. Experts compete and collaborate to answer those questions by leaving comments like this one.

Start your 7-day free trial to view this Expert Comment or ask the Experts your question.

 
[+][-]11.27.2006 at 10:57PM PST, ID: 18025826

At Experts Exchange, members can ask their questions to thousands of technology professionals, also known as Experts. Experts compete and collaborate to answer those questions by leaving comments like this one.

Start your 7-day free trial to view this Expert Comment or ask the Experts your question.

 
 
Loading Advertisement...
20080716-EE-VQP-32