Can anyone solve this problem in 1 hour without seeing it before?


  • 0
    R

    Can anyone solve this problem in 1 hour without seeing it before?
    Can anyone solve this problem in 1 hour without seeing it before?
    Can anyone solve this problem in 1 hour without seeing it before?


  • 0
    B

    If you are asking just about solving it, sure anyone can. Solving the problem in fact is easy. All you have to do is remove one element at a time and try out all the possible ways to do so and pick max. Think of this recursively. However, optimizing it is a different story. I am relatively new to competitive programming. I have been practicing for a while. I can come up with solution pretty fast; most of the time brute force. Optimal solution might require a lot of practice though.


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.