Bytephilosopher

This channel gives me a clear roadmap to machine learning warrior. It is only 15 minute. Check it out. https://youtu.be/qNxrPri1V0I?si=huTOTD4NZENnZxpz

EOTCOpenSource ✝️ EOTCOpenSource is a collaborative community dedicated to uniting Ethiopian Orthodox Tewahedo Church (EOTC) believers with developers, designers, and contributors from around the world. Our mission is to build open-source digital tools that support the Church, its followers, and its sacred traditions. We create modern software rooted in the ancient values of the Orthodox faith, making spiritual and cultural resources more accessible for generations to come. Our projects aim to serve the diverse needs of the EOTC community. We focus on creating high-quality, reliable, and accessible tools, including: Mobile & Web Apps: Tools for prayer, learning, and community engagement. Digital Calendars: Liturgical calendars with feasts, fasts, and saints' days. Digital Texts & Archives: Digitizing liturgical books, hagiographies, and important texts in Amharic, Ge'ez, and other languages. Liturgical Tools: Software to assist clergy and laity in Church services and prayers. Chant & Hymn Resources: Platforms for learning and preserving the rich tradition of EOTC chants (Zema). Join community: https://t.me/EOTCOpenSource Github Link: https://github.com/EOTCOpenSource/EOTCOpenSource

What I’ve Learned from Solving LeetCode Challenges 💻🧠

1. Understand the Question Deeply

Don’t rush — take time to fully grasp the problem. Also, understand how your code will be tested so you can write solutions that truly pass all conditions.

2. Build Your Own Logic

Instead of relying too heavily on built-in keywords or shortcuts, try developing your own approach. Sometimes, overusing these shortcuts can lead to unexpected errors.

3. Debug in Your Mind 🧩

Before running your code, mentally simulate it with sample inputs. This helps catch logic flaws early and improves your problem-solving skills. Keep pushing! Every bug fixed is a step closer to mastery 🔥 #LeetCode #CodingJourney #Debugging #ProblemSolving #LearnToCode @byte_philosopher

Python 3.14 is here with some exciting updates for developers! The biggest news for most of you is the improved performance for multi-threaded apps thanks to official support for free-threaded Python. Plus, a new concurrent.interpreters module opens the door for true multi-core parallelism within a single process, offering a new way to write concurrent code that bypasses the GIL for better efficiency. You'll also find smarter error messages to help you debug faster. Keep an eye out for these changes making your coding life a bit easier! Test the JIT build of CPython by adding export PYTHON_JIT=1 as new environment variable. https://docs.python.org/3.14/whatsnew/3.14.html

Good night family 🫶 @byte_philosopher

“There is nothing so strong as gentleness and nothing so gentle as real strength.”

+St. Jerome @byte_philosopher

😁

Excersise for today Create leetcode account and do this then push it to leetcode hub https://leetcode.com/problems/concatenation-of-array/ @byte_philosopher

For more https://youtu.be/gDqQf4Ekr2A?si=oNvw8rtrqHDrft-Z @byte_philosopher

Here is the Python code of arrays but manually that actually look like in leetcode challange

# Insert at index i
def insert_at(arr, i, val):
    n = len(arr)
    new_arr = [0] * (n + 1)
    for j in range(i):
        new_arr[j] = arr[j]
    new_arr[i] = val
    for j in range(i, n):
        new_arr[j + 1] = arr[j]
    return new_arr

# Delete at index i
def delete_at(arr, i):
    n = len(arr)
    new_arr = [0] * (n - 1)
    for j in range(i):
        new_arr[j] = arr[j]
    for j in range(i + 1, n):
        new_arr[j - 1] = arr[j]
    return new_arr

# Append at end
def append(arr, val):
    n = len(arr)
    new_arr = [0] * (n + 1)
    for i in range(n):
        new_arr[i] = arr[i]
    new_arr[n] = val
    return new_arr

📌 Arrays are efficient for random access but slow for shifting. This matters a lot when optimizing real-world problems. @byte_philosopher

#Day1 Today I learned the basics of DSA (Data Structures & Algorithms) — the backbone of problem-solving in programming. 🔹 DSA helps write efficient code by organizing data (e.g., arrays, trees) and applying algorithms (e.g., search, sort). 🔹 Started with Arrays — ordered collections of elements. 📦 Static vs Dynamic Arrays: Static Array: Fixed size (e.g., C/C++). Dynamic Array: Resizable (e.g., Python list, Java ArrayList). ⚙️ Big-O Notation: Used to measure time/space complexity. Access: O(1) Insert/Delete at middle: O(n) Insert at end (amortized): O(1) Insert at beginning: O(n) @byte_philosopher

#day1 I tried to study what DSA(data structure and algorithm) is and the most simple DSA which is Array. @byte_philosopher

Hello my people, I am thinking about posting my learning journey of DSA fundamentals. So I will post the summery of today's lesson and some resources daily. Let me know any resources you may recommend me. @byte_philosopher

As today is 21🕯 (in Orthodoxy we celebrate st. Mary in this day)☦ so let me share you my fav part of Tselote arganon @byte_philosopher

Today i was working on flask with react. It literally took me the whole day to figure out CORS and also sleeping leaving it with bug oh 🙃. The hard part of being developer is debugging.🤦‍♀ @byte_philosopher

Good morning my people It is Monday. New day new beginning. Have a great weekday.

Happy Sunday y'all🫶

The lesson of humility cannot be taught by intellectual persuasion, but only by a prolonged and bitter struggle against one’s ego. –Matthew the Poor

This month I was focusing on ML traning datasets to build real world projects and hosted my first version of it a few days ago Version 1 https://word-analyzer.streamlit.app And second version today Version 2 https://word-analyzer-v1.streamlit.app So check which one do you think better and please suggest me a way that I can improve it. Also if you know a really good dataset let me know

Happy holiday for all who celebrate st. Gebriel ☦ ዝክር ተጠርታችኋል everyone😁