Leetcode with dani
前往频道在 Telegram
Join us and let's tackle leet code questions together: improve your problem-solving skills Preparing for coding interviews learning new algorithms and data structures connect with other coding enthusiasts
显示更多1 257
订阅者
无数据24 小时
无数据7 天
-930 天
帖子存档
1 257
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!
1 257
ምስጉን ነው በክፉዎች ምክር ያልሄደ፥ በኃጢአተኞችም መንገድ ያልቆመ፥ በዋዘኞችም ወንበር ያልተቀመጠ። ነገር ግን በእግዚአ·በሔር ሕግ ደስ ይለዋል፥ ሕጉንም በቀንና በሌሊት ያስባል፡፡ እርሱም በውኃ ፈሳሾች ዳር እንደ ተተከለች፡ ፍሬዋን በየጊዜዋ እንደምትሰጥ፡ ቅጠልዋም እንደማይረግፍ ዛፍ ይሆናል፤ የሚሠራውም ሁሉ ይከናወንለታል። ክፉዎች እንዲህ አይደሉም፡ ነገር ግን ነፋስ ጠርጎ እንደሚወስደው ትቢያ ናቸው... ስለዚህ ክፉዎች በፍርድ፥ ኃጢአተኞችም በጻድቃን ማኅበር አይቆሙም። እግዚአብሔር የጻድቃንን መንገድ ያውቃልና፥ የክፉዎች መንገድ ግን ትጠፋለች።
1 257
ምስጉን ነው በክፉዎች ምክር ያልሄደ፥ በኃጢአተኞችም መንገድ ያልቆመ፥ በዋዘኞችም ወንበር ያልተቀመጠ።
ነገር ግን በእግዚአ·በሔር ሕግ ደስ ይለዋል፥ ሕጉንም በቀንና በሌሊት ያስባል፡፡
እርሱም በውኃ ፈሳሾች ዳር እንደ ተተከለች፡ ፍሬዋን በየጊዜዋ እንደምትሰጥ፡ ቅጠልዋም እንደማይረግፍ ዛፍ ይሆናል፤ የሚሠራውም ሁሉ ይከናወንለታል።
ክፉዎች እንዲህ አይደሉም፡ ነገር ግን ነፋስ ጠርጎ እንደሚወስደው ትቢያ ናቸው... ስለዚህ ክፉዎች በፍርድ፥ ኃጢአተኞችም በጻድቃን ማኅበር አይቆሙም።
6 እግዚአብሔር የጻድቃንን መንገድ ያውቃልና፥ የክፉዎች መንገድ ግን ትጠፋለች።
1 257
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
1 257
https://t.me/realyescoinbot?start=r_659354356 Telegram verified the coin so it may have some value like notcoin and it worth trying. just try
1 257
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.
1 257
Answer:
words = s.split()
reversed_words = [word[::-1] for word in words]
return ' '.join(reversed_words)1 257
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
现已上线!2025 年 Telegram 研究 — 年度关键洞察 
