Given two strings s and t, write a method to determine if t is an anagram of s. An anagram is a word or phrase formed by rearranging the letters of a different word or phrase, using all original letters exactly once.

Examples

Example 1:

  • Input: s = "listen", t = "silent"
  • Output: true

Example 2:

  • Input: s = "hello", t = "bello"
  • Output: false

Example 3:

  • Input: s = "triangle", t = "integral"
  • Output: true

Example 4:

  • Input: s = "rat", t = "car"
  • Output: false
Apex Code Editor
Sign in to Submit

Welcome to Lightning Challenge!

Create an Account

Sign up to track your progress, earn points, and compete with others. Your solutions will be saved automatically.

Create account

How It Works

  • • Write your solution in the code editor
  • • Connect your Salesforce org to test
  • • Submit to check if your solution passes
  • • Use hints if you get stuck

Contest Alert

🏆 #CodeEveryDay Jan 2026

Contest runs January 1 - 31. Complete challenges to climb the leaderboard!

Points are calculated for challenges completed during the contest period.