package com.fishercoder.solutions;

/**
 * 880. Decoded String at Index
 *
 * An encoded string S is given.  To find and write the decoded string to a tape,
 * the encoded string is read one character at a time and the following steps are taken:
 * If the character read is a letter, that letter is written onto the tape.
 * If the character read is a digit (say d), the entire current tape is repeatedly written d-1 more times in total.
 * Now for some encoded string S, and an index K, find and return the K-th letter (1 indexed) in the decoded string.
 *
 * Example 1:
 * Input: S = "leet2code3", K = 10
 * Output: "o"
 * Explanation:
 * The decoded string is "leetleetcodeleetleetcodeleetleetcode".
 * The 10th letter in the string is "o".
 *
 * Example 2:
 * Input: S = "ha22", K = 5
 * Output: "h"
 * Explanation:
 * The decoded string is "hahahaha".  The 5th letter is "h".
 *
 * Example 3:
 * Input: S = "a2345678999999999999999", K = 1
 * Output: "a"
 * Explanation:
 * The decoded string is "a" repeated 8301530446056247680 times.  The 1st letter is "a".
 *
 * Note:
 * 2 <= S.length <= 100
 * S will only contain lowercase letters and digits 2 through 9.
 * S starts with a letter.
 * 1 <= K <= 10^9
 * The decoded string is guaranteed to have less than 2^63 letters.
 * */
public class _880 {
    public static class Solution1 {
        public String decodeAtIndex(String S, int K) {
            //TODO: implement it
            return "";
        }
    }
}

@@ -33,1257 +33,8 @@
 s;%0A%0A
-/**%0A * 880. Decoded String at Index%0A *%0A * An encoded string S is given.  To find and write the decoded string to a tape,%0A * the encoded string is read one character at a time and the following steps are taken:%0A * If the character read is a letter, that letter is written onto the tape.%0A * If the character read is a digit (say d), the entire current tape is repeatedly written d-1 more times in total.%0A * Now for some encoded string S, and an index K, find and return the K-th letter (1 indexed) in the decoded string.%0A *%0A * Example 1:%0A * Input: S = %22leet2code3%22, K = 10%0A * Output: %22o%22%0A * Explanation:%0A * The decoded string is %22leetleetcodeleetleetcodeleetleetcode%22.%0A * The 10th letter in the string is %22o%22.%0A *%0A * Example 2:%0A * Input: S = %22ha22%22, K = 5%0A * Output: %22h%22%0A * Explanation:%0A * The decoded string is %22hahahaha%22.  The 5th letter is %22h%22.%0A *%0A * Example 3:%0A * Input: S = %22a2345678999999999999999%22, K = 1%0A * Output: %22a%22%0A * Explanation:%0A * The decoded string is %22a%22 repeated 8301530446056247680 times.  The 1st letter is %22a%22.%0A *%0A * Note:%0A * 2 %3C= S.length %3C= 100%0A * S will only contain lowercase letters and digits 2 through 9.%0A * S starts with a letter.%0A * 1 %3C= K %3C= 10%5E9%0A * The decoded string is guaranteed to have less than 2%5E63 letters.%0A * */%0A
 publ

refactor 880