package algorithms


/**
 * Two strings are an anagram of each other, if they contain the same letters, the same number of times,
 * possibly in a different order.
 * @return true if the given strings are anagrams of each other, ignoring capitalization; false otherwise.
 */
internal fun isAnagram(left: String, right: String): Boolean {
    if (left.length != right.length) {
        //Not the same length so not an anagram
        return false
    }
    //To lowercase both values
    val leftString = left.toLowerCase()
    val rightString = right.toLowerCase()
    //Sort and compare
    return leftString.sort() == rightString.sort()
}

/**
 * @return the given string, with it's letters sorted in alphabetical order.
 */
internal fun String.sort(): String = toCharArray().sorted().joinToString("")

/**
 * @return true if all characters in the given String are unique; false otherwise
 */
internal fun String?.hasUniqueCharacters(withDataStructure: Boolean = true): Boolean = if (this == null) {
    false
} else {
    if (withDataStructure) hasUniqueCharactersUsingDataStructure(this) else hasUniqueCharactersUsingNoDataStructure(this)
}

/**
 * Implements [hasUniqueCharacters] using no additional data structure.
 */
private fun hasUniqueCharactersUsingNoDataStructure(value: String): Boolean {
    //We'll go through each character and compare it to the rest of the characters, resulting in O(n)
    val characters = value.toLowerCase().toCharArray()
    for ((outerIndex, outerCharacter) in characters.withIndex()) {
        for ((innerIndex, innerCharacter) in characters.withIndex()) {
            if (innerIndex != outerIndex && outerCharacter == innerCharacter) {
                return false
            }
        }
    }
    return true
}

/**
 * Implements [hasUniqueCharacters] with additional data structure.
 */
private fun hasUniqueCharactersUsingDataStructure(value: String): Boolean {
    var set = mutableSetOf<Char>()
    value.toCharArray().forEach { character -> set = set.plus(character.toLowerCase()).toMutableSet() }
    return set.size == value.length
}

internal fun stringToInteger(value: String): Int {
    //Check if the first non-whitespace character is a digit or +/- - otherwise we'll return 0
    val valueTrimmed = value.trimStart()
    if (valueTrimmed.isEmpty()) {
        return 0
    }
    val isNotDigit = !valueTrimmed[0].isDigit()
    val isPlus = valueTrimmed[0] == '+'
    val isMinus = valueTrimmed[0] == '-'
    if ((valueTrimmed.length == 1 && (isPlus || isMinus)) ||
        (isNotDigit && !isPlus && !isMinus)
    ) {
        return 0
    }

    //First check if there is a plus symbol
    var numberAsString = value.replace("[^\\d-.]".toRegex(), "")
    println(numberAsString)
    return try {
        //If the resulting string contains a dot we remove everything after the dot
        val indexOfDot = numberAsString.indexOf('.', 0)
        if (indexOfDot >= 0) {
            //We got a dot, cut it off and everything after it
            numberAsString = numberAsString.substring(0, indexOfDot)
        }
        numberAsString.toInt()
    } catch (e: NumberFormatException) {
        //We know its a valid number, so it must be out of range, return [Int.MIN_VALUE]
        Int.MIN_VALUE
    }
}

/**
 * Given two strings s and t, determine if they are isomorphic.
 * Two strings are isomorphic if the characters in s can be replaced to get t.
 * All occurrences of a character must be replaced with another character while preserving the order of characters.
 * No two characters may map to the same character but a character may map to itself.
 */
internal fun isIsomorphicString(left: String, right: String): Boolean {
    val mapLeftToRight = mutableMapOf<Char, Char>()
    left.forEachIndexed { index, value ->
        if (mapLeftToRight.containsKey(value)) {
            //We already have a mapping, check if it's correct
            if (right[index] != mapLeftToRight[value]) {
                return false
            }
        } else {
            val characterRight = right[index]
            //Make sure the character in the right string hasn't been mapped to any other character yet
            if (mapLeftToRight.values.contains(characterRight)) {
                return false
            }
            //Add a mapping
            mapLeftToRight[value] = characterRight
        }
    }
    return true
}

/**
 * Given a string, find the length of the longest substring without repeating characters.
 *
 * This falls into the "sliding window" category. We have two pointers and we'll keep advancing the right-hand
 * pointer until we hit a duplicate. Once we do, we advance the left-hand pointer until we no longer have duplicates, then
 * we continue with the right pointer.
 */
internal fun longestSubStringWithoutRepeatingCharacters(input: String): Int {
    val lastIndex = mutableMapOf<Char, Int>()
    var max = 0
    var startIndex = -1
    for ((index, character) in input.withIndex()) {
        val lastIndex = lastIndex.put(character, index)
        if (lastIndex != null && lastIndex > startIndex) {
            startIndex = lastIndex
        }
        if (index - startIndex > max) {
            max = index - startIndex
        }
    }
    return max
}
package algorithms


