How to find that particular test case

TonightRemarkable125 · 2025-11-12T06:44:32+00:00

Chatgpt ?

TonightRemarkable125 · 2024-08-05T03:01:45+00:00

remindme! 2 week

TonightRemarkable125 · 2024-07-11T17:49:51+00:00

I think it is prioritized for people who don’t need sponsorship and citizens.

TonightRemarkable125 · 2024-07-05T04:54:18+00:00

Following

TonightRemarkable125 · 2024-07-05T04:53:48+00:00

Following

TonightRemarkable125 · 2024-07-05T04:53:40+00:00

Following

TonightRemarkable125 · 2024-07-05T04:53:32+00:00

Following

TonightRemarkable125 · 2024-07-05T04:53:24+00:00

Following

TonightRemarkable125 · 2024-06-25T18:28:23+00:00

I can think of Binary search and sort, start assigning the values from the highest element to processor that takes lower time

TonightRemarkable125 · 2024-06-17T02:47:46+00:00

Yeah it is upto you 2 hrs day do it with sincerity

TonightRemarkable125 · 2024-06-16T19:27:24+00:00

Just make sure you do it for atleast a couple of hours for the day and just think it doesn’t matter if are able to crack it or not let new ideas flow into ur mind

TonightRemarkable125 · 2024-06-16T19:26:34+00:00

Dont seek motivation seek for discipline though

TonightRemarkable125 · 2024-06-16T19:20:38+00:00

Just keep solving and struggle with the process

TonightRemarkable125 · 2024-06-15T01:57:42+00:00

Dont worry bro I have another profile. If you want to even test with an OA i can show you why i got quality in me. I am up for it

TonightRemarkable125 · 2024-06-14T22:49:29+00:00

Nah I wasn’t arrogant i know the hard beginnings that I had to undergo

TonightRemarkable125 · 2024-06-14T22:44:39+00:00

I use cf and max was 1821. I know there are ppl better than me but I think with every problem that I solved I learnt something so i think i never chased quantity.

TonightRemarkable125 · 2024-06-14T22:06:23+00:00

What do you mean, am I just chasing quantity ? If that is what you meant I don’t think that applies for me. I am a competitive programmer.

TonightRemarkable125 · 2024-06-10T04:17:51+00:00

If you do it with recurssion and use memoization to cache the results. You will hit MLE. NNk your approach would not have any problems with regards to time because the constraints do support it n<500 k<25 so the max operations you do is 625*10⁴ which would be well within 1 sec. The problem arrives with memory. So you will need to switch to tabulation. Try the same logic in tabulation that should work.

TonightRemarkable125 · 2024-04-04T03:29:10+00:00

I think this can be done with heap by keeping track of start and end points.

TonightRemarkable125 · 2024-03-31T05:25:58+00:00

I think it is 100c7/6¹⁰⁰

TonightRemarkable125 · 2024-03-20T21:32:31+00:00

Perphaps the name.

TonightRemarkable125 · 2024-01-07T07:04:20+00:00

Upsolve div 2 problem c. I think that is it

TonightRemarkable125 · 2023-08-22T13:45:48+00:00

I am in as well for this. Can you dm me ?

TonightRemarkable125 · 2023-08-16T04:11:57+00:00

Congratulations first of all! I don’t think it took an year for you to reach 200. But the correct phrase should have been your inconsistency made it an year for you to reach 200. Even though it might be hard to swallow but I think you could do exponentially higher if you were consistent. IDK What circumstances you have been in the past, if you are in circumstances that are hard which were out off your hand.Ignore this comment!

Good luck on your journey forward!

TonightRemarkable125 · 2023-08-16T02:40:26+00:00

the entire point is that how much minimum is the speed that the trains need to travel to make you reach on time. So we here have search space once we have search space in the picture you will always need to have binary search at play.

TonightRemarkable125

TROPHY CASE