New week, New month

Have a productive one 🫶

@byte_philosopher

We are looking for a logo designer for EOTCOpenSource.
Design a logo that you think fits our community’s purpose, and I’ll post your submission here.

The logo should represent the teachings of the Ethiopian Orthodox Church and have a minimalistic style.

Exhausted but doing it for the sake of deadline. I think my gut is also tired with drinking more coffee.

Again coffee again doing it 😩

#randomdays
@byte_philosopher

Should I have to say good night or good morning since it is after 6:00LT🤔

@byte_philosopher

August 1 in Ethiopian calendar 📅

It is not only just starting new month in Orthodoxy it is the start of fast for st. merry. May God answer all our prayers in this fast.

#church #faith
@byte_philosopher

GPT is 5

https://openai.com/gpt-5/

Long time no see 😄 I’m back with an interesting project ... I built my own version control system like Git from scratch in Golang.

Check out my LinkedIn post here:
🔗 https://www.linkedin.com/posts/mesay-lemma_i-built-my-own-git-clone-in-go-and-activity-7359559649827737602-X04d?utm_source=share&utm_medium=member_desktop&rcm=ACoAAEqOqRMBpb1h23sWyMmluckPsBwyxQkg6a0

And if you want to try my web playground:
🔗 https://kit-playground.vercel.app/

This is so cool guys check it out @JmbTalks

Hey fam🌸! Been a while 🤍 Life got busy & I kinda lost the courage to post… but your DMs gave me the push I needed 🙏

⚡ Even though we’re halfway in, I’m starting a Daily LeetCode Grind — 1 problem a day, sharing my wins and fails so we grow together 💻📚

💬 Wanna join? Drop your “I’m in” or thoughts below ⬇️ Let’s keep each other consistent!

@byte_philosopher

#AugustLeetCodeGrind 🔥

#August_14_LeetCode_Grind

🚀 DSA Bite: Queues & Stacks 📚

📌 Stack → Last In, First Out (LIFO)
👉 Example: Stack of plates – last plate on top comes off first.
🔹 Operations: push(), pop(), peek()

📌 Queue → First In, First Out (FIFO)
👉 Example: People in a line – first person in line gets served first.
🔹 Operations: enqueue(), dequeue(), front()

💡 Tip:

Stack → Use when you need to reverse or backtrack (undo, DFS).

Queue → Use when you need order processing (printer queue, BFS).


@byte_philosopher

So for today here is the challange to solve

Implement Stack using Queues

Implement a last-in-first-out (LIFO) stack using only two queues. The implemented stack should support all the functions of a normal stack (push, top, pop, and empty).

Implement the MyStack class:

void push(int x) Pushes element x to the top of the stack.
int pop() Removes the element on the top of the stack and returns it.
int top() Returns the element on the top of the stack.
boolean empty() Returns true if the stack is empty, false otherwise.

So solve it and share it here.

@byte_philosopher