Try this question on leet code Majority Element

557. Reverse Words in a String III Given a string s, reverse the order of characters in each word within a sentence while still preserving whitespace and initial word order.
Example 1:

Input: s = "Let's take LeetCode contest"
Output: "s'teL ekat edoCteeL tsetnoc"
Example 2:

Input: s = "Mr Ding"
Output: "rM gniD" #leet_code_Q3 #String

Answer:

 words = s.split()
  reversed_words = [word[::-1] for word in words] 
  return ' '.join(reversed_words)

9. Palindrom number #leet_code_Q4 #math #my_twopointer Given an integer x, return true if x is a
palindrome, and false otherwise.
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-. Therefore it is not a palindrome.
Example 3:
Input: x = 10
Output: false
Explanation: Reads 01 from right to left. Therefore it is not a palindrome.

share ur ides on the comment section

if you are interested to learn python join this group Python

answers which are sent From u:

left = 0
x = str(x)
right = len(x)-1
while left<= right:
if x[left]!= x[right]:
return False
left+=1
right-=1
return True

x = str(x)
return x[::-1] == x

It is really helpful if you want to learn python.

Binary Search Algorithm in 100 Seconds