2025-01-07 Daily Challenge

Posted on:
Posted modified:
In: DailyChallenge

Today I have done leetcode's January LeetCoding Challenge with cpp.

January LeetCoding Challenge 7

Description

String Matching in an Array

Given an array of string words, return all strings in words that is a substring of another word. You can return the answer in any order.

A substring is a contiguous sequence of characters within a string

 

Example 1:

Input: words = ["mass","as","hero","superhero"]
Output: ["as","hero"]
Explanation: "as" is substring of "mass" and "hero" is substring of "superhero".
["hero","as"] is also a valid answer.

Example 2:

Input: words = ["leetcode","et","code"]
Output: ["et","code"]
Explanation: "et", "code" are substring of "leetcode".

Example 3:

Input: words = ["blue","green","bu"]
Output: []
Explanation: No string of words is substring of another string.

 

Constraints:

  • 1 <= words.length <= 100
  • 1 <= words[i].length <= 30
  • words[i] contains only lowercase English letters.
  • All the strings of words are unique.

Solution

class Solution {
public:
  vector<string> stringMatching(vector<string>& words) {
    vector<string> answer;
    for(const auto &word : words) {
      bool found = false;
      for(const auto &source : words) {
        if(word == source) continue;
        if(source.length() > word.length() && source.find(word) != string::npos) {
          found = true;
          break;
        }
      }
      if(found) answer.push_back(word);
    }
    return answer;
  }
};

// Accepted
// 67/67 cases passed (0 ms)
// Your runtime beats 100 % of cpp submissions
// Your memory usage beats 69.19 % of cpp submissions (11.3 MB)
Algorithm