Day 14 - Perform String Shifts

Solution.kt

// https://leetcode.com/explore/featured/card/30-day-leetcoding-challenge/529/week-2/3299/

class Solution {
    fun stringShift(s: String, shift: Array<IntArray>): String {
        val singleShift: Pair<Int, Int> = calculateSingleShift(shift)
        return shiftCharacters(s, singleShift.first, singleShift.second % s.length)
    }
    
    fun shiftCharacters(s: String, direction: Int, n: Int): String {
        if (n == 0) {
            return s
        }
        
        val a: String
        val b: String
        
        if (direction == 1) {
            a = s.substring(0, s.length - n)
            b = s.substring(s.length - n, s.length)
        } else {
            a = s.substring(0, n)
            b = s.substring(n, s.length)
        }
        
        return b + a
    }
    
    fun calculateSingleShift(shifts: Array<IntArray>): Pair<Int, Int> {
        var shiftCounter = 0
        
        for (shift in shifts) {
            val multiplier = if (shift[0] == 0) -1 else 1
            shiftCounter += shift[1] * multiplier
        } 
        
        when {
            shiftCounter < 0 -> return Pair(0, -shiftCounter)
            else             -> return Pair(1, shiftCounter)
        }
    }
}