GeezerVison

The World Wide Web, restored to 800 pixels of glory.

GeezerVison is showing leetcodejavascript.com — #1408 - String Matching in an Array - LeetCode JavaScript Solutions

Back to all solutions

#1408 - String Matching in an Array

Easy • View on LeetCode • View on GitHub

Array String String Matching

Problem Description

Given an array of string words. Return all strings in words which is substring of another word in any order.

String words[i] is substring of words[j], if can be obtained removing some characters to left and/or right side of words[j].

Solution

/**
 * @param {string[]} words
 * @return {string[]}
 */
var stringMatching = function(words) {
  return words.filter(s => words.some(word => word !== s && word.includes(s)));
};

You are visitor 01402520 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.