EvoNext
1.79K subscribers
272 photos
16 videos
266 files
485 links
Download Telegram
๐ŸŽโ€ผ๏ธHello dear Family, Algomasters๐ŸŽ‡๐Ÿ’ป

Algomasters is social media platform to provide support for your coding journey.
You can get:-
๐Ÿ‘‰Books
๐Ÿ‘‰short tutors
๐Ÿ‘‰videos and others discussions to help you grow in programming.
๐Ÿซต
* you are politely invited to provide what you have to other thousands waiting to learn from you!


We are available on different media outlets:-

Facebook >>From All over world

Youtube >> Potential videos released

Telegram_discussion_group ยป Giant programmers are already in.


๐Ÿ—ฃ๐Ÿ—ฃ๐Ÿ—ฃ๐Ÿ—ฃ๐Ÿ—ฃ๐Ÿ—ฃ๐Ÿ—ฃ๐Ÿ—ฃYour colleagues deserve this too, Share to them now๐Ÿ”ฑ!

For premium members only:
[If you are looking for any type of programming support : contact me! @fightAgainNow ]

โ™ก ใ…ค โŽ™ใ…ค โŒฒ ๐Ÿ””
หกแถฆแตแต‰ หขแตƒแต›แต‰ หขสฐแตƒสณแต‰ unmute
๐Ÿ‘4
"What the heck is Tailwind CSS?" $$


โœณ๏ธ > Tailwind CSS works by scanning all of your HTML files, JavaScript components, and any other templates for class names, generating the corresponding styles and then writing them to a static CSS file.

โค๏ธThe simplest and fastest way to get up and running with Tailwind CSS from scratch is with the Tailwind CLI tool.

These are some of the core concepts that make Tailwind CSS different from writing traditional CSS.
โšœ๏ธ style elements in the interactive states like hover , focus....
โšœ๏ธ Uses a utility workflow to build complex components
โ˜๏ธ manage duplications and keep your projects maintainable
โœŒ๐Ÿผ customize the framework to match your brand and extend your own styles

Read more Docs on tailwindcss.com/docs


Join to Algomasters: and master your journey

thank you for your time๐Ÿ™
๐Ÿ‘2โค1
๐Ÿ˜‚๐Ÿ˜‚๐Ÿ˜‚๐Ÿ˜‚
๐Ÿคฉ10โค3
Forwarded from Front End Development
๐Ÿ‘1๐Ÿ‘จโ€๐Ÿ’ป1
Do you know About the Programming Principles ?โ‰๏ธ

These are :-
1. KISS (Keep It Simple, Stupid!)๐Ÿคญ

2. Donโ€™t Repeat Yourself (DRY) ๐ŸŒง

3. You Arenโ€™t Gonna Need It (YAGNI) ๐Ÿคทโ€โ™‚๏ธ

4. Document Your Code๐Ÿ“

5. Composition Over Inheritance๐ŸŽ

6. Open/Closed ๐Ÿคฌ

7. Single Responsibility๐Ÿ’

8. SoC โ€“ Separation of Concerns๐Ÿƒ๐Ÿผโ€โ™€๏ธ

9. Minimize coupling๐Ÿ’๐Ÿพโ€โ™€๏ธ

10. Refactor ๐Ÿ‘ฌ

if you wanna read the whole story: Check me !


"Hitting the Join Button below feels like drinking a cup of coffee!" | Facebook | You| Talk |
๐Ÿ‘3โค2โšก1
Forwarded from Front End Development
If you are learning javascript follow these 10 projects to increase your knowledge and coding skills.

1 - To-do list appโšœ๏ธ

2 - Calculator๐Ÿ”ข

3 โ€” Drum Kit๐Ÿฅ

4 - Quiz appโ”

5 - Weather appโ™ป๏ธ

6 - Image Slider๐ŸŒ‡๐ŸŽ†

7 - Random quote generatorโšก๏ธโšก๏ธ

8- Hangman game ๐Ÿงœ๐Ÿปโ€โ™‚๏ธ

9 - Rock-paper-scissors gameโœ‚๏ธ๐Ÿ”–

10 โ€” Tic-tac-toe game ๐Ÿงฎ

Read more @ : Click me !


if you are looking for their source code : #๐Ÿ“ฉ๐Ÿ“ฉ๐Ÿ“ฉcomment below or @fightAgainNow

Much respect for reading the article to the end!๐Ÿ™โฃ๏ธ๐Ÿ’–
๐Ÿ”ฅ3๐Ÿ‘2
โค3๐Ÿ‘2๐Ÿฅฐ1
Top 8 Algorithms Every Programmer Should Know ๐Ÿ’ฏ

1.Sorting algorithms:
Sorting is a fundamental operation in computer science and there are several efficient algorithms for it, such as quicksort, merge sort and heap sort.
2.Search algorithms: Searching for an element in a large dataset is a common task and there are several efficient algorithms for it, such as binary search and hash tables.
3.Graph algorithms: Graph algorithms are used to solve problems related to graphs, such as finding the shortest path between two nodes or determining if a graph is connected.
4.Dynamic programming: Dynamic programming is a technique for solving problems by breaking them down into smaller subproblems and storing the solutions to these subproblems to avoid redundant computation.

5.Greedy algorithms: Greedy algorithms are used to solve optimization problems by making the locally optimal choice at each step with the hope of finding a global optimum.
6.Divide and Conquer: Divide and Conquer is an algorithm design paradigm based on multi-branched recursion. A divide and conquer algorithm breaks down a problem into sub-problems of the same or related type, until these become simple enough to be solved directly.

7.Backtracking: Backtracking is a general algorithmic technique that considers searching every possible combination in a systematic manner, and abandons a particular path as soon as it determines that it cannot be part of the solution.

8.Randomized Algorithm: Randomized algorithms use randomness to solve a problem. It can be useful to solve problems that cannot be solved deterministically or to improve the average case complexity of a problem.
๐Ÿ‘4โค1๐Ÿ”ฅ1
#Problem_Solving_001

Find the Sum OF All Numbers in given a Range.

or
example, sumOfAll([10,5]) should return 45 because sum of all the numbers between 5 and 10 (both inclusive) is 45.

NB: 1. You can use Any Language you can
2. send you answer only at @fightAgainNow
โค1๐Ÿ”ฅ1
#problem_solving_002

Find the Sum All Primes
it returns the sum of all prime numbers that are less than or equal to number provided.

for example;- sumPrimes(10) should return a number, 17.
or sumPrimes(977) should return 73156.

NB: 1. You can use Any Language you can
2. you can send you answer at @fightAgainNow or comment below
โค2โ˜ƒ1