/**
 * Two strings are an anagram of each other, if they contain the same letters, the same number of times,
 * possibly in a different order.
 * @return true if the given strings are anagrams of each other, ignoring capitalization; false otherwise.
 */
internal fun isAnagram(left: String, right: String): Boolean {
    if (left.length != right.length) {
        //Not the same length so not an anagram
        return false
    }
    //To lowercase both values
    val leftString = left.toLowerCase()
    val rightString = right.toLowerCase()
    //Sort and compare
    return leftString.sort() == rightString.sort()
}

/**
 * @return the given string, with it's letters sorted in alphabetical order.
 */
internal fun String.sort(): String = toCharArray().sorted().joinToString("")

/**
 * @return true if all characters in the given String are unique; false otherwise
 */
internal fun String?.hasUniqueCharacters(withDataStructure: Boolean = true): Boolean = if (this == null) {
    false
} else {
    if (withDataStructure) hasUniqueCharactersUsingDataStructure(this) else hasUniqueCharactersUsingNoDataStructure(this)
}

/**
 * Implements [hasUniqueCharacters] using no additional data structure.
 */
private fun hasUniqueCharactersUsingNoDataStructure(value: String): Boolean {
    //We'll go through each character and compare it to the rest of the characters, resulting in O(n)
    val characters = value.toLowerCase().toCharArray()
    for ((outerIndex, outerCharacter) in characters.withIndex()) {
        for ((innerIndex, innerCharacter) in characters.withIndex()) {
            if (innerIndex != outerIndex && outerCharacter == innerCharacter) {
                return false
            }
        }
    }
    return true
}

/**
 * Implements [hasUniqueCharacters] with additional data structure.
 */
private fun hasUniqueCharactersUsingDataStructure(value: String): Boolean {
    var set = mutableSetOf<Char>()
    value.toCharArray().forEach { character -> set = set.plus(character.toLowerCase()).toMutableSet() }
    return set.size == value.length
}

internal fun stringToInteger(value: String): Int {
    //Check if the first non-whitespace character is a digit or +/- - otherwise we'll return 0
    val valueTrimmed = value.trimStart()
    if (valueTrimmed.isEmpty()) {
        return 0
    }
    val isNotDigit = !valueTrimmed[0].isDigit()
    val isPlus = valueTrimmed[0] == '+'
    val isMinus = valueTrimmed[0] == '-'
    if ((valueTrimmed.length == 1 && (isPlus || isMinus)) ||
        (isNotDigit && !isPlus && !isMinus)
    ) {
        return 0
    }

    //First check if there is a plus symbol
    var numberAsString = value.replace("[^\\d-.]".toRegex(), "")
    println(numberAsString)
    return try {
        //If the resulting string contains a dot we remove everything after the dot
        val indexOfDot = numberAsString.indexOf('.', 0)
        if (indexOfDot >= 0) {
            //We got a dot, cut it off and everything after it
            numberAsString = numberAsString.substring(0, indexOfDot)
        }
        numberAsString.toInt()
    } catch (e: NumberFormatException) {
        //We know its a valid number, so it must be out of range, return [Int.MIN_VALUE]
        Int.MIN_VALUE
    }
}

/**
 * Given two strings s and t, determine if they are isomorphic.
 * Two strings are isomorphic if the characters in s can be replaced to get t.
 * All occurrences of a character must be replaced with another character while preserving the order of characters.
 * No two characters may map to the same character but a character may map to itself.
 */
internal fun isIsomorphicString(left: String, right: String): Boolean {
    val mapLeftToRight = mutableMapOf<Char, Char>()
    left.forEachIndexed { index, value ->
        if (mapLeftToRight.containsKey(value)) {
            //We already have a mapping, check if it's correct
            if (right[index] != mapLeftToRight[value]) {
                return false
            }
        } else {
            val characterRight = right[index]
            //Make sure the character in the right string hasn't been mapped to any other character yet
            if (mapLeftToRight.values.contains(characterRight)) {
                return false
            }
            //Add a mapping
            mapLeftToRight[value] = characterRight
        }
    }
    return true
}

/**
 * Given a string, find the length of the longest substring without repeating characters.
 *
 * This falls into the "sliding window" category. We have two pointers and we'll keep advancing the right-hand
 * pointer until we hit a duplicate. Once we do, we advance the left-hand pointer until we no longer have duplicates, then
 * we continue with the right pointer.
 */
internal fun longestSubStringWithoutRepeatingCharacters(input: String): Int {
    val lastIndex = mutableMapOf<Char, Int>()
    var max = 0
    var startIndex = -1
    for ((index, character) in input.withIndex()) {
        val lastIndex = lastIndex.put(character, index)
        if (lastIndex != null && lastIndex > startIndex) {
            startIndex = lastIndex
        }
        if (index - startIndex > max) {
            max = index - startIndex
        }
    }
    return max
}