ምስጉን ነው በክፉዎች ምክር ያልሄደ፥ በኃጢአተኞችም መንገድ ያልቆመ፥ በዋዘኞችም ወንበር ያልተቀመጠ።
ነገር ግን በእግዚአ·በሔር ሕግ ደስ ይለዋል፥ ሕጉንም በቀንና በሌሊት ያስባል፡፡
እርሱም በውኃ ፈሳሾች ዳር እንደ ተተከለች፡ ፍሬዋን በየጊዜዋ እንደምትሰጥ፡ ቅጠልዋም እንደማይረግፍ ዛፍ ይሆናል፤ የሚሠራውም ሁሉ ይከናወንለታል።
ክፉዎች እንዲህ አይደሉም፡ ነገር ግን ነፋስ ጠርጎ እንደሚወስደው ትቢያ ናቸው... ስለዚህ ክፉዎች በፍርድ፥ ኃጢአተኞችም በጻድቃን ማኅበር አይቆሙም።
እግዚአብሔር የጻድቃንን መንገድ ያውቃልና፥ የክፉዎች መንገድ ግን ትጠፋለች።
❤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
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
744. find the smallest that greater than the target letter #binary_search #leet_code_Q6 #Easy You are given an array of characters letters that is sorted in non-decreasing order, and a character target. There are at least two different characters in letters.
Return the smallest character in letters that is lexicographically greater than target. If such a character does not exist, return the first character in letters.
Return the smallest character in letters that is lexicographically greater than target. If such a character does not exist, return the first character in letters.
Example 1:
Input: letters = ["c","f","j"], target = "a"
Output: "c"
Explanation: The smallest character that is lexicographically greater than 'a' in letters is 'c'.
Example 2:
Input: letters = ["c","f","j"], target = "c"
Output: "f"
Explanation: The smallest character that is lexicographically greater than 'c' in letters is 'f'.
Example 3:
Input: letters = ["x","x","y","y"], target = "z"
Output: "x"
Explanation: There are no characters in letters that is lexicographically greater than 'z' so we return letters[0]
Input: letters = ["c","f","j"], target = "a"
Output: "c"
Explanation: The smallest character that is lexicographically greater than 'a' in letters is 'c'.
Example 2:
Input: letters = ["c","f","j"], target = "c"
Output: "f"
Explanation: The smallest character that is lexicographically greater than 'c' in letters is 'f'.
Example 3:
Input: letters = ["x","x","y","y"], target = "z"
Output: "x"
Explanation: There are no characters in letters that is lexicographically greater than 'z' so we return letters[0]
Constraints:
2 <= letters.length <= 104
letters[i] is a lowercase English letter.
letters is sorted in non-decreasing order.
letters contains at least two different characters.
target is a lowercase English letter.
2 <= letters.length <= 104
letters[i] is a lowercase English letter.
letters is sorted in non-decreasing order.
letters contains at least two different characters.
target is a lowercase English letter.
👍4
answer:
class Solution:
def nextGreatestLetter(self, letters: List[str], target: str) -> str:
left = 0
right = len(letters)-1
while(left<=right):
mid = (left+right)//2
if(letters[mid] > target )and (letters[mid-1] <= target or mid==left):
return letters[mid]
elif letters[mid] > target:
right = mid -1
else:
left = mid +1
return letters[0]
👍5☃2
የማብድ ቢመስለኝ ፣ ድንገት አንቺን ሳጣ
አረቄ ቤት ሔጄ ፣ አረቄ ስጠጣ
አንድ ግጥም ሰማሁ
ፍቅርሽን ከልቤ ፣ ነቅሎ የሚያወጣ፡፡
ያውም መንገድ በሚል...
ለመንገደኛ ሰው ፣ ሰካራም የፃፈው
እዛ ጋ ቁጭ ብሎ...
"ከዳችኝ" እያለ ፣ የሚለፈልፈው
መንገድ የሚል ግጥሙ ፣ጆሮዬን ገረፈው፡፡
ጆሮዬ ሲገረፍ ፣
ጠባሳ ጣለብኝ ፣ ግጥሙን እንዳልረሳ
"መንገድ አያደርስም
መንገድ አይመልስም ፣ እግር ካልተነሳ!!!"
እያለ ይገጥማል...
ደጋግሞ ደጋግሞ ፣ ሌላ አይናገርም
እሱም ልክ እንደኔ ...
አንዷን በመሔዷ ፣ ሳያጣት አይቀርም፡፡
ብቻ ሰክሪያለሁ
ለመንገደኛ ሴት ፣
የተፃፈ ግጥምን ፣ ጆሮዬ ያደሞጣል
መሔድሽን ያየ
እንደሌሌሽኝ ሲያውቅ ፣ ሊኖረኝ ይመጣል
ይህ ነው መንገድ ማለት!
የሰካራም ግጥምን ሰክሬ ስረዳው
ማፍቀረ ሳይሆን ለኔ ፣ መርሳት ነው ሚጎዳው!!!
ሰለወደድኩት ነው
👍7❤🔥3❤1