JAVA EASY Solution WIth EXPLANATION
JAVA SOLUTION @DeepakKumar\n# In Case of Any Doubt Feel Free to ASK...\n\n\nclass Solution {\n    public List<Integer> addToArrayForm(int[] num, int k) {\n  // 
# JAVA SOLUTION @DeepakKumar\n# In Case of Any Doubt Feel Free to ASK...\n\n```\nclass Solution {\n    public List<Integer> addToArrayForm(int[] num, int k) {\n  // Create A List\n        List<Integer> list = new ArrayList<>();\n        // Start from Last index of num Array\n        /*\n                          INDEX -> 0 1 2\n        Explanation: let  num --> [2,3,2]\n                          k   -->  8947\n                     ADD num[LAST INDEX] + k  --> 2 + 8947 =  8949 --> k\'   ADD(9) to LIST\n                     Now ADD num[1] + (k\' % 10) --> 3 + 894 = 897   --> k\'   ADD(7) to LIST\n                     Now ADD num[0] + (k\' % 10) --> 2 + 89 = 91     --> k\'   ADD(1) to LIST\n                      k = k\' % 10 = 9\n                     At the End of the loop k != 0    So  \n                     Now ADD DIGITS of k to list FROM the END     --> ADD(9) to List\n                     Now k is 0 so END while Loop\n                     \n       At this point we have List as --> [9,7,1,9]  --> **Here NOTE that it is the REQUIRED ANS BUT **\n\t   IN REVERSE ORDER\n                     --> So, now REVERSE the LIST \n                     --> At the END return the Required List           \n         */\n        for(int i=num.length-1 ; i>=0;i--) {\n            int sum = num[i] + k;\n            list.add(sum % 10);\n            k = sum/ 10; \n        }\n        // if After Adding k in the Number  k is not ZERO then do this\n        while(k > 0){\n            list.add(k%10);\n            k /= 10;\n        }\n        // Now Reverse the LIST\n        Collections.reverse(list);\n        // AT the end Return the list\n        return list;\n    }\n}\n```
['Java']