eyob 👨‍💻 @eyobcode

Software Engineer | Cybersecurity Enthusiast | Full-Stack Developer | Building apps, websites & security solutions. Joined June 2024

Tweets

41
Followers

4
Following

102
Likes

406

eyob 👨‍💻 @eyobcode

5 months ago

🚀 Implemented Breadth-First Search in Python—exploring level by level to guarantee shortest paths in unweighted graphs! How do you visualize your frontier? 👀 #AI #Python #100DaysOfCode @python_lang

0 0 0 78 0

Download Image

AI Search Algorithms Uninformed (BFS, DFS, UCS) = no heuristics Informed (Greedy, A*) = use heuristics The right search = faster, smarter AI. This diagram helped me visualize everything! #AI #Python #100DaysOfCode #MachineLearning

0 0 1 62 0

Download Image

eyob 👨‍💻 @eyobcode

5 months ago

Starting fresh with Python Crash Course (3rd Edition) by @ehmatthes. Already know Python, but this time it’s all about sharpening fundamentals and building clean, powerful projects. Let’s go! #100DaysOfCode #Python #BuildInPublic

0 0 3 47 0

Download Image

eyob 👨‍💻 @eyobcode

6 months ago

Python tip: Use enumerate() when you need both index and value in a loop. Simple & clean: for i, val in enumerate(my_list):

0 0 1 33 0

eyob 👨‍💻 @eyobcode

6 months ago

What’s the best beginner coding project you’ve ever done? Looking for inspiration!

0 0 2 38 0

eyob 👨‍💻 @eyobcode

6 months ago

Just finished building a REST API with Flask! Python makes it fun. Next: adding user auth. Any tips?

0 0 1 31 0

eyob 👨‍💻 @eyobcode

6 months ago

Hi, I'm eyob! I'm learning web development and python love sharing what I learn. Follow me for coding tips, beginner struggles, and project updates. Let’s grow together!

0 0 1 64 0

eyob 👨‍💻 @eyobcode

6 months ago

A* algorithm = smart pathfinding. It uses: f(n) = g(n) + h(n) g(n) = actual cost h(n) = guessed cost It’s faster than BFS but still finds the best path. Used in games, GPS, bots. #AI #AStarAlgorithm #TechContent

0 0 1 46 0

eyob 👨‍💻 @eyobcode

6 months ago

BFS vs DFS: You’re in a building looking for a friend. BFS = Check all rooms on the floor first. DFS = Go deep into one path until you hit a dead end. Use BFS for shortest path. DFS is better for memory use. #AI #CodingTips #DevLife

0 0 1 33 0

eyob 👨‍💻 @eyobcode

6 months ago

Ever wondered how AI finds the shortest path in a maze? It uses search algorithms like: - BFS - DFS - A* - Greedy Best-First Search They explore paths, avoid dead ends, and choose the best move. Follow for easy breakdowns. #AI #SearchAlgorithm #TechTwitter