That was a crystal clear explanation, thanks bhaiya 😊

@competitivecoding-newtonsc9601

Жыл бұрын

Thanks Parth

great explanation as always...thanks a lot for the solution

@competitivecoding-newtonsc9601

Жыл бұрын

Thanks Arijit as always.

I figured that we need 30 elements only but the relation B[i] = B[i-1]|A[i] not came in my mind Thanks a lot

@competitivecoding-newtonsc9601

Жыл бұрын

Thanks Raj :)

thanks. nice explanation as always.

@competitivecoding-newtonsc9601

Жыл бұрын

Thanks Subham

What a creative solution 👏🏼

@competitivecoding-newtonsc9601

Жыл бұрын

Thanks Yousef

tks for your solution

@competitivecoding-newtonsc9601

Жыл бұрын

Good explanation help me a lot

@competitivecoding-newtonsc9601

Жыл бұрын

Thanks Rasec

Nicely explained :)

@competitivecoding-newtonsc9601

Жыл бұрын

Thanks ;)

Great

@competitivecoding-newtonsc9601

Жыл бұрын

🍻

I would really like to know how do you reason about the problem, and how do you actually find the solution. Because as for me, it is easy to understand the solution, but it's hard to find it. From your video I pointed out these steps: - describe what's given - describe what's necessary to achieve - describe naive solution - observe the naive solution and find data patterns - think up optimization - describe the final solution - write it down. But how do you solve the issues when you first see them? Could you give some advice?

@competitivecoding-newtonsc9601

Жыл бұрын

Reading and analysing a problem gives an idea in which direction you need to think. Like if you have GCD and such think in terms of Prime Factors, and if you bitwise operations think in terms of Binary. Next step is to carefully observe the samples and try to dry run some test cases to get some kind of observation. This comes with practice and is the most important part. Rest is just implementation which is not that hard.

Why cant we directly sort in reverse order and print it ?Is there any case where this fails ?

@competitivecoding-newtonsc9601

Жыл бұрын

say in binary form numbers are 11010, 1001, 100. Then optimal answer is 11010 -> 100 -> 1001 and you can clearly see, its not reverse sorted.

@Surya045_

Жыл бұрын

@@competitivecoding-newtonsc9601 thx got it

can you do F problem

@competitivecoding-newtonsc9601

Жыл бұрын

will try to

Why are taking min(n, 30) ?

@competitivecoding-newtonsc9601

Жыл бұрын

How can you choose 30 elements if your n = 20?

what would the expected rating be for this?

@kasiruyamagata7716

Жыл бұрын

1700

@competitivecoding-newtonsc9601

Жыл бұрын

nah more like 1500

@rikchik7709

Жыл бұрын

@@competitivecoding-newtonsc9601 yeah 1700 is way too high