[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"searchBlogPosts":3,"$fPZJqxqxmCFk84CyvY7LI7QqsnIatKOYiLnLViABqJdY":7},[4],{"_path":5,"title":6},"\u002Fblog\u002F2023\u002F09\u002F17\u002Fspring-boot-postgresql","Spring Boot with PostgreSQL & pgAdmin in Docker",{"title":8,"category":9,"problemHtml":10,"solutions":11,"repoUrl":20},"Is Anagram","Data Structures & Algorithms","",[12,16],{"lang":13,"label":14,"html":15},"java","Java","\u003Cpre>\u003Ccode class=\"language-java\">class Solution {\n    public boolean isAnagram(String s, String t) {\n\n        if(s.length() != t.length()) return false;\n\n        int[] arr = new int[26];\n\n        for(char c : s.toCharArray()){\n            arr[c - 'a']++;\n        }\n\n        for(char c : t.toCharArray()){\n            arr[c - 'a']--;\n            if(arr[c - 'a'] < 0) return false;\n        }\n\n\n\n        return true;\n    }\n}\u003C\u002Fcode>\u003C\u002Fpre>",{"lang":17,"label":18,"html":19},"python","Python","\u003Cpre>\u003Ccode class=\"language-python\">class Solution:\n    def isAnagram(self, s: str, t: str) -> bool:\n        if len(s) != len(t):\n            return False\n        \n        map = {}\n\n        for i in range(len(s)):\n            if s[i] not in map:\n                map[s[i]] = 1\n            else: \n                map[s[i]] += 1\n\n            if t[i] not in map:\n                map[t[i]] = -1\n            else: \n                map[t[i]] -= 1\n            \n        \n        for v in map.values():\n            print(v)\n            if v != 0:\n                return False\n\n\n            \n            \n\n\n        return True\u003C\u002Fcode>\u003C\u002Fpre>","https:\u002F\u002Fgithub.com\u002Fvishwarajsali\u002FInterviewPrep\u002Ftree\u002Fmain\u002FData%20Structures%20%26%20Algorithms%2Fis-anagram"]