Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>Isn't it doable in O(n log n)?</p> <p>Step 1, reduce the string by eliminating all characters that appear to the right. Strictly speaking you only need to eliminate characters if they appear in the string you're checking.</p> <pre><code>/** Reduces the maximal subsequence of characters in container that contains no * character from container that appears to the left of the same character in * container. E.g. "common" -&gt; "cmon", and "whirlygig" -&gt; "whrlyig". */ static String reduceContainer(String container) { SparseVector charsToRight = new SparseVector(); // Like a Bitfield but sparse. StringBuilder reduced = new StringBuilder(); for (int i = container.length(); --i &gt;= 0;) { char ch = container.charAt(i); if (charsToRight.add(ch)) { reduced.append(ch); } } return reduced.reverse().toString(); } </code></pre> <p>Step 2, check containment.</p> <pre><code>static boolean containsInOrder(String container, String containee) { int containerIdx = 0, containeeIdx = 0; int containerLen = container.length(), containeeLen == containee.length(); while (containerIdx &lt; containerLen &amp;&amp; containeeIdx &lt; containeeLen) { // Could loop over codepoints instead of code-units, but you get the point... if (container.charAt(containerIdx) == containee.charAt(containeeIdx)) { ++containeeIdx; } ++containerIdx; } return containeeIdx == containeeLen; } </code></pre> <p>And to answer your second question, no, Levenshtein distance won't help you since it has the property that if you swap the arguments the output is the same, but the algo you want does not.</p>
    singulars
    1. This table or related slice is empty.
    1. POMatching the occurrence and pattern of characters of String2 in String1
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USMike Samuel
    1. USMike Samuel
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. COThis will return true for the 2nd example where it should return false - `containsInOrder("common", "omn")=true`
      singulars
      1. PO
      1. USRonK
    2. COWill edit to show how you can add a pass that removes all letters from the container that occur later in the string.
      singulars
      1. PO
      1. USMike Samuel
    3. CO@Mike- Thanks for responding, but I tried a similar logic earlier and found it to be failing. Suppose the strings are- "common", "cmo"...according to your logic it would Pass because "cmon" is the reduced string. But it should fail because 'o' is also occurring before 'm' in the original string.
      singulars
      1. PO
      1. USMadTest
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload