Yoru Karu Studio

Problem Description

Given an integer x, return true if x is a palindrome, and false otherwise.

A palindrome number reads the same forward and backward.

Example 1:

Input: x = 121
Output: true
Explanation: 121 reads as 121 from left to right and from right to left

Example 2:

Input: x = -121
Output: false
Explanation: From left to right, it reads -121. From right to left, it becomes 121-, thus not a palindrome

Example 3:

Input: x = 10
Output: false
Explanation: Reads 01 from right to left, thus not a palindrome

Problem Description

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

Example:

Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Explanation: Because nums[0] + nums[1] == 9, we return [0, 1]