{"id":7309,"date":"2025-06-26T19:36:03","date_gmt":"2025-06-26T14:06:03","guid":{"rendered":"https:\/\/namastedev.com\/blog\/?p=7309"},"modified":"2025-06-26T19:36:04","modified_gmt":"2025-06-26T14:06:04","slug":"find-words-containing-character","status":"publish","type":"post","link":"https:\/\/namastedev.com\/blog\/find-words-containing-character\/","title":{"rendered":"Find words containing character"},"content":{"rendered":"\n<!-- PrismJS for Syntax Highlighting -->\n<link href=\"https:\/\/cdn.jsdelivr.net\/npm\/prismjs@1.29.0\/themes\/prism-tomorrow.min.css\" rel=\"stylesheet\">\n<script src=\"https:\/\/cdn.jsdelivr.net\/npm\/prismjs@1.29.0\/prism.min.js\"><\/script>\n<script src=\"https:\/\/cdn.jsdelivr.net\/npm\/prismjs@1.29.0\/plugins\/autoloader\/prism-autoloader.min.js\"><\/script>\n\n<style>\n  .wp_blog_main-heading {\n    text-align: center;\n    font-size: 2.4rem;\n    color: #E58C32;\n    margin-top: 2.5rem;\n    font-weight: bold;\n  }\n\n  .wp_blog_explanation,\n  .wp_blog_code-tabs-container {\n    max-width: 940px;\n    margin: 2rem auto;\n    padding: 2rem;\n    border-radius: 12px;\n    background-color: #f9fafb;\n  }\n\n  .wp_blog_explanation h2 {\n    font-size: 1.4rem;\n    color: #E58C32;\n    margin-bottom: 0.75rem;\n  }\n\n  .wp_blog_explanation p,\n  .wp_blog_explanation li {\n    font-size: 1.05rem;\n    line-height: 1.7;\n    margin: 0.5rem 0;\n    color: #1f2937;\n  }\n\n  .wp_blog_explanation code {\n    padding: 3px 6px;\n    border-radius: 4px;\n    background: #e5e7eb;\n    font-family: 'Courier New', monospace;\n  }\n\n  .wp_blog_code-tabs-header {\n    display: flex;\n    flex-wrap: wrap;\n    gap: 0.5rem;\n    margin-bottom: 1rem;\n  }\n\n  .wp_blog_code-tab-button {\n    padding: 0.6rem 1.2rem;\n    border: 1px solid #E58C32;\n    color: #E58C32;\n    border-radius: 50px;\n    font-weight: 600;\n    cursor: pointer;\n    background-color: white;\n    transition: background 0.3s ease, color 0.3s ease;\n  }\n\n  .wp_blog_code-tab-button.active {\n    background: #E58C32;\n    color: white;\n  }\n\n  .wp_blog_code-tab-content {\n    display: none;\n    background: #111827;\n    border-radius: 12px;\n  }\n\n  .wp_blog_code-tab-content.active {\n    display: block;\n  }\n\n  .wp_blog_code-tab-content pre {\n    margin: 0;\n    padding: 1.5rem;\n    font-size: 1rem;\n    overflow-x: auto;\n    color: #f3f4f6;\n    background: #111827;\n    border-radius: 12px;\n  }\n<\/style>\n\n<div class=\"wp_blog_explanation\">\n  <h2>Problem Statement:<\/h2>\n  <p>You are given a 0-indexed array of strings <code>words<\/code> and a character <code>x<\/code>. Return an array of indices representing the words that contain the character <code>x<\/code>.<\/p>\n  <p>The returned array can be in any order.<\/p>\n\n  <h2>Example:<\/h2>\n  <p><strong>Input:<\/strong> words = [&#8220;leet&#8221;, &#8220;code&#8221;], x = &#8220;e&#8221;<br><strong>Output:<\/strong> [0, 1]<\/p>\n  <p><strong>Input:<\/strong> words = [&#8220;abc&#8221;, &#8220;bcd&#8221;, &#8220;aaaa&#8221;, &#8220;cbc&#8221;], x = &#8220;a&#8221;<br><strong>Output:<\/strong> [0, 2]<\/p>\n  <p><strong>Input:<\/strong> words = [&#8220;abc&#8221;, &#8220;bcd&#8221;, &#8220;aaaa&#8221;, &#8220;cbc&#8221;], x = &#8220;z&#8221;<br><strong>Output:<\/strong> []<\/p>\n\n  <h2>Constraints:<\/h2>\n  <ul>\n    <li>1 \u2264 words.length \u2264 50<\/li>\n    <li>1 \u2264 words[i].length \u2264 50<\/li>\n    <li>x is a lowercase English letter<\/li>\n    <li>words[i] consists only of lowercase English letters<\/li>\n  <\/ul>\n\n  <h2>Approach:<\/h2>\n  <ul>\n    <li>Use two nested loops: Outer loop for each word, inner loop for each character in the word.<\/li>\n    <li>If character <code>x<\/code> is found in a word, push its index to the result array and break.<\/li>\n  <\/ul>\n\n  <h2>Time and Space Complexity:<\/h2>\n  <ul>\n    <li><strong>Time Complexity:<\/strong> O(m \u00d7 n) \u2014 where <code>m<\/code> is the number of words, and <code>n<\/code> is the max length of a word.<\/li>\n    <li><strong>Space Complexity:<\/strong> O(1) \u2014 constant extra space (excluding result array).<\/li>\n  <\/ul>\n<\/div>\n\n<div class=\"wp_blog_code-tabs-container\">\n  <div class=\"wp_blog_code-tabs-header\">\n    <button class=\"wp_blog_code-tab-button active\" data-lang=\"js\">JavaScript<\/button>\n    <button class=\"wp_blog_code-tab-button\" data-lang=\"c\">C<\/button>\n    <button class=\"wp_blog_code-tab-button\" data-lang=\"cpp\">C++<\/button>\n    <button class=\"wp_blog_code-tab-button\" data-lang=\"java\">Java<\/button>\n    <button class=\"wp_blog_code-tab-button\" data-lang=\"py\">Python<\/button>\n    <button class=\"wp_blog_code-tab-button\" data-lang=\"csharp\">C#<\/button>\n  <\/div>\n\n  <!-- JavaScript -->\n  <div class=\"wp_blog_code-tab-content active\" data-lang=\"js\">\n    <pre><code class=\"language-javascript\">\nvar findWordsContaining = function(words, x) {\n    let res = [];\n    for (let i = 0; i &lt; words.length; i++) {\n        for (let j = 0; j &lt; words[i].length; j++) {\n            if (words[i][j] === x) {\n                res.push(i);\n                break;\n            }\n        }\n    }\n    return res;\n};\n    <\/code><\/pre>\n  <\/div>\n\n  <!-- C -->\n  <div class=\"wp_blog_code-tab-content\" data-lang=\"c\">\n    <pre><code class=\"language-c\">\nint* findWordsContaining(char** words, int wordsSize, char x, int* returnSize) {\n    int* result = (int*)malloc(sizeof(int) * wordsSize);\n    *returnSize = 0;\n\n    for (int i = 0; i &lt; wordsSize; i++) {\n        for (int j = 0; words[i][j] != '\\0'; j++) {\n            if (words[i][j] == x) {\n                result[(*returnSize)++] = i;\n                break;\n            }\n        }\n    }\n    return result;\n}\n    <\/code><\/pre>\n  <\/div>\n\n  <!-- C++ -->\n  <div class=\"wp_blog_code-tab-content\" data-lang=\"cpp\">\n    <pre><code class=\"language-cpp\">\nclass Solution {\npublic:\n    vector&lt;int&gt; findWordsContaining(vector&lt;string&gt;&amp; words, char x) {\n        vector&lt;int&gt; result;\n        for (int i = 0; i &lt; words.size(); i++) {\n            for (char c : words[i]) {\n                if (c == x) {\n                    result.push_back(i);\n                    break;\n                }\n            }\n        }\n        return result;\n    }\n};\n    <\/code><\/pre>\n  <\/div>\n\n  <!-- Java -->\n  <div class=\"wp_blog_code-tab-content\" data-lang=\"java\">\n    <pre><code class=\"language-java\">\nclass Solution {\n    public List&lt;Integer&gt; findWordsContaining(String[] words, char x) {\n        List&lt;Integer&gt; result = new ArrayList&lt;&gt;();\n        for (int i = 0; i &lt; words.length; i++) {\n            for (char c : words[i].toCharArray()) {\n                if (c == x) {\n                    result.add(i);\n                    break;\n                }\n            }\n        }\n        return result;\n    }\n}\n    <\/code><\/pre>\n  <\/div>\n\n  <!-- Python -->\n  <div class=\"wp_blog_code-tab-content\" data-lang=\"py\">\n    <pre><code class=\"language-python\">\nclass Solution(object):\n    def findWordsContaining(self, words, x):\n        result = []\n        for i, word in enumerate(words):\n            for ch in word:\n                if ch == x:\n                    result.append(i)\n                    break\n        return result\n    <\/code><\/pre>\n  <\/div>\n\n  <!-- C# -->\n  <div class=\"wp_blog_code-tab-content\" data-lang=\"csharp\">\n    <pre><code class=\"language-csharp\">\npublic class Solution {\n    public IList&lt;int&gt; FindWordsContaining(string[] words, char x) {\n        var result = new List&lt;int&gt;();\n        for (int i = 0; i &lt; words.Length; i++) {\n            foreach (char c in words[i]) {\n                if (c == x) {\n                    result.Add(i);\n                    break;\n                }\n            }\n        }\n        return result;\n    }\n}\n    <\/code><\/pre>\n  <\/div>\n<\/div>\n\n<script>\n  document.addEventListener('DOMContentLoaded', () => {\n    const buttons = document.querySelectorAll('.wp_blog_code-tab-button');\n    const contents = document.querySelectorAll('.wp_blog_code-tab-content');\n    buttons.forEach(button => {\n      button.addEventListener('click', () => {\n        const lang = button.getAttribute('data-lang');\n        buttons.forEach(btn => btn.classList.remove('active'));\n        contents.forEach(content => content.classList.remove('active'));\n        button.classList.add('active');\n        document.querySelector(`.wp_blog_code-tab-content[data-lang=\"${lang}\"]`).classList.add('active');\n      });\n    });\n  });\n<\/script>\n\n","protected":false},"excerpt":{"rendered":"<p>Problem Statement: You are given a 0-indexed array of strings words and a character x. Return an array of indices representing the words that contain the character x. The returned array can be in any order. Example: Input: words = [&#8220;leet&#8221;, &#8220;code&#8221;], x = &#8220;e&#8221;Output: [0, 1] Input: words = [&#8220;abc&#8221;, &#8220;bcd&#8221;, &#8220;aaaa&#8221;, &#8220;cbc&#8221;], x<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"om_disable_all_campaigns":false,"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"footnotes":""},"categories":[260,176,245,810,174,172,173],"tags":[],"class_list":{"0":"post-7309","1":"post","2":"type-post","3":"status-publish","4":"format-standard","6":"category-c-c-plus-plus","7":"category-csharp","8":"category-data-science-and-machine-learning","9":"category-dsa","10":"category-java","11":"category-javascript","12":"category-python"},"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/7309","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/comments?post=7309"}],"version-history":[{"count":1,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/7309\/revisions"}],"predecessor-version":[{"id":7310,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/7309\/revisions\/7310"}],"wp:attachment":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/media?parent=7309"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/categories?post=7309"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/tags?post=7309"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}