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

I will drop my answer and approach tomorrow. Good night everyone 🤗 😴

@byte_philosopher

#August_15_LeetCode_Grind

Hey, lovelies, today I was learning sorting algorithm but didn't finished it. I understanded the concepts but getting hard to bit the leetcode challanges. So I will finish and post them tomorrow. Since it's Saturday let's take a deep sleep today and grid it tomorrow well.

Have a beautiful dream. 🫶

@byte_philosopher

🌞 Morning Lark(የጠዋት ወፍ) or 🌙 Night Owl(የለሊት ጉጉት) ?

Which one are you?

React below to vote
👍 for Morning Lark
🔥 for Night Owl

And drop a comment — why do you feel this

@byte_philosopher

#August_16_LeetCode_Grind


📊 Sorting in DSA (Quick Summary)

🔹 Definition: Sorting means arranging data in a particular order (ascending/descending).
🔹 Why it matters: Makes searching faster ⚡, data easier to analyze, and algorithms more efficient.

🧮 Common Sorting Algorithms

🧩 Bubble Sort → Compare & swap (Simple but slow 🚶).

⚡ Quick Sort → Divide & conquer, very fast in practice.

📚 Merge Sort → Stable, good for linked lists.

⚙️ Insertion Sort → Good for small datasets.

🏎️ Heap Sort → Based on binary heap, efficient.


✅ Tip: Always choose sorting based on data size + constraints.


@byte_philosopher

So Today I was trying to beat the amazjng part of DSA which is sorting. The core thing for data organization in Machine learning. I also tried to solve leetcode problem. ግን እኔ ብቻ ነኝ ጥያቄው ገብቶኝ code መፃፍ የሚያቅተኝ:: i just know the question and know the concepts but when it comes to leetcode ወፍ. Anyways we keep learning until we understand it.

@byte_philosopher

This rain reminded me this childhood music "ዝናቡ መጣ አንጠባጠበ....."ጨርሱት😁

Happy Sunday my people 🫶

@byte_philosopher

Good morning guys, Have a productive week!

@byte_philosopher

This is a bit funny guys especially as a government company ad😁

@byte_philosopher

#August_18_LeetCode_Grind

📌 Topic: Binary Search 🔍

Today’s grind is all about sharpening our Binary Search skills.
Binary Search is one of the most fundamental algorithms in coding interviews – efficient, elegant, and powerful for solving search-based problems in O(log n) time.

✨ Why it matters?

Used in searching sorted arrays & matrices 📊

Core for solving advanced problems like search in rotated arrays, peak finding, etc.

Reduces brute force and saves runtime ⚡


🔥 Your challenge for today:

Revisit the classic Binary Search template

Solve 2–3 LeetCode problems that apply it in creative ways


💡 Pro tip: Always think about the midpoint and whether to move left or right. Mastering this logic unlocks many problems beyond simple searching.
@byte_philosopher

So here is all about today

ደህና እደሩ 🫶

Me: waking up በዓል ለማክበር

also the rain: መጣና ባመቱ እረ እንደምን ሰነበቱ
ሆያ ሆዬ....እርገጠው:)

Happy ቡሄ ቤተሰብ🎉
@byte_philosopher

Look what I have got on the street of bole መድሃኒያለም. Idk who are they tho but love it👀

@byte_philosopher

🚀 Introducing Gissy – Your Personal Git Assistant

Tired of repetitive Git tasks? Meet Gissy, a sophisticated open-source CLI tool that automates your Git workflow and boosts your productivity — powered by OpenAI, Gemini, and Addis AI for local language support :)

✨ Why Gissy?
. Smart file watcher: auto-detects changes, runs tests, lint, commits & pushes
. Automatic SSH setup for GitHub
. AI-powered commit messages that truly make sense
. Works instantly with zero configuration
. Multi-AI support: OpenAI | Gemini | Addis AI
. Clean and enhanced Git commands for a better workflow
. Cross-platform: Windows, macOS & Linux

⚡ You can install it globally with npm or run it instantly with npx — no installation required!

👉 Try Gissy here: [LINK]
⭐ Found it useful? Give it a GitHub star: [LINK]

📢 kindly Share with your friends

✨ Proudly sponsored by Addis AI ✨

#OpenSource #CLI
@Exodus_Tola

#August_20_LeetCode_Grind

today I was just exploring what trees are and doing leetcode problems. This topic is a bit vast and with doing side projects it feels overwhelming . But here we are struggling to face the challange. Today I also noticed that I have only 2 or 3 weeks to start my 2nd year. Somehow it feels guilty when it comes to accomplishing your goal. And at the same time you need to rest but your mind can't . So here we are " we struggle to satisfy our mind and we kill the feeling of rest to feed the satsfaction for our soul"

መስራት ያስከብራል ሀገርን ያኮራል

@byte_philosopher

እንኳን ለእናታችን ለእመቤታችን ቅድስት ድንግል ማርያም በዓለ ዕርገት እና ትንሳኤ አደረሳችሁ አደረሰን 💛

📸ሐመረ ኖህ እንጦጦ ኪዳነምህረት

@byte_philosopher

#August_21_22_23LeetCode_Grid

I finished my study on trees here is the short summery

🌳 Trees in Data Structures 🌳

Think of a Tree like a family tree or folder system:

🌱 Root → the starting point

🌿 Branches (children) → connect to other nodes

🍂 Leaves → end nodes with no children

✨ Popular Trees:

🌲 Binary Tree → max 2 children per node

🔎 Binary Search Tree (BST) → left < root < right

🏗 Heaps & Balanced Trees → used in priority queues, databases

⚡ Why Learn Trees?
✔ Organize data efficiently
✔ Fast search & sorting
✔ Used in file systems, AI, compilers, HTML DOM

📌 Next time you open folders on your PC… you’re walking through a tree 🌳😉

@byte_philosopher

ደህና እደሩ🫶

@byte_philosopher