Find the Difference | LeetCode problem 389

Find the Difference
Leetcode problem number 389
Solution in JAVA
Time Complexity: O(n)
Space Complexity: O(1)
JAVA interview programming playlist:
• Interview Programming ...
Linkedin: / amrita-bala-a2b79460
#java #interviewquestions #leetcode

[@wllalsim123]

Nice 👍👍

[@jashanpreetsingh6056]

thanks

[@rhs9214]

What is the last step mam? Return char. Total;?

[@ashwinnair1035]

return (char)total;