{"id":7476,"date":"2025-07-02T15:00:58","date_gmt":"2025-07-02T09:30:58","guid":{"rendered":"https:\/\/namastedev.com\/blog\/?p=7476"},"modified":"2025-07-02T15:00:58","modified_gmt":"2025-07-02T09:30:58","slug":"split-a-string-in-balanced-strings","status":"publish","type":"post","link":"https:\/\/namastedev.com\/blog\/split-a-string-in-balanced-strings\/","title":{"rendered":"Split a string in balanced strings"},"content":{"rendered":"\n<!-- Prism.js CSS and JS -->\n<link\n  href=\"https:\/\/cdn.jsdelivr.net\/npm\/prismjs@1.29.0\/themes\/prism-tomorrow.css\"\n  rel=\"stylesheet\"\n\/>\n<script src=\"https:\/\/cdn.jsdelivr.net\/npm\/prismjs@1.29.0\/prism.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_code-tabs-container {\n    font-family: \"Segoe UI\", sans-serif !important;\n    max-width: 900px !important;\n    margin: 2rem auto !important;\n    border: 1px solid #ddd !important;\n    border-radius: 8px !important;\n    overflow: hidden !important;\n    background-color: white !important;\n  }\n\n  .wp_blog_code-tabs-header {\n    background: #f7f7f7 !important;\n    display: flex !important;\n    border-bottom: 1px solid #ddd !important;\n  }\n\n  .wp_blog_code-tab-button {\n    flex: 1 !important;\n    padding: 10px 15px !important;\n    border: none !important;\n    background: transparent !important;\n    cursor: pointer !important;\n    font-weight: bold !important;\n    transition: background 0.2s !important;\n    color: #242b33 !important;\n  }\n\n  .wp_blog_code-tab-button.active {\n    background: white !important;\n    border-bottom: 3px solid #0073aa !important;\n  }\n\n  .wp_blog_code-tab-content {\n    display: none !important;\n    padding: 20px !important;\n    background: #242b33 !important;\n  }\n\n  .wp_blog_code-tab-content > pre {\n    background: #242b33 !important;\n  }\n\n  .wp_blog_code-tab-content.active {\n    display: block !important;\n  }\n\n  .wp_blog_code-tab-content pre {\n    margin: 0 !important;\n    overflow-x: auto !important;\n  }\n\n  .wp_blog_explanation {\n    max-width: 900px !important;\n    margin: 2rem auto !important;\n    font-family: \"Segoe UI\", sans-serif !important;\n    line-height: 1.6 !important;\n    background: white !important;\n    color: black !important;\n    padding: 1rem !important;\n    border-radius: 8px !important;\n  }\n\n  .wp_blog_explanation h2 {\n    color: #0073aa !important;\n    font-size: 1.5rem !important;\n    margin-bottom: 0.5rem !important;\n  }\n\n  .wp_blog_explanation code {\n    background: #f1f1f1 !important;\n    padding: 2px 6px !important;\n    border-radius: 4px !important;\n    font-family: monospace !important;\n  }\n\n  .wp_blog_explanation h1,\n  .wp_blog_explanation h2,\n  .wp_blog_explanation h3,\n  .wp_blog_explanation h4,\n  .wp_blog_explanation h5,\n  .wp_blog_explanation h6,\n  .wp_blog_explanation p {\n    margin-top: 10px !important;\n    margin-bottom: 10px !important;\n  }\n<\/style>\n\n<div class=\"wp_blog_explanation\">    <p>\n      Despite the title, this problem focuses on finding the length of the last word in a given string.\n      A word is defined as a sequence of non-space characters. The string may contain leading, trailing,\n      or multiple spaces between words. The goal is to ignore these extra spaces and return the length of the final word.\n    <\/p>\n  \n    <h2>Steps<\/h2>\n    <ul>\n      <li>Start from the end of the string.<\/li>\n      <li>Skip any trailing spaces.<\/li>\n      <li>Once a non-space character is found, start counting characters.<\/li>\n      <li>Stop counting when a space is found after starting the count.<\/li>\n      <li>Return the total count.<\/li>\n    <\/ul>\n  \n    <h2>Dry Run<\/h2>\n    <p><strong>Input:<\/strong> <code>s = \"  Hello   World     \"<\/code><\/p>\n    <ol>\n      <li>Start from the end \u2192 skip spaces<\/li>\n      <li>Start counting at &#8216;d&#8217; of &#8220;World&#8221;<\/li>\n      <li>Count characters: d, l, r, o, W \u2192 <code>5<\/code><\/li>\n      <li>Stop at space \u2192 return <code>5<\/code><\/li>\n    <\/ol>\n  \n    <h2>Time &#038; Space Complexity<\/h2>\n    <ul>\n      <li><strong>Time Complexity:<\/strong> O(n), where n is the length of the string<\/li>\n      <li><strong>Space Complexity:<\/strong> O(1), uses constant space<\/li>\n    <\/ul>\n  <\/div>\n  \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=\"cpp\">C++<\/button>\n      <button class=\"wp_blog_code-tab-button\" data-lang=\"c\">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    <\/div>\n  \n    <!-- JavaScript -->\n    <div class=\"wp_blog_code-tab-content active\" data-lang=\"js\">\n      <pre><code class=\"language-javascript\">\n  var lengthOfLastWord = function (s) {\n      let n = s.length - 1\n      let count = 0\n      while (n >= 0) {\n          if (s[n] != \" \") {\n              ++count\n          } else if (count > 0) {\n              break\n          }\n          --n\n      }\n      return count\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\">\n  #include &lt;iostream>\n  #include &lt;string>\n  #include &lt;unordered_map>\n  using namespace std;\n  \n  int maxFreqSum(string s) {\n      unordered_map&lt;char,int> freq;\n      for (char c : s) freq[c]++;\n  \n      string vowels = \"aeiou\";\n      int maxV = 0, maxC = 0;\n  \n      for (auto &p : freq) {\n          char ch = p.first;\n          int cnt = p.second;\n          if (vowels.find(ch) != string::npos) {\n              maxV = max(maxV, cnt);\n          } else {\n              maxC = max(maxC, cnt);\n          }\n      }\n  \n      return maxV + maxC;\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\">\n  #include &lt;stdio.h>\n  #include &lt;string.h>\n  #include &lt;ctype.h>\n  \n  int maxFreqSum(char* s) {\n      int freq[256] = {0};\n      for (int i = 0; s[i]; i++) freq[(unsigned char)s[i]]++;\n  \n      char* vowels = \"aeiou\";\n      int maxV = 0, maxC = 0;\n  \n      for (int i = 0; s[i]; i++) {\n          unsigned char ch = s[i];\n          if (strchr(vowels, ch)) {\n              if (freq[ch] > maxV) maxV = freq[ch];\n          } else if (isalpha(ch)) {\n              if (freq[ch] > maxC) maxC = freq[ch];\n          }\n      }\n  \n      return maxV + maxC;\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\">\n  import java.util.*;\n  \n  public class Solution {\n      public int maxFreqSum(String s) {\n          Map&lt;Character,Integer> freq = new HashMap<>();\n          for (char c : s.toCharArray())\n              freq.put(c, freq.getOrDefault(c,0) + 1);\n  \n          Set&lt;Character> vowels = Set.of('a','e','i','o','u');\n          int maxV = 0, maxC = 0;\n  \n          for (var entry : freq.entrySet()) {\n              char ch = entry.getKey();\n              int cnt = entry.getValue();\n              if (vowels.contains(ch)) {\n                  maxV = Math.max(maxV, cnt);\n              } else {\n                  maxC = Math.max(maxC, cnt);\n              }\n          }\n  \n          return maxV + maxC;\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\">\n  def maxFreqSum(s):\n      from collections import Counter\n      freq = Counter(s)\n      vowels = set('aeiou')\n  \n      maxV = max((freq[ch] for ch in freq if ch in vowels), default=0)\n      maxC = max((freq[ch] for ch in freq if ch not in vowels), default=0)\n  \n      return maxV + maxC\n      <\/code><\/pre>\n    <\/div>\n  <\/div>\n  \n  \n  \n\n<a href=\"https:\/\/leetcode.com\/problems\/two-sum\/description\/\" target=\"blank\"\n  >Solve this problem.<\/a\n>\n<script>\n  document.addEventListener(\"DOMContentLoaded\", function () {\n    const buttons = document.querySelectorAll(\".wp_blog_code-tab-button\");\n    const contents = document.querySelectorAll(\".wp_blog_code-tab-content\");\n\n    buttons.forEach((button) => {\n      button.addEventListener(\"click\", () => {\n        const lang = button.getAttribute(\"data-lang\");\n\n        buttons.forEach((btn) => btn.classList.remove(\"active\"));\n        button.classList.add(\"active\");\n\n        contents.forEach((content) => {\n          content.classList.toggle(\n            \"active\",\n            content.getAttribute(\"data-lang\") === lang\n          );\n        });\n      });\n    });\n  });\n<\/script>\n\n","protected":false},"excerpt":{"rendered":"<p>Despite the title, this problem focuses on finding the length of the last word in a given string. A word is defined as a sequence of non-space characters. The string may contain leading, trailing, or multiple spaces between words. The goal is to ignore these extra spaces and return the length of the final word.<\/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":[1],"tags":[],"class_list":{"0":"post-7476","1":"post","2":"type-post","3":"status-publish","4":"format-standard","6":"category-uncategorized"},"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/7476","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=7476"}],"version-history":[{"count":1,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/7476\/revisions"}],"predecessor-version":[{"id":7487,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/7476\/revisions\/7487"}],"wp:attachment":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/media?parent=7476"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/categories?post=7476"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/tags?post=7476"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}