EvoNext
1.79K subscribers
272 photos
16 videos
266 files
484 links
Download Telegram
๐ŸŽฒ Quiz ''ERRORS IN PROGRAMMING'
๐Ÿ–Š 5 questions ยท โฑ 10 sec
Job Title: Multiple Internship Positions

Company: Yaltopia Tech

Description:
Yaltopia Tech is excited to announce its internship program, offering exceptional opportunities for aspiring professionals in the fields of backend development, frontend development, and digital marketing. As an intern at Yaltopia Tech, you will have the chance to work alongside industry experts, gain hands-on experience, and contribute to cutting-edge projects that are shaping the future of technology.

Apply Here :  https://forms.gle/qza2G8rbj4bK5BCV9

Approved by Maroset
Share: Ethiopian Remote Jobs
โค3โšก2๐Ÿ‘1๐Ÿ†’1
๐Ÿค–โœ…Have you noticed the updates of chatGPT?โ„๏ธโ„๏ธ

free GPT-4o , files upload and smooth UI.
โค1
Do You Know?
Did you know that the first computer bug was a literal bug? In 1947, when Grace Hopper was working on the Harvard Mark II computer, she found a moth trapped between the relays. She removed it and taped it to her logbook, noting it as the โ€œfirst actual case of a bug being found.โ€ Since then, the term โ€œdebuggingโ€ has become synonymous with fixing software issues! ๐Ÿ›๐Ÿ”ง
๐Ÿคฉ1๐ŸŒš1
๐Ÿค–just take it easy!
๐Ÿ˜๐Ÿ˜๐Ÿ˜๐Ÿ˜๐Ÿ˜๐Ÿ˜๐Ÿ˜๐Ÿ˜๐Ÿ˜๐Ÿ˜๐Ÿ˜๐Ÿ˜๐Ÿ˜๐Ÿ˜๐Ÿ˜๐Ÿ˜
even if the #code you wrote did not work!
๐Ÿ‘2๐Ÿ˜ข1
Forwarded from ProgrammerHumor
๐Ÿ‘1
2 Days Left!

Join Us at the GDSC Welcome Program! ๐Ÿš€

Just a friendly reminder that our GDSC Welcome Program is only 2 days away!

๐Ÿ“… Date: May 17
๐Ÿ•’ Time: 2:00 PM - 5:00 PM
๐Ÿ“ Location: 4 Kilo Campus

Don't miss out on:

- Getting introduced to the GDSC community
- Learning about GDSC's mission, goals, and activities
- Hearing from esteemed guest speakers and senior developers
- Networking with fellow students and GDSC members

- Q&A session for all your queries

Get ready to be inspired and take your first step into the exciting world of tech and community!

Make sure you register here and got your tickets through your email๐Ÿ‘‡

https://gdsc.community.dev/events/details/developer-student-clubs-addis-ababa-university-addis-ababa-ethiopia-presents-welcome-program/

See you there!
Good morning ๐ŸŒž
โคโ€๐Ÿ”ฅ3
Good night
๐Ÿ‘3
the most energy consuming organ in our body is brain๐Ÿง (~20%).
and you know?
the main thing our brain is good at is ๐Ÿ˜ถโ€๐ŸŒซ๏ธForgetting.
๐Ÿ˜3
that's how #monetization in #telegram
It already started counting very very little dollars ๐Ÿ’ต๐Ÿ’ฐ
โœ1๐Ÿคช1
๐Ÿ’ฅ
โค1๐Ÿ‘1
๐Ÿ‘2๐Ÿ˜2
Beginner ๐Ÿ”ฐ friendly courses to learn AI
Where did microsoft copilot go?
copilot.microsoft.com
๐Ÿš€ Bitcoin's Future is Unfolding! ๐Ÿš€

Last week, the Bitcoin world was buzzing with two major events: the Halving and the launch of the Runes Protocol! ๐ŸŒโœจ

**Whatโ€™s the Buzz About Runes?
Runes is a game-changing token standard for creating fungible tokens right on the Bitcoin blockchain. Created by Casey Rodarmor, the mastermind behind Ordinals, Runes promises efficiency, simplicity, and a lighter blockchain footprint. Say goodbye to BRC-20's complexities and hello to streamlined token creation! ๐ŸŽ‰๐Ÿ’ฐ

