Frage im Vorstellungsgespräch bei Google

Implement a function boolean matches(String text, String pattern) to find match pattern in the string, pattern can be seperated but the order of letters in pattern cannot be changed.

Antworten zu Vorstellungsgespräch

Anonym

11. Apr. 2012

longest common subsequence

1

Anonym

9. März 2012

Can you please clarify what you mean by order of pattern can be separated.

Anonym

11. Apr. 2012

I think this is a finding a subsequence in a string problem