{"id":7484,"date":"2025-07-02T15:19:41","date_gmt":"2025-07-02T09:49:41","guid":{"rendered":"https:\/\/namastedev.com\/blog\/?p=7484"},"modified":"2025-07-22T21:40:21","modified_gmt":"2025-07-22T16:10:21","slug":"group-anagrams-approach-1-sorted-key","status":"publish","type":"post","link":"https:\/\/namastedev.com\/blog\/group-anagrams-approach-1-sorted-key\/","title":{"rendered":"Group Anagrams &#8211; Approach 1 &#8211; Sorted Key"},"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\">\n    <p>\n      The goal is to group words that are anagrams of each other. An anagram is a word formed by rearranging the letters of another word. This approach uses a sorted version of each string as a unique key to group anagrams together.\n    <\/p>\n  \n    <h2>Steps<\/h2>\n    <ul>\n      <li>Initialize a hashmap to store grouped anagrams.<\/li>\n      <li>For each word in the input list:<\/li>\n      <ul>\n        <li>Sort the characters in the word alphabetically.<\/li>\n        <li>Use the sorted string as a key.<\/li>\n        <li>Add the original word to the list at that key.<\/li>\n      <\/ul>\n      <li>Return all grouped lists of anagrams from the hashmap.<\/li>\n    <\/ul>\n  \n    <h2>Dry Run<\/h2>\n    <p><strong>Input:<\/strong> <code>[\"eat\", \"tea\", \"tan\", \"ate\", \"nat\", \"bat\"]<\/code><\/p>\n    <ol>\n      <li>Sorted Keys: &#8220;aet&#8221; \u2192 [&#8220;eat&#8221;, &#8220;tea&#8221;, &#8220;ate&#8221;], &#8220;ant&#8221; \u2192 [&#8220;tan&#8221;, &#8220;nat&#8221;], &#8220;abt&#8221; \u2192 [&#8220;bat&#8221;]<\/li>\n      <li>Return: <code>[[\"eat\",\"tea\",\"ate\"],[\"tan\",\"nat\"],[\"bat\"]]<\/code><\/li>\n    <\/ol>\n  \n    <h2>Time &#038; Space Complexity<\/h2>\n    <ul>\n      <li><strong>Time Complexity:<\/strong> O(n\u00b7k\u00b7log\u202fk), where n is the number of strings and k is the average length of each string (due to sorting)<\/li>\n      <li><strong>Space Complexity:<\/strong> O(n\u00b7k), for storing grouped anagrams<\/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 groupAnagrams = function(strs) {\n      let map = {};\n  \n      for (let i = 0; i < strs.length; i++) {\n          let sortedStr = strs[i].split(\"\").sort().join(\"\"); \n  \n          if (!map[sortedStr]) {\n              map[sortedStr] = [strs[i]];\n          } else {\n              map[sortedStr].push(strs[i]);\n          }\n      }\n  \n      return Object.values(map);\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;vector&gt;\n  #include &lt;unordered_map&gt;\n  #include &lt;algorithm&gt;\n  using namespace std;\n  \n  vector&lt;vector&lt;string&gt;&gt; groupAnagrams(vector&lt;string&gt;& strs) {\n      unordered_map&lt;string, vector&lt;string&gt;&gt; map;\n  \n      for (string str : strs) {\n          string key = str;\n          sort(key.begin(), key.end());\n          map[key].push_back(str);\n      }\n  \n      vector&lt;vector&lt;string&gt;&gt; result;\n      for (auto entry : map) {\n          result.push_back(entry.second);\n      }\n  \n      return result;\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  \/\/ C doesn't support hashmaps easily; typically this problem is solved in higher-level languages.\n  \/\/ You can implement it with a custom hashmap or simulate it in practice using arrays + sorting.\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 List&lt;List&lt;String&gt;&gt; groupAnagrams(String[] strs) {\n          Map&lt;String, List&lt;String&gt;&gt; map = new HashMap&lt;&gt;();\n  \n          for (String str : strs) {\n              char[] arr = str.toCharArray();\n              Arrays.sort(arr);\n              String key = new String(arr);\n  \n              if (!map.containsKey(key)) {\n                  map.put(key, new ArrayList&lt;&gt;());\n              }\n  \n              map.get(key).add(str);\n          }\n  \n          return new ArrayList&lt;&gt;(map.values());\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  from collections import defaultdict\n  \n  def groupAnagrams(strs):\n      anagrams = defaultdict(list)\n  \n      for word in strs:\n          key = ''.join(sorted(word))\n          anagrams[key].append(word)\n  \n      return list(anagrams.values())\n      <\/code><\/pre>\n    <\/div>\n  <\/div>\n  \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>The goal is to group words that are anagrams of each other. An anagram is a word formed by rearranging the letters of another word. This approach uses a sorted version of each string as a unique key to group anagrams together. Steps Initialize a hashmap to store grouped anagrams. For each word in the<\/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-7484","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\/7484","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=7484"}],"version-history":[{"count":1,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/7484\/revisions"}],"predecessor-version":[{"id":7498,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/7484\/revisions\/7498"}],"wp:attachment":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/media?parent=7484"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/categories?post=7484"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/tags?post=7484"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}