Samri’s Log

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

Happy Monday @tech_world_o1

መልካም ሰንበት 💛

ልቤን ፈተንኸው በሌሊትም ጐበኘኸኝ፤ ፈተንኸኝ፥ ምንም አላገኘህብኝም። መዝሙረ ዳዊት 16:3

አቤቱ፥ ሰምተኸኛልና ወደ አንተ ጠራሁ፤ ጆሮህን ወደ እኔ አዘንብል፥ ቃሌንም ስማ። መዝሙረ ዳዊት 16:6

@byte_philosopher

We’re closer to our future than we think… but still far from who we could be

substack stark #reflection @zaya_journal

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 🤦‍♀️

This guy at such young age 🔥

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

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

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

Day 16: Friday 1, Daily Temperature

this is monotonic stack problem My approach: I iterate through the temperatures, I compare the current temperature with the temperature at the index on top of the stack. While the current temperature is greater, I update the answer for that index and pop it. Then I push the current index. Time : O(n) Space : O(n)

2, Minimum replacement to sort

my approach: iterate from the second-last element to the first, and if it is greater than the element after it, divide the number by that next element. If there is a remainder, we add one to the divisor (for example, if the next element is 7 and the current number is 10, it can’t be divided equally, so 10 // 7 gives 1, and we add one to make it 2. Then the current number becomes 10 // 2). so the number of the replacement is 1 minus the quotient at each step we break the number to make it smaller Time : O(n) space : O(1)

3, Minimum moves to reach target

My approach: To get the minimum moves, I to divide the target number by 2 until it either reaches 1 or I finish available maxDoubles operations. If the value is still not equal to 1, I subtract the 1 from the remaining divided target value. The difference is the number of required decrement moves to get 1, I then add to the moves with the maxDoubles operations. time : O(maxdouble) space : O(1)

4, Rabbit in the forest

My approach: I store the number each rabbit says, plus one (to include itself), in a hashmap. When I see that same number again, I decrement its count until it reaches zero. If it reaches zero, I add that group size to the total, and when I see that number again, I count it as a new group in the hashmap. time : O(n) space : O(k) - number of unique group

5, Decode String

My approach : push the characters of the string into a stack one by one. When I reach a ], I start popping from the stack until I get to the [ , this gives me the substring. Then I pop the digits before the [ to get the number. I multiply the substring by that number and push the multiplied string back onto the stack. I repeat this process until I finish iterating over the entire string. and finally return the string from the stack Space : O(n) time : O(n)

6, Sliding window maximum

My approach: I used a queue to solve this problem. I iterate through the list and append the index to the queue. If the value at the top of the queue is less than the current number, I pop that number and append the current index. If the index at the top of the queue is outside the current window range, I pop the left value. The index value at the top of the queue is the maximum for the current window. time : O(n) space : O(k) - the number of the sliding window

Day 17: Monday It was tree day : I was reading a2sv ppt and understanding tree problems like Delete node , Maximum depth of BT , Sametree and solved this by my self 😁 , easy tho search the exact location using BST logic like if it is less than the current it have to be on the left ... Day 18 : Tuesday Most of the time I encounter dynamic programming problems and end up giving up with my brute force approach So I took the day to understand it, and I read the dynamic programming chapter from the Grokking Algorithms book. It is interesting how it approaches problems like the Longest Common Substring. solved this : 1. Shifting letters 2 : dp problem

approach : I used a difference array to store the shifts. For each shift , I increment or decrement the start and end + 1 indices in the array based on the direction of the shift. Then, I calculate the prefix sum of the difference array to get the net shift for each character. Finally, I apply the shift to each character in the string using ASCII values time : O(m+n) n - the length of the list , m - the length of the shifts space : O(n)

2, maximum subarray : non dp

approach : get the maximum of the list and using sum compute prefix sum and when the sum became negative reset the sum to zero. in each iteration we save the max of the current sum and the maximum time : O(n) space : O(1)

If you see me today, you’re seeing a reflection of my parents:their dedication and their courage From childhood until now, my birthdays were always filled with cakes, and gifts. But today, on my mom’s birthday, I wanted to give something different… something meaningful. So I built her a portfolio website. This is my mom, a woman who walked through countless struggles, yet still rose to earn her PhD and raise us with strength and love. Everything I am is rooted in what she gave me. Even though I’m away at university, I sent this to her today and yes, it made her emotional (and me too). Check it out 🤍 Happy Birthday My MOM🎊 @byte_philosopher

Hey guys! I built A2BRIDGE to help students from AAU, ASTU, and AASTU prep for A2SV. It has: LeetCode & Codeforces sections – practice problems A2Practice – for beginners: write, run, test code, plus solutions Interview Session – real questions asked to recent hires Track your progress as you go. This is just the start, solve problems and you'll be ready to join A2SV. My first side project live! Please test it and share feedback 🙏 @herstack @glowbugg