Hello everyone,

Just wanted to ask you guys that is there anyone who has purchased leetcode's premium subscription? If yes, is it worth it?

I am preparing for placements and it will be great if I can get a feedback regarding this from someone.

Hi guys, Can anyone please help me a bit in understanding this problem?

https://www.geeksforgeeks.org/number-subsequences-form-ai-bj-ck/

I m having difficulty in understanding mainly this part.

Hello everybody, I was solving a problem and for that, I needed a sorted map in java which stores an integer at the place of the key and a "Sorted Set" in place of value. Also, is the procedure same when we replace this sorted set with some user made class?

Can anyone tell me how to implement one such Sorted Map?

Also, what to do we have to do when we are implementing one such map where key is a sorted set? Is it really possible to implement one such thing in either C++ or Java?

Any tutorial/guidance/links will suffice.

I encountered this problem

and after sufficient trial and disturbing my college seniors, I failed to understand the editorial of this problem. No wonder why I am the biggest quitter in this world. Can anyone please help me in understanding the same?

Editorial of the problem -

Can anybody give me a hint or some source from which I can understand the logic behind longest "NON-DECREASING" subsequence?

That will be very helpful for a noob like me.

PS — I have already checked out this link — https://www.geeksforgeeks.org/longest-increasing-subsequence/

I am trying to learn some new things, especially dp.

What is this which people use in their problems?

Please tell me the meaning of this as I have seen this in so many problems.

Hello,

As described in this blog (http://codeforces.com/blog/entry/58155), we have an educational round tomorrow but still the "pay attention" block is showing VK cup only.

Plase fix it so that we can register.

Thanks.

Hello all, I was solving this problem on spoj (http://www.spoj.com/problems/CODESPTB/) and I am getting wrong answer. My approach is simple and it says that you should take the whole array as input and sort it first. After that just add the difference in input position and position after sorting. print half of this answer as we must have counted the number of swaps twice. What is the problem with this approach?

Also, if this is not the right approach, how to go about solving this problem?

Thanks in advance.

Here is my code — https://paste.ubuntu.com/p/Ms6DTZFDbv/

.

.

.