andreyka26_se
The expected answer probably implies some db knowledge, potentially avoiding index creation, and potentially going with NULL first. BUT The actual way of doing it if you respect customers, your engineers and oncall - is typical 3 step migration: Bring new…
This is golden rule we have migrated tons of different shit at MS like that. No principal would approve any other approach.
❤1
andreyka26_se
Good luck with that. Actually number of records is irrelevant. It is about reliability. You can never be sure your migration will work without error 100% on prod instance. If it does not - you have downtime, lost data(as recovery is from backup, or roll…
Yes, let me correct myself.
Volodymyr is right about that specific case.
Probably nothing will happen and it will work on single db(with low rps)
I would go that way ONLY
- if I can afford downtime + backup + losing data
- If I am okay to be down until I hot fox and roll forward
Otherwise - 3 steps.
Volodymyr is right about that specific case.
Probably nothing will happen and it will work on single db(with low rps)
I would go that way ONLY
- if I can afford downtime + backup + losing data
- If I am okay to be down until I hot fox and roll forward
Otherwise - 3 steps.
❤2
andreyka26_se
Yes, let me correct myself. Volodymyr is right about that specific case. Probably nothing will happen and it will work on single db(with low rps) I would go that way ONLY - if I can afford downtime + backup + losing data - If I am okay to be down until I…
I have trust issues with software, sorry
❤2
This media is not supported in your browser
VIEW IN TELEGRAM
Would you come to me as to doctor, if I am same quality doc as I am engineer?😆😆😆😆😆
👍4❤1
andreyka26_se
Segment tree. Previously we have discussed Heap. Today we are doing Segment Tree. Don't skip, my friend was asked question for Segment Tree during Data Brix interview - so it is asked, rarely but still. We will consider the simplest segment tree application…
Daily 433d day streak.
Same problem as yesterday, but bigger complexity.
It is segment tree problem, suggest to skip, if you want to train segment tree - try simpler one (in reply to that message).
https://leetcode.com/problems/subarrays-distinct-element-sum-of-squares-ii/description/?envType=daily-question&envId=2026-10-16
#daily #hard #pattern
Same problem as yesterday, but bigger complexity.
It is segment tree problem, suggest to skip, if you want to train segment tree - try simpler one (in reply to that message).
https://leetcode.com/problems/subarrays-distinct-element-sum-of-squares-ii/description/?envType=daily-question&envId=2026-10-16
#daily #hard #pattern
❤3
The guy is from Moldova. We had a Leetcode mock interview in the beginning of the summer.
Now he relocated to Ireland, interviewing with many companies, and eventually we met in person in noname coworking, cause Snowflake does not have nice office to show😆
Let’s wish him offers, as market in Ireland at least is not that great.
Now he relocated to Ireland, interviewing with many companies, and eventually we met in person in noname coworking, cause Snowflake does not have nice office to show😆
Let’s wish him offers, as market in Ireland at least is not that great.
❤20👍5
Daily 434th day streak
Interesting and unique problem.
Was pretty hard for me to build an intuition. But solution has pattern, so I would recommend.
https://leetcode.com/problems/minimum-swaps-to-sort-by-digit-sum/description/?envType=daily-question&envId=2026-10-17
#daily #medium #pattern
Interesting and unique problem.
Was pretty hard for me to build an intuition. But solution has pattern, so I would recommend.
https://leetcode.com/problems/minimum-swaps-to-sort-by-digit-sum/description/?envType=daily-question&envId=2026-10-17
#daily #medium #pattern
❤2
Had to show my CT scan to Ukrainian friend. Wanted to make it as easy as possible to see that scan so no need to install any app, etc
This is why I love about AI. 15 mins + my manual deployment: here you go, you have CT scan viewer. Just like that. Everyone can do it. Cheap and easy. Scary... and good at the same time
Btw look how big my heart is😁 I thought it is smaller.
This is why I love about AI. 15 mins + my manual deployment: here you go, you have CT scan viewer. Just like that. Everyone can do it. Cheap and easy. Scary... and good at the same time
Btw look how big my heart is😁 I thought it is smaller.
❤7🤯1
for old school people like me who from time to time automatically open "tran" -> "translate.google.com" to recall English word:
is it only me or google translate became MASSIVELLY slower especially on first run, sometimes I'm waiting for 5 secs until I see my characters appear on the text area?
is it only me or google translate became MASSIVELLY slower especially on first run, sometimes I'm waiting for 5 secs until I see my characters appear on the text area?
❤9
Daily 435th day streak
Pretty hard problem (to build intuition for). Implementation is quite easy. It is pretty unique, apart from one nice math trick you would learn here.
Otherwise no pattern I would not recommend. The math trick will be shown separately in separate post
https://leetcode.com/problems/number-of-ways-to-reorder-array-to-get-same-bst/description/?envType=daily-question&envId=2026-10-18
#daily #hard #nopattern
Pretty hard problem (to build intuition for). Implementation is quite easy. It is pretty unique, apart from one nice math trick you would learn here.
Otherwise no pattern I would not recommend. The math trick will be shown separately in separate post
https://leetcode.com/problems/number-of-ways-to-reorder-array-to-get-same-bst/description/?envType=daily-question&envId=2026-10-18
#daily #hard #nopattern
❤2
andreyka26_se
Daily 435th day streak Pretty hard problem (to build intuition for). Implementation is quite easy. It is pretty unique, apart from one nice math trick you would learn here. Otherwise no pattern I would not recommend. The math trick will be shown separately…
Interesting thing that I knew about combinations - is that you can precompute them using pascal triangle.
Generally the formula is:
Pascal triangle formula is:
===
It is nice, cause I always keep forgetting combinations formula, and it is very hard for me to recreate it from the simple examples.
Now on the interview I can just state: there is formula, I don't remember but I know Pascal triangle will do the job.
#leetcode #datastructures #math
Generally the formula is:
C(n, k) = n! / (k! · (n − k)!)Pascal triangle formula is:
C(n, k) = C(n−1, k−1) + C(n−1, k)===
It is nice, cause I always keep forgetting combinations formula, and it is very hard for me to recreate it from the simple examples.
Now on the interview I can just state: there is formula, I don't remember but I know Pascal triangle will do the job.
#leetcode #datastructures #math
👍3❤1
Daily 436th day streak
Easy, 1 min codding. Thanks, leetcode, I'll have free Monday😁.
No pattern though.
https://leetcode.com/problems/find-target-indices-after-sorting-array/description/?envType=daily-question&envId=2026-10-19
#daily #easy #nopattern
Easy, 1 min codding. Thanks, leetcode, I'll have free Monday😁.
No pattern though.
https://leetcode.com/problems/find-target-indices-after-sorting-array/description/?envType=daily-question&envId=2026-10-19
#daily #easy #nopattern
❤4
Daily 437th day streak
A bit bullshit problem, no real pattern is here, pretty unique problem.
I would not recommend
https://leetcode.com/problems/sum-of-sortable-integers/description/?envType=daily-question&envId=2026-10-20
#daily #hard #nopattern
A bit bullshit problem, no real pattern is here, pretty unique problem.
I would not recommend
https://leetcode.com/problems/sum-of-sortable-integers/description/?envType=daily-question&envId=2026-10-20
#daily #hard #nopattern
❤4