Leetcode with dani
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:β¦
LeetCode
Palindrome Number - LeetCode
Can you solve this real interview question? Palindrome Number - 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 1:
Input: x = 121
Output: true
Explanation: 121 reads as 121 from left to right and from right to left.β¦
Leetcode with dani
Palindrome number
share ur ides on the comment section
if you are interested to learn python join this group Python
Telegram
Python
Dani invites you to join this group on Telegram.
Leetcode with dani
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:β¦
answers which are sent From u:
Forwarded from Gizeale Wondie
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)
right = len(x)-1
while left<= right:
if x[left]!= x[right]:
return False
left+=1
right-=1
return True
αα΅αα αα α αααα½ ααα α«ααα°α₯ α αα’α α°αα½α αααα΅ α«αααα₯ α αααα½α ααα α α«αα°ααα α’
ααα αα α α₯ααα Β·α αα αα α°α΅ ααααα₯ αααα α ααα α ααα΅ α«α΅α£αα‘α‘
α₯αα±α α αα αα³αΎα½ α³α α₯αα° α°α°α¨αα½α‘ αα¬αα α α¨ααα α₯αα°αα΅α°α₯α‘ α α ααα α₯αα°ααα¨αα αα ααααα€ α¨αα α«αα αα αα¨ααααα³αα’
αααα½ α₯αα²α α αα°ααα‘ ααα αα ααα΅ α αα α₯αα°ααα΅α°α α΅α’α« ααΈα... α΅ααα αααα½ α ααα΅α₯ αα’α α°αα½α α α»α΅αα αα α α α ααααα’
α₯ααα α₯αα α¨α»α΅ααα αααα΅ α«ααααα₯ α¨αααα½ αααα΅ αα α΅α ααα½α’
β€9
I strongly recommend starting to do LeetCode questions as early as possible. Whether you use it in real life or not, many companies ask for this skill during technical interviews, and it's not likely to change anytime soon. So, do as many problems as you can. Thanks!
π4π―2
Leetcode with dani pinned Β«I strongly recommend starting to do LeetCode questions as early as possible. Whether you use it in real life or not, many companies ask for this skill during technical interviews, and it's not likely to change anytime soon. So, do as many problems as you can.β¦Β»
This media is not supported in your browser
VIEW IN TELEGRAM
Binary Search Algorithm in 100 Seconds
π3
we will try to solve some problems on binary search so be ready.π₯Ά
π«‘4π1
704. Binary Search #Easy #leet_code_Q5 #binary_search Given an array of integers nums which is sorted in ascending order, and an integer target, write a function to search target in nums. If target exists, then return its index. Otherwise, return -1.
You must write an algorithm with O(log n) runtime complexity.
Example 1:
Input: nums = [-1,0,3,5,9,12], target = 9
Output: 4
Explanation: 9 exists in nums and its index is 4
Example 2:
Input: nums = [-1,0,3,5,9,12], target = 2
Output: -1
Explanation: 2 does not exist in nums so return -1
You must write an algorithm with O(log n) runtime complexity.
Example 1:
Input: nums = [-1,0,3,5,9,12], target = 9
Output: 4
Explanation: 9 exists in nums and its index is 4
Example 2:
Input: nums = [-1,0,3,5,9,12], target = 2
Output: -1
Explanation: 2 does not exist in nums so return -1
π5
Leetcode with dani
704. Binary Search #Easy #leet_code_Q5 #binary_search Given an array of integers nums which is sorted in ascending order, and an integer target, write a function to search target in nums. If target exists, then return its index. Otherwise, return -1. Youβ¦
share ur solution on the comment section or in the group.
π4
Leetcode with dani
704. Binary Search #Easy #leet_code_Q5 #binary_search Given an array of integers nums which is sorted in ascending order, and an integer target, write a function to search target in nums. If target exists, then return its index. Otherwise, return -1. Youβ¦
``` class Solution:
def search(self, nums: List[int], target: int) -> int:
left = 0
right = len(nums)-1
while(left<=right):
mid = (left+right)//2
if nums[mid] == target:
return mid
elif nums[mid] >target:
right = mid -1
else:
left = mid+1
return -1 ```
def search(self, nums: List[int], target: int) -> int:
left = 0
right = len(nums)-1
while(left<=right):
mid = (left+right)//2
if nums[mid] == target:
return mid
elif nums[mid] >target:
right = mid -1
else:
left = mid+1
return -1
π5