Leetcode with dani
Open in 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
Show more1 262
Subscribers
+124 hours
No data7 days
+730 days
Posts Archive
1 262
ααα΅αα½α α°ααͺ α α²α± α αα α¨α .α .α© /CNCS α¨Chemistry α²ααα΅ααα΅ α°ααͺ α²αα α α΅ααα°α α¨α€α α₯αα αααα«α΅ α α₯αα α αα α³ α΅αα»αααα΅ αα΅αα³α α¨α
ααα αα΅α΅α α₯α¨α°α°α¨ααα΅ ααααα’ ααα αα αα
αααα αα αα³αα΅ ααͺαα½ α¨ααααα αααα₯ ααΈαα α΅ααα°α»α αα₯αα³α³ α²α£α α£α3 α₯αα α¨α£αα α α«ααα΅ α°α¨ααΆ α α
α α¨ααα°αα α₯α αα₯ α¨αα°α°αα αα’ α αα΅α¨α α¨α₯αα³α³ α₯αα½αα α₯αα΅α΅αα¨ααα α΅αα α αα£αͺ α΅α α₯αα ααααα’
α΅α α’α«α₯α...
1000660602899 Surafel and Lud and Belete (CBE)
ααα¨α: 0928750009
1 262
Repost from A2SV | Africa to Silicon Valley
Applications are Open for A2SV G6 Education!
The time has come for A2SV to welcome new members! Weβre looking for team-oriented individuals with a never-give-up mentality, ready to drive tech excellence and solve impactful challenges.
π
Application opens: November 14, 2024
π
Deadline: November 20, 2024, at 11:59 PM EAT
π Eligibility
Open to current students from Addis Ababa University (AAU), Addis Ababa Science and Technology University (AASTU), and Adama Science and Technology University (ASTU). If you're not from these schools or have already graduated, stay tuned for future remote applications!
π Requirements
- Familiarity with at least one programming language
- Experience with platforms like LeetCode or Codeforces
- Completed at least 40 problems on LeetCode or Codeforces
π€ Selection Process
- First Round Filtering: Initial application review
- Technical & Behavioral Interviews: For selected candidates, to assess skills and fit for the program
βοΈ Donβt wait! Start your application early to ensure a standout submission. π―
π Apply now: link
#A2SV #TechEducation #EmpoweringAfrica #ApplyNow
1 262
ααααͺα« ααα©α α΅α΅α«α Register α α΅αα αααΉαα α«α°α¨ααΉα
α αα α¨α«α³α½αα ααα αα°α£αΉαα α¨αα ααα°αα»α½α α ααα α₯αα± α ααα«αΉα
α²αα‘ α₯α αα°α£αΉαα 500 α₯α α²αα ααα£α΅ α΅α½αααΉα
100% α₯ααα΅ αα
αααααππ
https://www.vivapay.top?id=MjE1MjA3NjIwODUyOTQwOQ==&from=OTM2NDY0ODk0|MjE1MjA3NjA4ODAwMDUxMg==&lang=en&cid=hbcp&channel=web
1 262
Repost from A2SV - Discussion
Hello fellow coders,
After a brief break, we've returned! Get ready for our fun weekly community coding contest happening every Saturday π. It's your chance to compete with other awesome programmers, learn more about coding, and, most importantly, have a great time! π₯³
π Contest Details:
π
Date: November 9, 2024
β° Time: 6:00 PM
π Link for Contest: Community Weekly Contest Return - Contest No 1
P.S. Remember to fill out this form to secure your spot for our upcoming community classes and lectures. Itβs your golden ticket to enriching experiences you wonβt want to miss. πβ¨
1 262
So, the prime numbers are the unmarked ones: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89 and 97.
1 262
We move to our next unmarked number 5 and mark all multiples of 5 and are greater than or equal to the square of it.
1 262
Now we move to our next unmarked number 3 and mark all the numbers which are multiples of 3 and are greater than or equal to the square of it.
1 262
According to the algorithm we will mark all the numbers which are divisible by 2 and are greater than or equal to the square of it.
1 262
Let us take an example when n = 100. So, we need to print all prime numbers smaller than or equal to 100.
We create a list of all numbers from 2 to 100.
1 262
Sieve of Eratosthenes
Given a number n, print all primes smaller than or equal to n. It is also given that n is a small number.
Example:
Input : n =10
Output : 2 3 5 7
Input : n = 20
Output: 2 3 5 7 11 13 17 19
The sieve of Eratosthenes is one of the most efficient ways to find all primes smaller than n when n is smaller than 10 million or so.
Following is the algorithm to find all the prime numbers less than or equal to a given integer n by the Eratostheneβs method:
When the algorithm terminates, all the numbers in the list that are not marked are prime.
Explanation with Example:
1 262
Given a number n, print all primes smaller than or equal to n. It is also given that n is a small number.
Example:
Input : n =10
Output : 2 3 5 7
Input : n = 20
Output: 2 3 5 7 11 13 17 19
