Reorder strings using similarity score algorithm

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP



Reorder strings using similarity score algorithm



Re-orders a set of strings buzz, fuzz, jazz, fizz.. so that sum of similarity scores between each pair of adjacent strings is the lowest.


buzz, fuzz, jazz, fizz..


buzz-> fuzz (1)
fuzz-> jazz (2)
jazz-> fizz (2)



sum of the scores is 5. If reordered based on lowest(4) final output is


buzz, fuzz, fizz, jazz..

buzz-> fuzz (1)
fuzz-> fizz (1)
fizz-> jazz (2)



My approach is to find Edit distance for every pair of strings and construct a weighted graph where edge represents the edit distance value. Use DFS to find the lowest path.
Is this the efficient solution? can it be done any better?





The way you model the problem gives you basically the en.wikipedia.org/wiki/Travelling_salesman_problem. So this will have exponential runtime (ergo: this solution is not efficient). However, I cannot think of a more efficient way to solve this.
– SaiBot
Aug 10 at 14:37






I believe that you are looking for the shortest Hamiltonian path in a complete graph. Visit each word or vertex once -> Hamiltonian Path. Each word is connected to every other word (with variable weights) -> Complete Graph. Good news. This problem is well known. :) Bad news. It is NP-Complete. :( researchgate.net/publication/…
– Mark Wistrom
Aug 10 at 14:39






@SaiBot given a similar problem like this in coding interview to finish in 1 hour. I wasn't sure if what I had is the optimal solution. Wanted to hear the thoughts of the others if I am missing anything.
– Kar
Aug 10 at 16:11





You say you were given a "similar" problem in a coding interview, but probably that problem is not similar at all, because it has a good solution that you could code in an hour. This one does not
– Matt Timmermans
Aug 10 at 16:47





@MattTimmermans I didn't want to mention that this was given as is in the coding interview. Now I just did.
– Kar
Aug 11 at 1:18









By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

-

Popular posts from this blog

Firebase Auth - with Email and Password - Check user already registered

Image
Clash Royale CLAN TAG #URR8PPP Firebase Auth - with Email and Password - Check user already registered I want to check when a user attempts to signup with createUserWithEmailAndPassword() in Firebase user Authentication method, this user is already registered with my app. createUserWithEmailAndPassword() 8 Answers 8 To detect whether a user with that email address already exists, you can detect when the call to createUserWithEmailAndPassword () fails with auth/email-already-in-use . I see that @Srinivasan just posted an answer for this. createUserWithEmailAndPassword () auth/email-already-in-use Alternatively, you can detect that an email address is already used by calling fetchSignInMethodsForEmail() (previous called fetchProvidersForEmail() ). fetchSignInMethodsForEmail() fetchProvidersForEmail() When the user trying to create an user with same email address, the task response will be "Response: The email address is already in use by another account." mFirebas
Read more

Dynamically update html content plain JS

Image
Clash Royale CLAN TAG #URR8PPP Dynamically update html content plain JS So I have a script bound in my index.html, which literally has to fetch an array of jsons from an api, then dynamically update my page when get response. But as a result I'm getting an as the only update of my page. here is my script fetch(url) .then((resp) => resp.json()) .then((resp) => resp.results.forEach(item => fetch(item.url) .then((response)=> response.json()) .then((response) => pokeArr.push(response)) .catch(console.log) ) ).catch(console.log) const filler = () => if(!pokeArr) return 0 pokeArr.map((i,j)=> return `<tr>$i.name</tr>` ) const pokeindex = () => document.getElementById('a').appendChild(document.createElement(filler())) pokeindex() When I'm consoling it, I can see in the console all the responses I get, so I'm at least doing the fetching part right. What's parberakan ? What's pokeArr ? – T.J. Crowder Aug 8 at 12
Read more

How to determine optimal route across keyboard

Image
Clash Royale CLAN TAG #URR8PPP How to determine optimal route across keyboard I'm trying to automate the typing process in a video game. Players are given an on-screen QWERTY keyboard layout that they can navigate with the control stick (up, down, left, right) in order to select a letter to type. I was wondering if there was a module for Python (or some other resource I could explore) that would help my program find a path across the keyboard as it types each letter in a given message. In other words, if the first letter typed was "A" and the next letter was "B", the module would know that the program should move 1 space down on the keyboard and 4 spaces to the right. Currently, I have the program resetting to the "G" key after each letter is typed (allowing me to use fixed-directions as the program parses each character in the desired message). As you can imagine, this is quite inefficient and defeats the purpose of automating the typing in the fir
Read more