Join devRant
Do all the things like
++ or -- rants, post your own rants, comment on others' rants and build your customized dev avatar
Sign Up
Pipeless API
From the creators of devRant, Pipeless lets you power real-time personalized recommendations and activity feeds using a simple API
Learn More
Did 2 leetcodes today. (will be more in future)
https://leetcode.com/problems/...
I remember I did something similar. The idea is that converting single letter to number, so sum2 - sum1 = the_added_letter
https://leetcode.com/problems/...
Don't know how to do it, so copy the answer. (I copy the answers most of the time) The idea is that on the same level, we sum the left or keep going down to left. For right, we just go down there. Little trick is that we use root.left.left or root.left.right.
rant