How It Works:
- Etching
: Create a new token with unique properties.
- Minting
: Produce new token units.
- Transferring
: Move tokens easily between users.

Impact on Bitcoin:
- More Use Case
s: From stablecoins to governance tokens, Runes could attract a wider user base.
- Increased Miner Revenue
: Higher transaction volume means more fees for miners.
- Innovation Boost
: Lower barriers for developers to create cool new projects!

The Future:
**
Caseyโ€™s next big idea? Direct trading between users and potential Layer-2 network integration for even more scalability and fun! ๐ŸŒŸ

**TL;DR:**
Runes = Efficient tokens on Bitcoin + More users + Higher miner fees + Innovation boost! Will Runes revolutionize Bitcoin? Only time will tell, but the ride is looking exciting! ๐Ÿš€๐Ÿ› 

Join the convo and share your thoughts! ๐Ÿ’ฌ
#Bitcoin #CryptoInnovation #RunesProtocol

Read More at: https://magazine.mindplex.ai/runes-protocol-did-it-ruin-bitcoin-or-save-it/?mpsa=9703-664f9cc295a2b-link
๐Ÿ”ฐComplete DSA Roadmap๐Ÿ”ฐ

|-- Basic_Data_Structures
| |-- Arrays
| |-- Strings
| |-- Linked_Lists
| |-- Stacks
| โ””โ”€ Queues
|
|-- Advanced_Data_Structures
| |-- Trees
| | |-- Binary_Trees
| | |-- Binary_Search_Trees
| | |-- AVL_Trees
| | โ””โ”€ B-Trees
| |
| |-- Graphs
| | |-- Graph_Representation
| | | |- Adjacency_Matrix
| | | โ”” Adjacency_List
| | |
| | |-- Depth-First_Search
| | |-- Breadth-First_Search
| | |-- Shortest_Path_Algorithms
| | | |- Dijkstra's_Algorithm
| | | โ”” Bellman-Ford_Algorithm
| | |
| | โ””โ”€ Minimum_Spanning_Tree
| | |- Prim's_Algorithm
| | โ”” Kruskal's_Algorithm
| |
| |-- Heaps
| | |-- Min_Heap
| | |-- Max_Heap
| | โ””โ”€ Heap_Sort
| |
| |-- Hash_Tables
| |-- Disjoint_Set_Union
| |-- Trie
| |-- Segment_Tree
| โ””โ”€ Fenwick_Tree
|
|-- Algorithmic_Paradigms
| |-- Brute_Force
| |-- Divide_and_Conquer
| |-- Greedy_Algorithms
| |-- Dynamic_Programming
| |-- Backtracking
| |-- Sliding_Window_Technique
| |-- Two_Pointer_Technique
| โ””โ”€ Divide_and_Conquer_Optimization
| |-- Merge_Sort_Tree
| โ””โ”€ Persistent_Segment_Tree
|
|-- Searching_Algorithms
| |-- Linear_Search
| |-- Binary_Search
| |-- Depth-First_Search
| โ””โ”€ Breadth-First_Search
|
|-- Sorting_Algorithms
| |-- Bubble_Sort
| |-- Selection_Sort
| |-- Insertion_Sort
| |-- Merge_Sort
| |-- Quick_Sort
| โ””โ”€ Heap_Sort
|
|-- Graph_Algorithms
| |-- Depth-First_Search
| |-- Breadth-First_Search
| |-- Topological_Sort
| |-- Strongly_Connected_Components
| โ””โ”€ Articulation_Points_and_Bridges
|
|-- Dynamic_Programming
| |-- Introduction_to_DP
| |-- Fibonacci_Series_using_DP
| |-- Longest_Common_Subsequence
| |-- Longest_Increasing_Subsequence
| |-- Knapsack_Problem
| |-- Matrix_Chain_Multiplication
| โ””โ”€ Dynamic_Programming_on_Trees
|
|-- Mathematical_and_Bit_Manipulation_Algorithms
| |-- Prime_Numbers_and_Sieve_of_Eratosthenes
| |-- Greatest_Common_Divisor
| |-- Least_Common_Multiple
| |-- Modular_Arithmetic
| โ””โ”€ Bit_Manipulation_Tricks
|
|-- Advanced_Topics
| |-- Trie-based_Algorithms
| | |-- Auto-completion
| | โ””โ”€ Spell_Checker
| |
| |-- Suffix_Trees_and_Arrays
| |-- Computational_Geometry
| |-- Number_Theory
| | |-- Euler's_Totient_Function
| | โ””โ”€ Mobius_Function
| |
| โ””โ”€ String_Algorithms
| |-- KMP_Algorithm
| โ””โ”€ Rabin-Karp_Algorithm
|
|-- OnlinePlatforms
| |-- LeetCode
| |-- HackerRank


