Samsung Galaxy Ring is coming
This is What We Know About:
- Three colours: silver, black, and gold
- Sizes will range from 5 to 13
- Heart rate sensor
- Support for a new Samsung Health feature called “My Vitality Score”.
- The release date is expected to be July
This is What We Know About:
- Three colours: silver, black, and gold
- Sizes will range from 5 to 13
- Heart rate sensor
- Support for a new Samsung Health feature called “My Vitality Score”.
- The release date is expected to be July
👍2
13 Free Tailwind CSS libraries you should check:
🌊 Flowbite
📏 Preline UI
🌊 Ripple UI
🌼 Daisy UI
🔍 Sira
💡 Tailwind Elements
🐍 Mamba UI
🔪 Kutty
⛵️ Sailboat UI
🚀 HyperUI
🧱 Tailblocks
🌟 Meraki UI
📏 Headless UI
@EmmersiveLearning
🌊 Flowbite
📏 Preline UI
🌊 Ripple UI
🌼 Daisy UI
🔍 Sira
💡 Tailwind Elements
🐍 Mamba UI
🔪 Kutty
⛵️ Sailboat UI
🚀 HyperUI
🧱 Tailblocks
🌟 Meraki UI
📏 Headless UI
@EmmersiveLearning
👍4
When someone asks you what programming language they should learn, don’t simply answer the one you prefer.
first, ask what area they plan to focus on. for example:
- Web Frontend: JavaScript
- Backend: JavaScript
- Mobile apps: JavaScript
- Games: JavaScript
- AI: JavaScript
...and that is why we say, Learn JavaScript!....
https://www.youtube.com/watch?v=jF5oxeeuu6E
first, ask what area they plan to focus on. for example:
- Web Frontend: JavaScript
- Backend: JavaScript
- Mobile apps: JavaScript
- Games: JavaScript
- AI: JavaScript
...and that is why we say, Learn JavaScript!....
https://www.youtube.com/watch?v=jF5oxeeuu6E
YouTube
JavaScript Full Course in #Amharic: የ JS ሙሉ ኮርስ ከመጀመሪያ እስከ መጨረሻ (Complete Beginner to Advanced)
Welcome to the Complete JavaScript Full Course in Amharic! 🚀 This course is designed to teach you JavaScript, the programming language that powers the web. Whether you're new to coding or want to enhance your skills, this course will take you from beginner…
😁2❤1👍1
Stepping up in tech without a mentor is like growing up in life without a father 😪
Have a mentor of seniors.
Mentor juniors and beginner's.
Have a mentor of seniors.
Mentor juniors and beginner's.
❤2
Learning web development is all about micro steps.
In the first 3 months, try a bit of everything:
Rough plan might be:
• Start with HTML, CSS
• JavaScript, DOM
• Git and GitHub
• React
• Node.js and APIs
Make sure to build projects using each technology.
@EmmersiveLearning
In the first 3 months, try a bit of everything:
Rough plan might be:
• Start with HTML, CSS
• JavaScript, DOM
• Git and GitHub
• React
• Node.js and APIs
Make sure to build projects using each technology.
@EmmersiveLearning
👍4
What HTML attribute is used to apply CSS styles to a specific group of elements?
A) class
B) id
C) style
D) tag
A) class
B) id
C) style
D) tag
👍3
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
|
|-- Online_Judges_and_Practice_Platforms
| |-- LeetCode
| |-- HackerRank
| |-- CodeChef
| |-- Codeforces
| └─ HackerEarth
|
└─ Interview_Preparation
|-- Commonly_Asked_DSA_Interview_Questions
|-- Mock_Interviews
|-- Problem-Solving_Strategies
|-- Time_and_Space_Complexity_Analysis
└─ Coding_Patterns_and_Techniques
---------------- END --------------
@EmmersiveLearning
|
|-- 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
|
|-- Online_Judges_and_Practice_Platforms
| |-- LeetCode
| |-- HackerRank
| |-- CodeChef
| |-- Codeforces
| └─ HackerEarth
|
└─ Interview_Preparation
|-- Commonly_Asked_DSA_Interview_Questions
|-- Mock_Interviews
|-- Problem-Solving_Strategies
|-- Time_and_Space_Complexity_Analysis
└─ Coding_Patterns_and_Techniques
---------------- END --------------
@EmmersiveLearning
👍4
a concise roadmap to full-stack development:
1.Basics: Learn HTML, CSS, and JavaScript.
2. Front-End: Master a JavaScript framework (React, Angular, or Vue.js).
3. Back-End: Choose a backend language (Node.js, Python, Ruby, Java, or PHP) and learn a framework (Express.js, Django, Rails, Spring Boot, Laravel).
4. Databases: Learn SQL and a NoSQL database (MongoDB).
5. Authentication: Understand user authentication and authorization mechanisms (JWT, OAuth).
6.Deployment: Learn to deploy applications on platforms like Heroku, AWS, or DigitalOcean.
7.Testing: Familiarize yourself with testing methodologies and frameworks.
8. Continuous Learning: Stay updated with the latest trends and technologies, contribute to open-source, and build projects to improve skills.
Learn with us: https://www.youtube.com/@EmmersiveLearning/
1.Basics: Learn HTML, CSS, and JavaScript.
2. Front-End: Master a JavaScript framework (React, Angular, or Vue.js).
3. Back-End: Choose a backend language (Node.js, Python, Ruby, Java, or PHP) and learn a framework (Express.js, Django, Rails, Spring Boot, Laravel).
4. Databases: Learn SQL and a NoSQL database (MongoDB).
5. Authentication: Understand user authentication and authorization mechanisms (JWT, OAuth).
6.Deployment: Learn to deploy applications on platforms like Heroku, AWS, or DigitalOcean.
7.Testing: Familiarize yourself with testing methodologies and frameworks.
8. Continuous Learning: Stay updated with the latest trends and technologies, contribute to open-source, and build projects to improve skills.
Learn with us: https://www.youtube.com/@EmmersiveLearning/
👍6
Forwarded from Muhammed Teshome
Be Warrior!
Fight for Poverty.
Fight for Peace.
Fight for Fairness.
Fight for Freedom.
—————
Be the warrior in life's grand arena,
With courage as your steadfast shield.
Fight for the poor, their silent subpoena,
Till poverty's power is forced to yield.
March for peace on war's weary borders,
Where hope and harmony are sown.
Stand for fairness, break injustice's orders,
Till seeds of equity have grown.
Raise your voice for freedom's bright morrow,
A day when all chains are undone.
Be the warrior, brave through sorrow,
Till the battle for right is won.
Fight for Poverty.
Fight for Peace.
Fight for Fairness.
Fight for Freedom.
—————
Be the warrior in life's grand arena,
With courage as your steadfast shield.
Fight for the poor, their silent subpoena,
Till poverty's power is forced to yield.
March for peace on war's weary borders,
Where hope and harmony are sown.
Stand for fairness, break injustice's orders,
Till seeds of equity have grown.
Raise your voice for freedom's bright morrow,
A day when all chains are undone.
Be the warrior, brave through sorrow,
Till the battle for right is won.