Bytephilosopher(Yostina)
213 subscribers
25 photos
1 video
10 links
๐Ÿ‘‹๐Ÿพ Hey, I'm Yostina โ€” a curious mind exploring tech, AI, and social change.
From machine learning to full-stack dev
Download Telegram
Happy Sunday beautiful souls๐Ÿซถ
@byte_philosopher
โค14
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 ๐Ÿ”ฅ
๐Ÿ”ฅ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
๐Ÿ”ฅ4
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
๐Ÿ”ฅ3
I will drop my answer and approach tomorrow. Good night everyone ๐Ÿค— ๐Ÿ˜ด

@byte_philosopher
๐Ÿฅฐ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
๐Ÿ”ฅ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
๐Ÿ”ฅ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
โค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
๐Ÿ‘5๐Ÿ‘Œ2๐Ÿ’ฏ2
This rain reminded me this childhood music "แ‹แŠ“แ‰ก แˆ˜แŒฃ แŠ แŠ•แŒ แ‰ฃแŒ แ‰ ....."แŒจแˆญแˆฑแ‰ต๐Ÿ˜

Happy Sunday my people ๐Ÿซถ

@byte_philosopher
๐Ÿ˜5๐Ÿฅฐ3
Good morning guys, Have a productive week!

@byte_philosopher
๐Ÿฅฐ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
โšก2โค1
So here is all about today

แ‹ฐแˆ…แŠ“ แŠฅแ‹ฐแˆฉ ๐Ÿซถ
๐Ÿฅฐ2
Me: waking up แ‰ แ‹“แˆ แˆˆแˆ›แŠญแ‰ แˆญ

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
โค10โคโ€๐Ÿ”ฅ2๐Ÿ™‰1
๐Ÿš€ 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
๐Ÿ”ฅ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
โค5๐Ÿ’ฏ4๐Ÿ‘1