Groups & Friends too
๐Ÿ‘2
๐Ÿ˜‚ When you ask AI about a cure for depression
๐Ÿ˜3๐Ÿ‘1
It's irrelevant but found interesting..,.. but let's see how Dev's react to this article!

แˆตแˆˆ แŠ แˆ…แ‹ซ แ‹ญแˆ…แŠ•แŠ• แ‹ซแ‹แ‰ƒแˆ‰?
๐Ÿ‘‡
1)แ‹จแˆซแˆต แ‹ˆแ‹ณแ‹ต แŠฅแŠ“ แ‹จแˆตแŒแ‰ฅแŒ แˆฐแ‹Žแ‰ฝ แแˆ‹แŒŽแ‰ต แŠฅแŠ•แŒ‚ "แŠฅแŠ” แŠจแˆžแ‰ตแŠฉ แˆฐแˆญแ‹ถ แŠ แ‹ญแ‰ฅแ‰€แˆ" แ‰ แŒญแˆซแˆฝ แŠ แˆ…แ‹ซ แŠ แˆ‹แˆˆแ‰ฝแˆ

2)แŠ แˆ…แ‹ซ แŠฅแŠ•แ‹ฐแˆŒแˆŽแ‰ฝ แŠฅแŠ•แˆตแˆถแ‰ฝ แ‹จแˆฐแ‹ แˆ›แˆณ แ‹แˆตแŒฅ แŒˆแ‰ฅแ‰ณ แ‹จแˆ แ‹ แˆฐแ‰ฅแˆ แŠ แ‰ตแ‰ แˆ‹แˆ

3)แŠ แˆ…แ‹ซ แ‰ แˆจแˆ€แ‰ฅ แ‰ตแˆžแ‰ณแˆˆแ‰ฝ แŠฅแŠ•แŒ‚ แ‹จแŒซแАแ‰ฝแ‹แŠ• แŠฅแˆ…แˆ แŠ•แŠญแ‰ฝ แŠ แ‰ณแ‹ฐแˆญแŒแˆ

4)แ‰ฅแ‹™ แˆฐแ‹Žแ‰ฝ แŠ แˆ…แ‹ซ แ‹จแˆ›แ‰ณแ‹แ‰… แ‰ขแˆ˜แˆตแˆ‹แ‰ธแ‹แˆแฃ แ‹จแˆ„แ‹ฐแ‰ฝแ‰ฃแ‰ธแ‹แŠ• แŠ แ‰…แŒฃแŒซ แŠฅแŠ“ แˆ˜แŠ•แŒˆแ‹ต แˆแˆ‰ แŠจแˆแˆ‰แˆ แŠฅแŠ•แˆตแˆณ แ‰ แˆ‹แ‹ญ แŠ แˆณแˆแˆซ แ‰ณแ‹แ‰ƒแˆˆแ‰ฝ

