@@ -0,0 +1,1169 @@
+package com.fishercoder.solutions;%0A%0A/**%0A * 1309. Decrypt String from Alphabet to Integer Mapping%0A *%0A * Given a string s formed by digits ('0' - '9') and '#' . We want to map s to English lowercase characters as follows:%0A * Characters ('a' to 'i') are represented by ('1' to '9') respectively.%0A * Characters ('j' to 'z') are represented by ('10#' to '26#') respectively.%0A * Return the string formed after mapping.%0A * It's guaranteed that a unique mapping will always exist.%0A *%0A * Example 1:%0A * Input: s = %2210#11#12%22%0A * Output: %22jkab%22%0A * Explanation: %22j%22 -%3E %2210#%22 , %22k%22 -%3E %2211#%22 , %22a%22 -%3E %221%22 , %22b%22 -%3E %222%22.%0A *%0A * Example 2:%0A * Input: s = %221326#%22%0A * Output: %22acz%22%0A *%0A * Example 3:%0A * Input: s = %2225#%22%0A * Output: %22y%22%0A *%0A * Example 4:%0A * Input: s = %2212345678910#11#12#13#14#15#16#17#18#19#20#21#22#23#24#25#26#%22%0A * Output: %22abcdefghijklmnopqrstuvwxyz%22%0A *%0A * Constraints:%0A * 1 %3C= s.length %3C= 1000%0A * s%5Bi%5D only contains digits letters ('0'-'9') and '#' letter.%0A * s will be valid string such that mapping is always possible.%0A * */%0Apublic class _1309 %7B%0A    public static class Solution1 %7B%0A        public String freqAlphabets(String s) %7B%0A            return %22%22;%0A        %7D%0A    %7D%0A%7D%0A

add skeleton for 1309