but I mean.... quality of this service is not that great.
Cloudflare blocked with this html page for the root domain.
Pretty weak explanations I would say. Stuff is either very simple and don't need expl but they do provide it, or very hard, and it is badly explained.
Especially analyzing recurrences. These guys didn't even mention anything about derivation and equations, and wops, here you are some random numbers out of nowhere proving something
Cloudflare blocked with this html page for the root domain.
Pretty weak explanations I would say. Stuff is either very simple and don't need expl but they do provide it, or very hard, and it is badly explained.
Especially analyzing recurrences. These guys didn't even mention anything about derivation and equations, and wops, here you are some random numbers out of nowhere proving something
π2
At least for engineering - it is easily justifiable: be able to write code, be able to design stuff, have relevant exp
Today we are talking about important stuff about the graphs. Union Find, dfs, bfs.
On top of that I wanted to review the MIT lecture about BST node deletion and compare with our solution, as I think MIT lecture was a bit not complete.
As the last thing - we are reviewing solutions for URL shortener on Youtube and compare with ours, and why they better or worse.
If we have time left - we will finish URL shortener impl + load tests
On top of that I wanted to review the MIT lecture about BST node deletion and compare with our solution, as I think MIT lecture was a bit not complete.
As the last thing - we are reviewing solutions for URL shortener on Youtube and compare with ours, and why they better or worse.
If we have time left - we will finish URL shortener impl + load tests
π₯2π1
Here we go again, I'm oncall this and next week. Let's see how it goes. But probably I would expect some night posts π
π₯3
OMG, soon we will have review for new leadership (There was reorg)
It is so funny. I was working for onboarding all Skype users to our Presence Service, so all complaints in reddit about "status changed to away WTF" - was done by meπ
Since skype is dead, there was another feature on our project that was about unifying presence in skype with teams (the alternative you have after skype deprecation)
The funny moment, that we are presenting our half year work, and there is my slide:
GREAT SUCCESS, SKYPE IS ONBOARDED
And then next slide for my colleague
GREAT SUCCESS USERS ARE UNIFIED, SKYPE IS DEPRECTED AND OFFBOARDED
It is so funny. I was working for onboarding all Skype users to our Presence Service, so all complaints in reddit about "status changed to away WTF" - was done by meπ
Since skype is dead, there was another feature on our project that was about unifying presence in skype with teams (the alternative you have after skype deprecation)
The funny moment, that we are presenting our half year work, and there is my slide:
GREAT SUCCESS, SKYPE IS ONBOARDED
And then next slide for my colleague
GREAT SUCCESS USERS ARE UNIFIED, SKYPE IS DEPRECTED AND OFFBOARDED
bureaucracy is big shit in MS tbh.
There were already tons of features like: let's migrate X to Y to save Z money.
While you are migrating, there is already another feature to migrate Y to K to save T.
There were already tons of features like: let's migrate X to Y to save Z money.
While you are migrating, there is already another feature to migrate Y to K to save T.
π3
btw, the task:
https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/description/?envType=study-plan-v2&envId=top-interview-150
and honestly, fuck it, very annoying shit
https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/description/?envType=study-plan-v2&envId=top-interview-150
and honestly, fuck it, very annoying shit
LeetCode
Construct Binary Tree from Preorder and Inorder Traversal - LeetCode
Can you solve this real interview question? Construct Binary Tree from Preorder and Inorder Traversal - Given two integer arrays preorder and inorder where preorder is the preorder traversal of a binary tree and inorder is the inorder traversal of the sameβ¦
β€1
https://leetcode.com/problems/binary-tree-postorder-traversal/description/
I mean, yeah, sometimes recursion -> iteration transition is SO hard
I mean, yeah, sometimes recursion -> iteration transition is SO hard
π5
Solution itself is not that hard. But I have no idea how to come up with it, it does not recall me anything.
Top down -> bottom up conversion is 100050000% easier than this shit.
Top down -> bottom up conversion is 100050000% easier than this shit.
π2