5)แ‹จแŒˆแŒ แˆญ แŠ แˆ…แ‹ซ แ‹จแŠจแ‰ฐแˆ› แˆ˜แ‹แŒซ แˆ˜แŒแ‰ขแ‹ซ แŠ แŠ•แ‹ด แŠซแ‹จแ‰ฝ แŠฅแ‹ตแˆœ แˆแŠณแŠ• แŠ แ‰ตแˆจแˆณแˆ
6)แŠ แˆ…แ‹ซ แŠฅแˆตแŠจ 60 แŠชแˆŽ แˆœแ‰ตแˆญ แ‹จแˆšแˆฐแˆ›แกแŒ†แˆฎ แˆตแˆ‹แˆ‹แ‰ตแŠƒแ‹ญแˆˆแŠ› แ‹แŠ“แ‰ฅ แŠจแˆ˜แˆแŒฃแ‰ฑ แ‰ แŠแ‰ต แ‰ณแ‹แ‰ƒแˆˆแ‰ฝ

7)แ‹จแˆ˜แˆฌแ‰ต แˆ˜แŠ•แ‰€แŒฅแ‰€แŒฅ แŠ แ‹ฐแŒ‹ แŠจแˆ˜แŠจแˆ แ‰ฑ แ‰ แŠแ‰ต แŒฌแŠธแ‰ต แ‰ แˆ›แˆฐแˆ›แ‰ต แˆฐแ‹Žแ‰ฝแŠ• แ‰ณแ‰ฐแˆญแ‹แˆˆแ‰ฝแข

8)แ‰ แŠ“แˆฝแŠ“แˆ แŒ‚แŠฆแŒแˆซแŠ แ‹จแŠฅแŠ•แˆตแˆณแ‰ต แˆ›แˆ…แ‹ฐแˆญ แ‰ แŒฃแˆ แ‰ตแˆแ‰ตแฃแŒจแ‹‹ แŠฅแŠ“ แŠ แˆตแ‰ฐแ‹‹แ‹ญ แ‰ฐแ‰ฅแˆˆแ‹ แ‹จแ‰ฐแˆ˜แ‹˜แŒˆแ‰กแ‰ต แ‹ถแˆแŠแŠ•แฃ แ–แŠ•แ‹ณแฃ แ‹แˆ†แŠ•แฃ แˆแˆจแˆตแฃ แŠฅแˆญแŒ แŠฅแŠ“ แŠ แˆ…แ‹ซ แŠ“แ‰ธแ‹แกแก

9)แŠ แˆ…แ‹ซ แˆˆแ‹˜แˆ˜แŠ“แ‰ต แˆฐแ‹Žแ‰ฝแŠ• แ‰ แ‰ณแˆ›แŠแАแ‰ต แˆณแ‹ญแ‰ณแŠญแ‰ต แ‹จแˆšแ‹ซแŒˆแˆˆแŒแˆ แ‰ณแ‰ณแˆช แˆฐแˆซแ‰ฐแŠ› แˆ†แŠ– แŠฅแ‹ซแˆˆ แˆˆแˆฐแАแ แˆฐแ‹แฃ แ‹ฐแŠซแˆ› แˆฐแ‹ แ‹ˆแ‹ญแˆ แŒˆแˆแ‰ฑ แˆฐแ‹แŠ• แˆˆแˆ˜แŒแˆˆแ… 'แŠ แˆ…แ‹ซ'แ‰ฐแ‰ฅแˆŽ แˆ˜แˆฐแ‹ฐแ‰ก แ‹จแŠ แˆ…แ‹ซแŠ• แ‹จแ‹˜แˆ˜แŠ“แ‰ต แ‹แˆˆแ‰ณ แˆ˜แŠซแ‹ต แАแ‹แกแก

10)แ‹จแˆฐแ‹‰ แˆแŒ†แ‰ฝ แ‹‹แАแŠ› แŠ แŒˆแˆแŒ‹แ‹ญ แŠ แˆ…แ‹ซ แ‰ขแˆ†แŠ•แˆ แ‹จแŠ แˆ…แ‹ซแŠ• แŠญแ‰ฅแˆญ แŠ แŠ•แŠณแˆถแฃ แˆแŠ•แˆ แŠ แŒˆแˆแŒแˆŽแ‰ต แˆˆแˆ›แ‹ญแˆฐแŒ แŠ• แˆˆแŠ แŠ•แ‰ แˆณ แ‹จแ‰ฐแˆˆแ‹จ แŠญแ‰ฅแˆญ แˆ˜แˆตแŒ แ‰ณแ‰ฝแŠ• แ‹จแ‰ฐแˆแŒฅแˆฎ แˆšแ‹›แŠ• แ‹จแŒŽแ‹ฐแˆˆแŠ• แˆ˜แˆ†แŠ‘แŠ• แ‹จแˆšแ‹ซแˆณแ‹ญ แАแ‹แกแก

