String Matching in an Array
As a Systems Engineer at Tata Consultancy Services, I deliver exceptional software products for mobile and web platforms, using agile methodologies and robust quality maintenance. I am experienced in performance testing, automation testing, API testing, and manual testing, with various tools and technologies such as Jmeter, Azure LoadTest, Selenium, Java, OOPS, Maven, TestNG, and Postman.
I have successfully developed and executed detailed test plans, test cases, and scripts for Android and web applications, ensuring high-quality standards and user satisfaction. I have also demonstrated my proficiency in manual REST API testing with Postman, as well as in end-to-end performance and automation testing using Jmeter and selenium with Java, TestNG and Maven. Additionally, I have utilized Azure DevOps for bug tracking and issue management.
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
LeetCode Problem: Link | Click Here
class Solution {
public List<String> stringMatching(String[] words) {
// Get the length of the array 'words'
int wordsLen = words.length;
// Create a list to store the found words that are substrings of others
List<String> result = new ArrayList<>();
// Loop through each word in the list
for (int i = 0; i < wordsLen; i++) {
// Compare each word with every other word in the list
for (int j = 0; j < wordsLen; j++) {
// Check if a word contains another word and they are not the same
if ((words[i].contains(words[j])) && (i != j)) {
// If the word is not already in the result list, add it
if (!result.contains(words[j])) {
result.add(words[j]);
}
}
}
}
// Return the list of words that are substrings of others
return result;
}
}
