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 ๐ฅ
โก 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 ๐ฅ
๐ฅ9๐3
#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
๐ 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
๐ฅ4
So for today here is the challange to solve
Implement Stack using Queues
So solve it and share it here.
@byte_philosopher
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
๐ฅ3
๐ฅฐ7
#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
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
๐ฅ5
๐ 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
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
๐ฅ9๐5๐คทโโ4๐คทโโ2๐ฟ1
#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
๐ 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
โค3
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
@byte_philosopher
๐5๐2๐ฏ2
This rain reminded me this childhood music "แแแก แแฃ แ แแ แฃแ แ ....."แจแญแฑแต๐
Happy Sunday my people ๐ซถ
@byte_philosopher
Happy Sunday my people ๐ซถ
@byte_philosopher
๐5๐ฅฐ3
๐ฅฐ5โค2
#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
๐ 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
โก2โค1
Me: waking up แ แแ แแแญแ แญ
also the rain: แแฃแ แฃแแฑ แฅแจ แฅแแฐแแ แฐแแ แฑ
แแซ แแฌ....แฅแญแแ แ:)
Happy แกแ แคแฐแฐแฅ๐
@byte_philosopher
also the rain: แแฃแ แฃแแฑ แฅแจ แฅแแฐแแ แฐแแ แฑ
แแซ แแฌ....แฅแญแแ แ:)
Happy แกแ แคแฐแฐแฅ๐
@byte_philosopher
๐13โค4
This media is not supported in your browser
VIEW IN TELEGRAM
Look what I have got on the street of bole แแตแแแซแแ. Idk who are they tho but love it๐
@byte_philosopher
@byte_philosopher
โค10โคโ๐ฅ2๐1
Forwarded from Exodus_Tola๐ช๐น๐ป
๐ 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
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
๐ฅ2
#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
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
โค5๐ฏ4๐1