uz
Feedback
Samri’s Log

Samri’s Log

Kanalga Telegram’da o‘tish

Hey, I’m Samri 🤗. I’m a junior developer hooked on AI and ML. This channel’s my logbook , where I drop resources, share little finds, jot down thoughts, and track my progress along the way.

Ko'proq ko'rsatish
Mamlakat belgilanmaganToif belgilanmagan
254
Obunachilar
Ma'lumot yo'q24 soatlar
+27 kunlar
+230 kunlar
Postlar arxiv
hackathon in alx
hackathon in alx

Repost from Genesis
let that sink in!!
let that sink in!!

some smart friends make your life easier 👌

Repost from NoorifyLabs
photo content

One thing I learned: if you feel where the boat will take you, where you don’t want to be, don’t hope it won’t , save yourself early. And I’m not talking about a boat. 🙂

For some personal reason , for 1 or 2 weeks I m taking a break from my 100 days (weekdays) of self development challenge ✌️

Day 20: Friday leetcode: 1, NQueen 2, Minimum Depth Codeforce : div3 Contest

Repost from Lid's Verse
Happy Monday @tech_world_o1
Happy Monday @tech_world_o1

Repost from Bytephilosopher
መልካም ሰንበት 💛 ልቤን ፈተንኸው በሌሊትም ጐበኘኸኝ፤ ፈተንኸኝ፥ ምንም አላገኘህብኝም። መዝሙረ ዳዊት 16:3 አቤቱ፥ ሰምተኸኛልና ወደ አንተ ጠራሁ፤ ጆሮህን ወደ እኔ አዘንብል፥ ቃሌንም ስማ። መዝ
መልካም ሰንበት 💛
ልቤን ፈተንኸው በሌሊትም ጐበኘኸኝ፤ ፈተንኸኝ፥ ምንም አላገኘህብኝም። መዝሙረ ዳዊት 16:3
አቤቱ፥ ሰምተኸኛልና ወደ አንተ ጠራሁ፤ ጆሮህን ወደ እኔ አዘንብል፥ ቃሌንም ስማ። መዝሙረ ዳዊት 16:6
@byte_philosopher

Repost from Zaya
We’re closer to our future than we think… but still far from who we could be substack stark #reflection @zaya_journal
We’re closer to our future than we think… but still far from who we could be
substack stark #reflection @zaya_journal

Repost from Coolio
Selam everyone, we're happy to announce that we are hosting an amazing event tomorrow full of fun activities and creative peo
Selam everyone, we're happy to announce that we are hosting an amazing event tomorrow full of fun activities and creative people. initial meeting will be at 4LT at bora where we will spend our morning playing amusement park games, socializing, listening to music and much more after spending quality morning time, we'll move to our afternoon plan where we will go to social addis to have lunch, drink coffee, socialize, play card games, do challenges and most importantly socialize and get to know each other. who ever you are, you are very welcome to join us, have fun and socialize. if you're interested in coming, please just comment, I'm interested. we also have a meeting today (28/03/26) at our telegram group, you are more than welcomed to attend. join the group https://t.me/+PztA00VIt31kN2I0 we're very excited to see you all ❤️❤️❤️ #Dev_Event_Ethiopia

Lately, my mood depends on the problem I am solving 🙄 Is it just me 🤦‍♀️

What do u need
Anonymous voting

This guy at such young age 🔥

Repost from Sanyi
Introducing YScroll. YScroll helps you track your scrolling time and control it with features like Daily Limit, Session Limit, Focus Mode, Break Mode, and Cooldown Limit. YScroll is now available on the Google Play Go give it a try The app is still in the early stages, so if you find any bugs or have feedback, feel free to tell me. I’d really appreciate it. @thesanyi

Day 19 Early in the morning, I solved these 3 leetcode problems and in the evening, I solved a few more problems with guidance. 1, phone number letter combination : backtracking
myapproch : first prepare hashmap for the digits. I pass the first index to a helper function and iterate through the hasmap of the phone book and append character to a path and call that function (recurse) with the next index and then pop value from path. if path length is equal to digit length append the string in to result list. finally, return the result time : O(4**n n) space : O(1)
2, Combination :
my approach: iterate through numbers from 1 to n, and at each step, append the number to the current path and do recursion using the current number. if the path reaches length k, save a copy to the result array. after exploring a number, pop it from the path and continue with the next number in the loop. finally return the answer array time : O(n**k) space : O(1)
3, Remove node
my approch : I used stack. I push to the stack if the current value is greater than the top of the stack , if not I pop from the stack until it is true. finally, pop from left of the stack and build the linkedlist space : O(n) time : O(n)
Late at night, I joined this codeforce virtual contest but I spent over 1 hour in D , so I think it is time to sleep 🚶🏽‍♀️‍➡️

Whyyy now 😤 It was working well eko the whole day
Whyyy now 😤 It was working well eko the whole day

Be me :) sleep to take a 30 minute nap and end up sleeping 2 hrs 😭

Repost from Micky Codes
I built a beginner-friendly C++ DSA project and I’m sharing it as a gift for anyone learning the basics. It currently includes Arrays, Linked List, Stack, Queue, Tree, Graph, and Matrix foundations. You can run one module at a time by changing the source file in CMake, so it is simple to explore and learn step by step. Graph and Matrix are still in active development, and more features are coming to make concepts easier to understand. If you are starting DSA, this is for you. Github Link