### introart's blog

By introart, history, 17 months ago,

Here is the editorial of the problem but I could not understand why 5N nodes are required.

• +1

By introart, history, 20 months ago,

Can someone please suggest some 20-30 1600-rated good DP problems? I was practising by filtering on problem sets, but most of them were based on the same repeated concepts. If you have any other resources please share.

• -10

By introart, history, 21 month(s) ago,

I am getting TLE in this CSES problem.

My Approach
Problem

Can anyone please tell me why it is showing TLE?

• 0

By introart, history, 21 month(s) ago,

This problem came in today's Leetcode Weekly contest 296.

The solution to this problem is pretty straightforward.
But my question is:
how can I solve the problem if the condition: operations[i][1] does not exist in nums is not necessarily true.

#### As an example

Input: nums = [1,2,3,4], operations = [[2,3],[3,1],[1,4]]
Output: [4,4,4,4]

• -10

By introart, history, 21 month(s) ago,

Question: You are given a set of points and you have to find out the maximum points which lie on the same line.

Now this question is available on both Uva and Leetcode. But the same test case gives different outputs in different OJs.

## Testcase:

Can anyone please look into this matter? That would be a great help.

• 0