{"id":7482,"date":"2025-07-02T15:12:02","date_gmt":"2025-07-02T09:42:02","guid":{"rendered":"https:\/\/namastedev.com\/blog\/?p=7482"},"modified":"2025-07-22T21:43:19","modified_gmt":"2025-07-22T16:13:19","slug":"valid-anagram","status":"publish","type":"post","link":"https:\/\/namastedev.com\/blog\/valid-anagram\/","title":{"rendered":"Valid Anagram"},"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\n\n<div class=\"wp_blog_explanation\">\n    <p>\n      This problem checks whether two strings are anagrams of each other. Two strings are anagrams if they contain the exact same characters with the same frequency but possibly in a different order.\n    <\/p>\n  \n    <h2>Steps<\/h2>\n    <ul>\n      <li>First, check if the lengths of both strings are equal. If not, return <code>false<\/code>.<\/li>\n      <li>Create a hashmap (or character counter) to store the frequency of characters in the first string.<\/li>\n      <li>Iterate over the second string and decrease the corresponding frequency in the map.<\/li>\n      <li>If a character is not found or the count goes below zero, return <code>false<\/code>.<\/li>\n      <li>If all characters match, return <code>true<\/code> at the end.<\/li>\n    <\/ul>\n  \n    <h2>Dry Run<\/h2>\n    <p><strong>Input:<\/strong> <code>s = \"anagram\"<\/code>, <code>t = \"nagaram\"<\/code><\/p>\n    <ol>\n      <li>Build map from <code>s<\/code>: <code>{a:3, n:1, g:1, r:1, m:1}<\/code><\/li>\n      <li>Scan <code>t<\/code>:\n        <ul>\n          <li>n \u2192 found \u2192 decrement<\/li>\n          <li>a \u2192 found \u2192 decrement<\/li>\n          <li>g \u2192 found \u2192 decrement<\/li>\n          <li>a \u2192 found \u2192 decrement<\/li>\n          <li>r \u2192 found \u2192 decrement<\/li>\n          <li>a \u2192 found \u2192 decrement<\/li>\n          <li>m \u2192 found \u2192 decrement<\/li>\n        <\/ul>\n      <\/li>\n      <li>All values are zero \u2192 return <code>true<\/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 strings<\/li>\n      <li><strong>Space Complexity:<\/strong> O(1), since the character set is limited to 26 lowercase letters<\/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=\"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 isAnagram = function(s, t) {\n      if (s.length !== t.length) return false;\n  \n      let map = {};\n  \n      for (let i = 0; i < s.length; i++) {\n          if (!map[s[i]]) {\n              map[s[i]] = 1;\n          } else {\n              ++map[s[i]];\n          }\n      }\n  \n      for (let i = 0; i < t.length; i++) {\n          if (!map[t[i]] || map[t[i]] === 0) {\n              return false;\n          } else {\n              --map[t[i]];\n          }\n      }\n  \n      return true;\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&gt;\n  #include &lt;unordered_map&gt;\n  using namespace std;\n  \n  bool isAnagram(string s, string t) {\n      if (s.length() != t.length()) return false;\n  \n      unordered_map&lt;char, int&gt; map;\n  \n      for (char c : s) {\n          map[c]++;\n      }\n  \n      for (char c : t) {\n          if (map.find(c) == map.end() || map[c] == 0)\n              return false;\n          map[c]--;\n      }\n  \n      return true;\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&gt;\n  #include &lt;string.h&gt;\n  \n  int isAnagram(char* s, char* t) {\n      if (strlen(s) != strlen(t)) return 0;\n  \n      int map[256] = {0};\n  \n      for (int i = 0; s[i]; i++) {\n          map[(int)s[i]]++;\n      }\n  \n      for (int i = 0; t[i]; i++) {\n          if (map[(int)t[i]] == 0) return 0;\n          map[(int)t[i]]--;\n      }\n  \n      return 1;\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.HashMap;\n  \n  public class Solution {\n      public boolean isAnagram(String s, String t) {\n          if (s.length() != t.length()) return false;\n  \n          HashMap&lt;Character, Integer&gt; map = new HashMap&lt;&gt;();\n  \n          for (char c : s.toCharArray()) {\n              map.put(c, map.getOrDefault(c, 0) + 1);\n          }\n  \n          for (char c : t.toCharArray()) {\n              if (!map.containsKey(c) || map.get(c) == 0) {\n                  return false;\n              }\n              map.put(c, map.get(c) - 1);\n          }\n  \n          return true;\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 isAnagram(s: str, t: str) -> bool:\n      if len(s) != len(t):\n          return False\n  \n      map = {}\n  \n      for ch in s:\n          map[ch] = map.get(ch, 0) + 1\n  \n      for ch in t:\n          if ch not in map or map[ch] == 0:\n              return False\n          map[ch] -= 1\n  \n      return True\n      <\/code><\/pre>\n    <\/div>\n  <\/div>\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>This problem checks whether two strings are anagrams of each other. Two strings are anagrams if they contain the exact same characters with the same frequency but possibly in a different order. Steps First, check if the lengths of both strings are equal. If not, return false. Create a hashmap (or character counter) to store<\/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":[322,176,175,211,174,172,173],"tags":[],"class_list":{"0":"post-7482","1":"post","2":"type-post","3":"status-publish","4":"format-standard","6":"category-algorithms-and-data-structures","7":"category-csharp","8":"category-cplusplus","9":"category-data-structures","10":"category-java","11":"category-javascript","12":"category-python"},"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/7482","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=7482"}],"version-history":[{"count":1,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/7482\/revisions"}],"predecessor-version":[{"id":7495,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/7482\/revisions\/7495"}],"wp:attachment":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/media?parent=7482"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/categories?post=7482"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/tags?post=7482"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}