mirror of
https://github.com/TheAlgorithms/Ruby
synced 2024-12-30 22:24:11 +01:00
42 lines
No EOL
734 B
Ruby
42 lines
No EOL
734 B
Ruby
# Challenge name: Is anagram
|
|
#
|
|
# Given two strings s and t , write a function to determine
|
|
# if t is an anagram of s.
|
|
#
|
|
# Note:
|
|
# You may assume the string contains only lowercase alphabets.
|
|
#
|
|
# Follow up:
|
|
# What if the inputs contain unicode characters?
|
|
# How would you adapt your solution to such case?
|
|
#
|
|
# @param {String} s
|
|
# @param {String} t
|
|
# @return {Boolean}
|
|
|
|
#
|
|
# Approach 1: Sort and Compare
|
|
#
|
|
# Time Complexity: O(n log n)
|
|
#
|
|
def is_anagram(s, t)
|
|
return false if s.length != t.length
|
|
|
|
arr1 = s.split('').sort
|
|
arr2 = t.split('').sort
|
|
|
|
arr1 == arr2
|
|
end
|
|
|
|
s = 'anagram'
|
|
t = 'nagaram'
|
|
puts(is_anagram(s, t))
|
|
# => true
|
|
s = 'rat'
|
|
t = 'car'
|
|
puts(is_anagram(s, t))
|
|
# => false
|
|
s = 'a'
|
|
t = 'ab'
|
|
puts(is_anagram(s, t))
|
|
# => false |