3 Sum - Leetcode #15 Short & Simple Solution
Given an array of integers, nums, return all the triplets in the given array nums[i], nums[j], nums[k] such that i != j, i != k, and j != k
3 Sum - Leetcode #15 Short & Simple Solution
Reverse Integer - Leetcode #7 Short & Simple Solution
Palindrome Number - Leetcode #9 Short & Simple Solution