12mo ago

O of what now

19 comments

O(n)? More Like Oh(No)
O(n!). I like it.
- O((2⁽ⁿ2))!) or bust.
  
  O(BB(n))
  "That matches no single computable function" is just an excuse.
There's O(1), O(n), O(nlgn), O( this code is crap ).
- [Cries in matrix multiplication]
  
  Matrix multiplication is O(n) if you do it in parallel /j
Just add a delay that pads it out the execute time to 10 seconds. O(1) ez.
That's still good! I'm proud of you for working though the parts of the problem that you were capable of
Great, now I’m hungry for apples.
Why would you want a specific time complexity? Wouldn't it be better if it's faster? /s
- Likely they want a lower time complexity.
  for example a question can be trivially solved in O(n^2). but there is no know < O(n) solution, so they ask for O(n)
  
  That's a huge leap from O(n²) to O(n), in this example it would likely good to at least specify that it should be strictly less than best known solution (not sure if there are such cases on leet code, I thought they only restrict you to what is known to be solvable)
  
  Most of the time O(n^2) is optimized to O(n log n). You'll get some sort of award if you can figure out a sorting function that runs in O(n).

19 comments