For technical articles I think that will be it. We are starting soon writing about leaving Microsoft, about relocation to Ireland, about Snowflake, etc.
You gonna have the link the first ofc
You gonna have the link the first ofc
❤4👍2
Daily (116 day streak)
One of the rare cases, where problem is hard, I didin't solve it on my own, but I really liked it. Hints, geometry and intuition are in the comment section
https://leetcode.com/problems/count-number-of-trapezoids-ii/description/?envType=daily-question&envId=2025-12-03
#daily #hard
One of the rare cases, where problem is hard, I didin't solve it on my own, but I really liked it. Hints, geometry and intuition are in the comment section
https://leetcode.com/problems/count-number-of-trapezoids-ii/description/?envType=daily-question&envId=2025-12-03
#daily #hard
andreyka26_se
Daily (116 day streak) One of the rare cases, where problem is hard, I didin't solve it on my own, but I really liked it. Hints, geometry and intuition are in the comment section https://leetcode.com/problems/count-number-of-trapezoids-ii/description/?envType=daily…
As we seen, some math background is needed for the leetcode question above, which was many times asked in Google. So, let's add it as separate posts
How to check that lines are parallel?
1. Calculate vectors out of coordinates
dx = x2 - x1, dy = y2 - y1 => vector = (dx, dy)
2. Calcualte a slope = dy / dx.
3. any two lines that have the same slope (dy/dx) are parallel
#math
1. Calculate vectors out of coordinates
dx = x2 - x1, dy = y2 - y1 => vector = (dx, dy)
2. Calcualte a slope = dy / dx.
3. any two lines that have the same slope (dy/dx) are parallel
#math
👍4
How to check that two vectors are collinear (share the same line)
The idea behind is to calculate where both vector would intercept Y axis.
We can do it using line formula
#math
The idea behind is to calculate where both vector would intercept Y axis.
We can do it using line formula
y = kx + b. For every single point in all vectors we know x, y, k = dy / dx. From these values we can find b#math
1👍3
Daily (117 day streak)
Interesting problem, I wouldn't say it is hard, simulation will work, the trick here to write a good simulation, or figure out smart algo
https://leetcode.com/problems/count-collisions-on-a-road/description/?envType=daily-question&envId=2025-12-04
#daily #medium
Interesting problem, I wouldn't say it is hard, simulation will work, the trick here to write a good simulation, or figure out smart algo
https://leetcode.com/problems/count-collisions-on-a-road/description/?envType=daily-question&envId=2025-12-04
#daily #medium
👍2
Daily (118 day streak)
Happy Friday, enjoy, 3 minutes easy problem
https://leetcode.com/problems/count-partitions-with-even-sum-difference/description/?envType=daily-question&envId=2025-12-05
#daily #easy
Happy Friday, enjoy, 3 minutes easy problem
https://leetcode.com/problems/count-partitions-with-even-sum-difference/description/?envType=daily-question&envId=2025-12-05
#daily #easy
👍3
Daily
This could have been typical dynamic programming problem for 5 mins, BUT, by 38% acceptance rate + people scresming that it should be hard one - now it is not that easy.
Spoiler, O(n^2) will give TLE. We need something more optimized here. Didn't come up with it yet, will do tomorrow after sleep
https://leetcode.com/problems/count-partitions-with-max-min-difference-at-most-k/description/?envType=daily-question&envId=2025-12-06
#daily #medium
This could have been typical dynamic programming problem for 5 mins, BUT, by 38% acceptance rate + people scresming that it should be hard one - now it is not that easy.
Spoiler, O(n^2) will give TLE. We need something more optimized here. Didn't come up with it yet, will do tomorrow after sleep
https://leetcode.com/problems/count-partitions-with-max-min-difference-at-most-k/description/?envType=daily-question&envId=2025-12-06
#daily #medium
👍1