dsa-competitive-programming/leetcode/lc9/notes.md

An easy problem but with a common pitfall hence a tricky one. 
The idea is to only check till half of the number and not full where rev*10 exceeds int's range for larger values
Two pointer method is quite verbose as we check equality from either side using two pointers and return false if there's a mismatch