11)แŠ แˆ…แ‹ซ 20 แˆฐแŠ แ‰ต แˆ แ‹แŠ• แŠฅแ‹ซแŒˆแˆˆแŒˆแˆˆ แ‹จแŠ แˆ…แ‹ซ แ‰€แˆˆแ‰ก แ‹ฑแˆ‹ แˆฒแˆ†แŠ• แ‹จแ‹ตแˆ˜แ‰ต แŒแŠ• แ‹ˆแ‰ฐแ‰ต แАแ‹แข

12)แŠ แˆ…แ‹ซ แŠ แŒˆแˆญแŠ“ แˆ…แ‹แ‰ฅแŠ• แŠฅแ‹ซแŒˆแˆˆแŒˆแˆˆแ‰ฝ แŠจแ‹ฑแˆ‹ แŠฅแŠ“ แˆตแ‹ตแ‰ฅ แ‹แŒช แŠ แŠ•แ‹ดแˆ แ‰ฐแˆžแŒแˆณ แŠ แ‰ณแ‹แ‰…แˆแกแกแ‹จแ‹แˆˆแ‰ณ แŠ แˆแ‰ฆแ‹ แ‰ตแ‹•แ‰ขแ‰ฐแŠ›แ‹ แŠ แŠ•แ‰ แˆณ แŒแŠ• แˆ™แŒˆแˆณแŠ“ แ‹แ‹ณแˆด แ‹ญแ‰ธแˆจแ‹‹แˆแกแก

13)แ‰ แŠฅแŠ› แŠ แŒˆแˆญ แŠญแ‰ฅแˆญ แ‰ฃแ‹ญแˆฐแŒ แ‹แˆ แ‰ แŠฅแŠ•แŒแˆŠแ‹ แŠ แˆ…แ‹ซ แˆ‹แ‹ญ แŒ‰แ‹ณแ‰ต แˆ›แ‹ตแˆจแˆต แแˆญแ‹ต แ‰คแ‰ต แŒˆแ‰ตแˆฎ แ‹˜แ‰ฅแŒฅแ‹ซ แ‹ซแˆตแ‹ˆแˆญแ‹ณแˆแกแกแ‹จแŠ แˆ…แ‹ซ แˆ˜แ‰ฅแ‰ต แ‰ฐแˆŸแŒ‹แ‰ฝแˆ แ‰ แŠฅแŠ•แŒแˆŠแ‹ แŠจแ‰ฐแ‰‹แ‰‹แˆ˜ แ‰†แ‹ญแ‰ทแˆแกแก

14) แ‰ แŠ แˆœแˆชแŠซ แ‹จแ‹ดแˆžแŠญแˆซแ‰ฒแŠญ แ“แˆญแ‰ฒ แˆแˆแŠญแ‰ต แŠ แˆ…แ‹ซ แˆ˜แˆ†แŠ‘ แ‹จแŠ แˆ…แ‹ซแŠ• แ‹แˆˆแ‰ณ แ‰ แˆ›แˆฐแ‰ฅ แАแ‹แกแก

