7_jan

/*
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".
*/

//approch
class Solution {
	public:
			vector<string> stringMatching(vector<string>& words) {
					int n = words.size();
					vector<string> result; 
					
					for(int i = 0;i < n ; i++){
							for(int j = 0; j < n ; j++){
									if(i == j) continue;
	
									if(words[j].find(words[i]) != string::npos){
											result.push_back(words[i]);
											break;
									}
							}
					}
					return result;
	
					
			}
	};