Bernard Wong
  • Software Engineer
  • Problems
    • Lowest Common Ancestor of a Binary Tree
    • Longest Substring Without Repeating Characters
    • Longest Palindromic Substring
    • Longest Common Prefix
    • Isomorphic Strings
    • Integer to Roman
    • Frog Jump
    • Find the Difference
    • Find k closest elements to a given value
    • Longest Common Subsequence
    • Binary Search Tree from Sorted Array
    • Balanced Binary Tree
    • Sort Using Two Stacks
    • O(1) Stack
    • k-th element to last of a LinkedList
    • Dedup LinkedList
    • Check Rotated String
    • Compress String by Character Count
    • Escape HTML whitespace
    • Check String Permutation
    • Unique String
    • Container With Most Water
    • 4 Sum
    • 3 Sum Closest
    • 3 Sum
    • 2 Sum
    • Maximum Subarray
    • Nested List Weight Sum
    • Palindrome Number
    • Pow(x, n)
    • Regular Expression Matching
    • Remove Nth Node From End of List
    • Reverse Integer
    • Roman to Integer
    • Rotate Array
    • Search a 2D Matrix
    • Shortest Word Distance
    • Two Sum III - Data structure design
    • Valid Parentheses
    • ZigZag Conversion
    • Quicksort
    • Add Two Numbers
    • Best Time to Buy and Sell Stock
    • Letter Combinations of a Phone Number
  • Data Structures
    • Heap
Powered by GitBook
On this page
  1. Problems

Check String Permutation

Given two strings, write a method to decide if ones is a permutation of the other

import scala.collection.mutable.Map

def isPermutation(s1: String, s2: String): Boolean = {
  if (s1.length != s2.length) false
  else if (s1.isEmpty) true
  else {
    val charMap = Map[Char, Int]() withDefaultValue 0
    for (i <- 0 until s1.length; j <- 0 until s2.length) {
      charMap(s1(i)) += 1
      charMap(s2(j)) -= 1
    }
    charMap.values.forall(_ == 0)
  }
}

isPermutation("", "")
isPermutation("abcd", "dcba")
isPermutation("abcd", "ecba")

PreviousEscape HTML whitespaceNextUnique String

Last updated 6 years ago