← Back to context Comment by jojomodding 7 hours ago LeetCode problems typically are in P. The challenge is finding out why. 1 comment jojomodding Reply mcmoor 2 hours ago Yeah I think the trivial solution is always harder complexity and the main challenge is to lower it. Either from NP to P or from n*2 to n log n.
mcmoor 2 hours ago Yeah I think the trivial solution is always harder complexity and the main challenge is to lower it. Either from NP to P or from n*2 to n log n.
Yeah I think the trivial solution is always harder complexity and the main challenge is to lower it. Either from NP to P or from n*2 to n log n.