#!/usr/bin/env python
# coding: utf-8

# <h1>242. Valid Anagram</h1>
# <hr>
# 
# <!--Copy Paste Leetcode statement between-->
# <p>Given two strings <em>s</em> and <em>t&nbsp;</em>, write a function to determine if <em>t</em> is an anagram of <em>s</em>.</p>
# 
# <p><b>Example 1:</b></p>
# 
# <pre><b>Input:</b> <em>s</em> = "anagram", <em>t</em> = "nagaram"
# <b>Output:</b> true
# </pre>
# 
# <p><b>Example 2:</b></p>
# 
# <pre><b>Input:</b> <em>s</em> = "rat", <em>t</em> = "car"
# <b>Output: </b>false
# </pre>
# 
# <p><strong>Note:</strong><br>
# You may assume the string contains only lowercase alphabets.</p>
# <!--Copy Paste Leetcode statement between-->
# 
# <p>&nbsp;</p>
# <a href="https://leetcode.com/problems/valid-anagram/">Source</a> 
# <hr>
# 
# <h4>Code</h4>

# In[1]:


def is_anagram(s, t):
    pass


# <hr>
# <h4>Follow up:</h4>
# <p>What if the inputs contain unicode characters? How would you adapt your solution to such case?</p>
# 
# <h4>Code</h4>

# In[1]:


def is_anagram(s, t):
    pass