Create an account

Very important

  • To access the important data of the forums, you must be active in each forum and especially in the leaks and database leaks section, send data and after sending the data and activity, data and important content will be opened and visible for you.
  • You will only see chat messages from people who are at or below your level.
  • More than 500,000 database leaks and millions of account leaks are waiting for you, so access and view with more activity.
  • Many important data are inactive and inaccessible for you, so open them with activity. (This will be done automatically)

0Day Forums Coding Ruby Find the longest common starting substring in a set of strings

Thread Rating:
  • 653 Vote(s) - 3.56 Average
  • 1
  • 2
  • 3
  • 4
  • 5
Options
Find the longest common starting substring in a set of strings

Offline Sirlatish1


Luxury
*****
Luxury
Posts: 0
Threads: 0
Joined: Jun 2020
Reputation: 0
Level: inf [Level]
Total Points: inf
Rank nan / 1
100% to upload Level
Rank
Activity inf / 1
99% to upload your Rank
Activity
Experience nan
100% to upload Experience
Experience

Points: 50
#31
07-19-2023, 12:44 AM
Ruby one-liner:

l=strings.inject{|l,s| l=l.chop while l!=s[0...l.length];l}
Reply

Offline novelizingspa


Valued member
***
Valued member
Posts: 0
Threads: 0
Joined: May 2020
Reputation: 0
Level: inf [Level]
Total Points: inf
Rank nan / 1
100% to upload Level
Rank
Activity inf / 1
99% to upload your Rank
Activity
Experience nan
100% to upload Experience
Experience

Points: 50
#32
07-19-2023, 12:44 AM
This is probably not the most concise solution (depends if you already have a library for this), but one elegant method is to use a trie. I use tries for implementing tab completion in my Scheme interpreter:

[

[To see links please register here]

][1]

For example:

tree = Trie.new
%w[interspecies interstelar interstate].each { |s| tree[s] = true }
tree.longest_prefix('')
#=> "inters"

I also use them for matching channel names with wildcards for the Bayeux protocol; see these:

[

[To see links please register here]

][2]

[

[To see links please register here]

][3]


[1]:

[To see links please register here]

[2]:

[To see links please register here]

[3]:

[To see links please register here]

Reply

« Next Oldest
Next Newest »


Forum Jump:


Users browsing this thread:
2 Guest(s)

©0Day  2016 - 2023 | All Rights Reserved.  Made with    for the community. Connected through