❤🔥3👎2
Anonymous Quiz
13%
(3,2,3)
53%
(3,(2,3))
15%
(T1,2,3)
18%
error
kemejemria jmro python memar mefelgu sewoch ke first message gemrachu mayet techlalachu keza betechemari be mangnawm seat erdata kefelegachu conatct argugn https://news.1rj.ru/str/zprogramming_bot
❤🔥7
🇪🇹Ethio Apps Store 📀
Python_4.2.21_Pro.apk
be slk lemetemaru kesr yalwn tetekemu yelayegnaw kalseralachu
Forwarded from Leetcode with dani
Pydroid 3_6.4_arm_premium.apk
53.5 MB
https://news.1rj.ru/str/+m835nLa3A0c2MjBk groupun yaltekelakelachu join argu
Telegram
leetcoders
You’ve been invited to join this group on Telegram.
#code_challenge write a code for a Given a string containing just the characters '(', ')', '{', '}', '[', and ']', determine if the input string is valid. An input string is valid if:
Open brackets must be closed by the same type of brackets.
Open brackets must be closed in the correct order
Open brackets must be closed by the same type of brackets.
Open brackets must be closed in the correct order
you can submit your answers via https://news.1rj.ru/str/zprogramming_bot
Forwarded from Dani
አትጠይቅ (?)
"አትመርምር ፣ አትጠይቅ ፣
ልብህ ቢያስብ እንኳን ፣ ምላስህን ጠብቅ፣
"ዝም በል" የሚሉት ቃል ፦
ተመራምሮ ላየው ፣ ብዙ ያስጠይቃል ።
ሲጀመር ፦
አስተዋይ አዋቂ ፣ ጠያቂ...አዕምሮ፣
ከነፍስ ባህርይ፣ በሥጋ አንጎል ቋጥሮ፣
አምላክ ከፈጠረ
ስለምን ዝም ይበል፣ የተመራመረ ?
ሲቀጥል ፦
ልብ የጠየቀውን ፣ አንደበት አውጥቶ ስላልተናገረ፣
የልብብ ሚያውቅ አምላክ፣ እንዳልተጠየቀ እንዴት ተቆጠረ?
ባጭሩ ፦
የሰነፍ አንደበት ፣ ለመልስ ሲቸግረው፣
መርማሪ አዕምሮን፣ "በአትጠይቅ" አሰረው ።
✍ መላኩ አላምረው
"አትመርምር ፣ አትጠይቅ ፣
ልብህ ቢያስብ እንኳን ፣ ምላስህን ጠብቅ፣
"ዝም በል" የሚሉት ቃል ፦
ተመራምሮ ላየው ፣ ብዙ ያስጠይቃል ።
ሲጀመር ፦
አስተዋይ አዋቂ ፣ ጠያቂ...አዕምሮ፣
ከነፍስ ባህርይ፣ በሥጋ አንጎል ቋጥሮ፣
አምላክ ከፈጠረ
ስለምን ዝም ይበል፣ የተመራመረ ?
ሲቀጥል ፦
ልብ የጠየቀውን ፣ አንደበት አውጥቶ ስላልተናገረ፣
የልብብ ሚያውቅ አምላክ፣ እንዳልተጠየቀ እንዴት ተቆጠረ?
ባጭሩ ፦
የሰነፍ አንደበት ፣ ለመልስ ሲቸግረው፣
መርማሪ አዕምሮን፣ "በአትጠይቅ" አሰረው ።
✍ መላኩ አላምረው
❤5🔥1
#code_challenge write a code that find the longest common prefix in the Given two strings.
Forwarded from K
def bracket_validator(s):
bracket_stack = []
char_tree = ["{([","})]"]
cor = {"}":"{","]":"[",")":"("}
for i in s:
if i in char_tree[0]:
bracket_stack.append(i)
elif i in char_tree[1]:
bracket_stack.pop() if cor[str(i)] == bracket_stack[-1] else False
return False if bracket_stack else True
bracket_stack = []
char_tree = ["{([","})]"]
cor = {"}":"{","]":"[",")":"("}
for i in s:
if i in char_tree[0]:
bracket_stack.append(i)
elif i in char_tree[1]:
bracket_stack.pop() if cor[str(i)] == bracket_stack[-1] else False
return False if bracket_stack else True
Forwarded from Leetcode with dani
kemejemria jmro python memar mefelgu sewoch ke first message gemrachu mayet techlalachu keza betechemari be mangnawm seat erdata kefelegachu conatct argugn https://news.1rj.ru/str/zprogramming_bot
👍1
Forwarded from Leetcode with dani
welcome to our channel this channel is built to help new programmers and for those who wants to know more about programming share our channel to your friends
❤6
Leetcode with dani
welcome to our channel this channel is built to help new programmers and for those who wants to know more about programming share our channel to your friends
Tap the message above to see the first message in this channel.
👍1
New students seeking a tutor at a reasonable price from top students at AAU are encouraged to contact me. https://news.1rj.ru/str/zprogramming_bot
🔥4