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
Welcome to Lightning Challenge!
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 October 2026 (Oct 4–15)Sponsored by FLXBL
Contest runs October 4 - 15. Complete challenges to climb the leaderboard!
Prizes 1 & 2: Salesforce certification exam voucher — won by random drawing, where every point is a ticket. see all prizes
Only the 12 daily challenges shown during this contest count toward points. Earlier dailies don't carry over.