String encoding challenge solution
Description Given a non empty string, encode the string such that its encoded length is the shortest. The encoding rule is: k[encoded string] , where the e
Tag: code challenges
String decompression challenge solution
I am sharing my solution in Java to one of the former Google interview questions, which is posted by Google itself here: https://techdevguide.withgoogle.co