JuneEnd

The key to solve this problem is the following two conditions: - Battleships can only be placed horizontally or vertically. In other words...

In first place, the solution can be done by recursion and is very straightforward. The tricky part is in line 9 because when gap is less tha...

I don't have clue in the first place, so I followed the top rated solution. The idea is the minimized maximum sum among the subarrays m...

Well, very straightforward solution. 1: /** 2: * Definition for a binary tree node. 3: * struct TreeNode { 4: * int val; ...

I was thinking the K digits must be consecutive but it turns out it's not necessary. So the problem becomes easier. All I need to do is ...

We should start from the boundary of the matrix to see if they can reach the other ocean. So it is a typical DSF problem. For DSF problem, w...

I don't have any clue to solve the problem. I have to follow the top rated solution. The idea behind is (1) Use minimum heap to store t...