https://leetcode.com/problems/lowest-common-ancestor-of-deepest-leaves/?envType=daily-question&envId=2025-04-04
Daily today. Struggled a bit, but in the end solved with hints. THere are 2 solutions. I come up only with one that keeps "depth"
Daily today. Struggled a bit, but in the end solved with hints. THere are 2 solutions. I come up only with one that keeps "depth"
β€1
Tomorrow there will be stream instead of Sunday in the evening. Talking, solving LeetCode, system design, interview questions
β€3
https://leetcode.com/problems/largest-divisible-subset/description/?envType=daily-question&envId=2025-04-06
This one was hard. Was not able to solve it other than bruteforce without hints. Try it..
This one was hard. Was not able to solve it other than bruteforce without hints. Try it..
π3
andreyka26_se
https://leetcode.com/problems/largest-divisible-subset/description/?envType=daily-question&envId=2025-04-06 This one was hard. Was not able to solve it other than bruteforce without hints. Try it..
Yes this was so far the hardest problem to understand. Usually DP problems are solved completely different way, and the solutions that people suggest are kind of, idk. Very hard to comprehense for me.
But I'm not giving up
But I'm not giving up
π₯2
here we go again xDDDD the fun, literally the fun. But this one seems to be easier than previous one, let's see
https://leetcode.com/problems/partition-equal-subset-sum/description/?envType=daily-question&envId=2025-04-07
https://leetcode.com/problems/partition-equal-subset-sum/description/?envType=daily-question&envId=2025-04-07
π€―2
Let;s goooo. I will share it in article tomorrow. Dp..... it is dp, guys.
What I'm trying to learn from these, is how can I iteratively come up with optimized from bruteforce. Cause I cannot jump usually to bottom up straight away. I need to do this loop: bruteforce -> top down -> bottom up -> optimized bottom up.
What I'm trying to learn from these, is how can I iteratively come up with optimized from bruteforce. Cause I cannot jump usually to bottom up straight away. I need to do this loop: bruteforce -> top down -> bottom up -> optimized bottom up.
β€4
Problem is cool actually - try it:
https://leetcode.com/problems/partition-equal-subset-sum/description/?envType=daily-question&envId=2025-04-07
https://leetcode.com/problems/partition-equal-subset-sum/description/?envType=daily-question&envId=2025-04-07
β€3
Maybe somebody has dealt with long build in Jekyll github pages blogs?
I now waiting around 4-5 minutes for the build from scratch. I guess this is due to static generating and due to the fact I have already 40+ articles with bunch of images.
Is there quick solution? I would assume I would need at least move images to some CDN, ideally the content itself to be returned by some server I would assume. But I have it hosted and built by github, so I'm not sure
I now waiting around 4-5 minutes for the build from scratch. I guess this is due to static generating and due to the fact I have already 40+ articles with bunch of images.
Is there quick solution? I would assume I would need at least move images to some CDN, ideally the content itself to be returned by some server I would assume. But I have it hosted and built by github, so I'm not sure
β€2
andreyka26_se
Let;s goooo. I will share it in article tomorrow. Dp..... it is dp, guys. What I'm trying to learn from these, is how can I iteratively come up with optimized from bruteforce. Cause I cannot jump usually to bottom up straight away. I need to do this loop:β¦
andreyka26 tech
416. Partition Equal Subset Sum
I am Software Engineer at Microsoft. This is my tech blog where I would like to share my findings, guides and docs. Feel free to contact me.
π₯1
Rn, exactly 3-4 people that are feature owners has "away" status in Teams, until fix is deployedπ
π1
So, today gonna prepare one topic about authorization.
Do you know any other way of building login pass -> JWT? Basically, if not - why it is bad way?
Do you know any other way of building login pass -> JWT? Basically, if not - why it is bad way?