|
|
|
|
|
by tubby12345
1710 days ago
|
|
Just because you do not do the kind of work that necessitates being familiar with that solution doesn't say anything about the universe of programming jobs. Realize two things 1) many Leetcode style solutions are to problems that were at one time practical engineering problems; cycle detection infact is still relevant in cryptography. 2) novel implementations are required all the time in companies that have bandwidth for greenfield projects (ie FAANG). For example, if you search through the source of pytorch (or tensorflow) you will find implementations of the solution to https://leetcode.com/problems/merge-intervals/description/ So everyone always lamenting how useless Leetcode is, is pretty much telling on themselves re the kind of work they do. Edit: though this isn't what you broach, people that think there's no meaningful difference between eg O(n^2) and O(nlogn) are also broadcasting to the world that they've never run code "at scale". These companies have power bills that are denominated in Bs not Ms and so improving perf by even 1% (on a critical hot path) can be worth millions to the company (and RSU refreshers to you). If you don't believe me then believe Andrei alexandrscu https://youtu.be/ea5DiCg8HOY?t=175 >So if you shave 1% you've made your salary for 10 years alone |
|