Leetcode with dani – Telegram
Leetcode with dani
1.31K subscribers
197 photos
14 videos
56 files
240 links
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
Download Telegram
print(4 * 3 / 2 * 2 ** 2)
#out put==?
Anonymous Quiz
9%
12.0
26%
1.5
9%
0.75
57%
24.0
❤‍🔥3👎2
T1=(2,3)
a,b=T1
T2=(b,T1) print(T2) #output=?
Anonymous Quiz
13%
(3,2,3)
53%
(3,(2,3))
15%
(T1,2,3)
18%
error
Leetcode with dani pinned «T1=(2,3)
a,b=T1
T2=(b,T1) print(T2) #output=?
»
Forwarded from 🇪🇹Ethio Apps Store 📀 (𝐉ƲDͩѦƝƝѦⴼ)
Python_4.2.21_Pro.apk
14.5 MB
🦋#Share🦋
👩‍💻 @ethioapps1👨‍💻
👍3
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
#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
you can submit your answers via https://news.1rj.ru/str/zprogramming_bot
seletemechegn nw share yarekut
Forwarded from Dani
አትጠይቅ (?)

"አትመርምር ፣ አትጠይቅ ፣
ልብህ ቢያስብ እንኳን ፣ ምላስህን ጠብቅ፣
"ዝም በል" የሚሉት ቃል ፦
ተመራምሮ ላየው ፣ ብዙ ያስጠይቃል ።

ሲጀመር ፦
አስተዋይ አዋቂ ፣ ጠያቂ...አዕምሮ፣
ከነፍስ ባህርይ፣ በሥጋ አንጎል ቋጥሮ፣
አምላክ ከፈጠረ
ስለምን ዝም ይበል፣ የተመራመረ ?

ሲቀጥል ፦
ልብ የጠየቀውን ፣ አንደበት አውጥቶ ስላልተናገረ፣
የልብብ ሚያውቅ አምላክ፣ እንዳልተጠየቀ እንዴት ተቆጠረ?

ባጭሩ ፦
የሰነፍ አንደበት ፣ ለመልስ ሲቸግረው፣
መርማሪ አዕምሮን፣ "በአትጠይቅ" አሰረው ።

መላኩ አላምረው
5🔥1
#code_challenge write a code that find the longest common prefix in the Given two strings.
from our group member
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
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
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
Leetcode with dani
Python_Tutorial_Python_Full_Course_for_Beginners_uQrJ0TkZlc_136.mp4
I recommend the above file for beginners who want to learn Python.