แŠจแŠ•แŒ‰แˆฑ แ‹˜แˆ˜แŠ• แŒ€แˆแˆฎ แŠ แŠ•แ‰ แˆณ แАแŠ• แ‰ฅแˆˆแ‹ แˆˆแˆšแŽแŠญแˆฉ แ‹จแŠฅแŠ› แŠ แŒˆแˆญ แ–แˆˆแ‰ฒแŠจแŠžแ‰ฝ แŒฅแˆฉ แˆแˆณแˆŒ แАแ‹ (แŠจแŒˆแ‰ฃแ‰ธแ‹) แŠ แ‹ญแŒˆแ‰ฃแ‰ธแ‹แˆ แŠฅแŠ•แŒ‚ แ‹จแ–แˆˆแ‰ฒแŠซ แ–แˆญแ‰ฒแ‹Žแ‰ฝ แˆˆแˆแˆญแŒซ แˆฒแ‹ˆแ‹ณแ‹ฐแˆฉ แ‹จแŠ แˆ…แ‹ซแŠ• แˆแˆตแˆ แ‰ แˆแˆแŠญแ‰ตแАแ‰ต แ‰ขแŒ แ‰€แˆ™ แŒฅแˆฉ แАแ‹แกแก

15) "แŠฅแŠ•แ‹ฐ แˆฐแ‹ แ‹จแˆšแ‹ซแˆตแ‰ฅ แŠ แˆ…แ‹ซ แ‰ฃแˆ‹แ‹แ‰…แˆ แŠฅแŠ•แ‹ฐแŠ แˆ…แ‹ซ แ‹จแˆšแ‹ซแˆต แˆฐแ‹ แŠ แ‹แ‰ƒแˆˆแˆ"แ‹จแˆšแˆˆแ‹ แŠ แ‰ฃแ‰ฃแˆ แ‹ฐแ‹ฐแ‰ฅ แˆฐแ‹Žแ‰ฝแŠ• แˆˆแˆ˜แŒแˆˆแ… แ‹จแˆšแ‹ซแŒˆแˆˆแŒแˆ แ‰ขแˆ˜แˆตแˆแˆ แ‹จแŠ แˆ…แ‹ซแŠ• แŠขแŠ•แ‰ฐแˆˆแŒ€แŠ•แˆฒ แ‰ แˆ›แ‹ซแ‹แ‰ แˆฐแ‹Žแ‰ฝ แ‹จแ‰ฐแŒˆแˆˆแŒธ แŠ แ‰ฃแ‰ฃแˆ แАแ‹แข

16)แ‰ แŠ แŠ•แ‰ แˆณ แŠฅแŠ•แŒ‚ แ‰ แŠ แˆ…แ‹ซ แˆ†แ‰ดแˆ แŠฅแŠ“ แŠ•แŒแ‹ต แ‰คแ‰ต แˆ˜แŠญแˆแ‰ต แ‹จแˆ›แ‹ญแ‹ˆแ‹ฑแ‰ต แ‹จแŠฅแŠ› แŠ แŒˆแˆญ แАแŒ‹แ‹ดแ‹Žแ‰ฝ 'แŠ แˆ…แ‹ซ แˆ†แ‰ดแˆ' แ‹ˆแ‹ญแˆ "แŠ แˆ…แ‹ซ แŠ•แŒแ‹ต แ‰คแ‰ต" "แŠ แˆ…แ‹ซ แˆฑแแˆญแˆ›แˆญแŠฌแ‰ต" แ‰ฅแˆˆแ‹ แ‰ขแˆฐแ‹ญแˆ™ แ‹จแ‰ณแ‰ณแˆชแ‹‹แŠ• แŠฅแŠ“ แ‹จแŒจแ‹‹แ‹‹แŠ• แŠฅแŠ•แˆตแˆณ แˆตแ‹ซแˆœ แˆ˜แŒ แ‰€แˆ›แ‰ธแ‹ แŠฅแŠ•แŒ‚ แˆตแ‹ตแ‰ฅแŠ• แ‹จแˆšแŒˆแˆแ… แŠ แˆˆแˆ˜แˆ†แŠ‘แŠ• แˆ˜แˆจแ‹ณแ‰ต แŠ แˆˆแ‰ฃแ‰ธแ‹แกแกแˆšแ‹ซแ‹šแ‹ซ 30 แ‹จแŠ แˆ…แ‹ซ แ‰€แŠ• แАแ‹แข

แˆแŠ•แŒญ แˆ›แˆ…แ‰ แˆซแ‹Š แˆšแ‹ฒแ‹ซ
๐Ÿ˜2๐Ÿ‘1๐Ÿ”ฅ1๐Ÿค”1