String Compression Problem in O(n) time complexity | Java interview question 

You explained very well... Pasting more simplified code: public static void main(String[] args) { String str = "w4a3d1e1x6"; StringBuilder strBuilder = new StringBuilder(); for (int i = 0; i < str.length(); i++) { char c = str.charAt(i); if (Character.isDigit(c)) { int j = (c - '0'); while (j != 0) { strBuilder.append(str.charAt(i - 1)); j--; } } } System.out.println("Output String: " + strBuilder); }

I need one help in your side

What if the input is w4s6w8a9