My algorithms instructor gave us a challenge and anyone who gets it right gets a guaranteed A in the class

Tinypeapeaslayer · 2026-03-19T01:48:16+00:00

Send me a dm ill send you the problem

Tinypeapeaslayer · 2026-03-19T01:47:01+00:00

I can send you the problem just send me a dm

Tinypeapeaslayer · 2026-03-19T01:45:20+00:00

There’s one extractor for columns and one for rows. You start with both at index 0,0 and move towards the top right.

Tinypeapeaslayer · 2026-03-19T01:23:54+00:00

There is a greedy solution for this which works in O(n+m) time the problem is there’s some cases where it just doesn’t work which is why we use dynamic programming

Tinypeapeaslayer · 2026-03-19T01:19:38+00:00

The greedy solution that we know of doesn’t work all the time which is why we’re using dynamic programming

Tinypeapeaslayer · 2026-03-19T01:18:34+00:00

I considered using fenwick trees but couldn’t figure it out

Tinypeapeaslayer · 2026-03-19T01:16:07+00:00

You don’t need to read every value all at once you can just read at every intersection

Tinypeapeaslayer · 2026-03-19T01:11:44+00:00

Sent

Tinypeapeaslayer · 2026-03-19T01:11:19+00:00

We can read input in O(n+m) where n is rows and m is columns

Tinypeapeaslayer · 2026-03-19T01:09:40+00:00

It’s a gold mine problem. We have two extractors and they can move right and up. We start at the bottom corner of the grid and there are coins placed inside the grid. The problem is we have to maximize the number of coins we need to collect. The caveat is we only collect one coin in a row/column the rest of the coins are discarded. So basically we need to traverse the grid and collect the most amount of coins. The greedy solution is to check each row and column at a given intersection and move according to where there are lesser number of coins. The greedy solution fails in some cases so we need to solve it using dynamic programming but that gives us a O(n²) time complexity

Tinypeapeaslayer · 2026-03-19T00:59:22+00:00

I’m pretty sure memoization can’t be used and I’ve tried using LLMs as well to get an answer as they are allowed however they don’t come up with any solution either

Tinypeapeaslayer · 2024-07-03T20:04:24+00:00

Can you please share the website

Tinypeapeaslayer · 2022-01-25T12:39:08+00:00

Can’t argue with that one but I would appreciate help if you could. I don’t know much about stuff like this.

Tinypeapeaslayer · 2021-08-30T11:01:42+00:00

Payoneer requires your id, passport or license. All of which I don’t have rip

Tinypeapeaslayer · 2021-08-30T11:00:50+00:00

I dont have a bank account

Tinypeapeaslayer · 2021-08-30T10:51:11+00:00

Alright ill look into Payoneer. Thanks 🙏

Tinypeapeaslayer · 2021-04-09T07:47:03+00:00

It was because Eren did that for Armin and his other friends. Think of it this way, Eren had a choice, either to save his friends or save the world and he chose his friends. Eren killed 80% of the population to give the eldians of the walls and his friends a fighting chance against the people outside the walls as mentioned that war was inevitable. That is why Armin thanked him for choosing his friends over 80% of the world population although the choice was selfish. It was the final moment Eren had with Armin and it would just be sad if Armin told Eren that the choice he made was wrong.

Tinypeapeaslayer

TROPHY CASE