leetcode-solutions VS cp-algorithms

This is a 2D prefix sum problem (Check the problems tagged Prefix>Sum>2D in my repository).

For more problems like this, check the Permutation> Cycle section here: https://github.com/razimantv/leetcode-solutions

All my leetcode solutions are here along with tags. Find today's solutions in the latest commit.

You can't just use (index-displaced) because many positions in between might have already been removed. You need some data structure that can answer questions like "how many numbers in this range have not been removed?" and make updates like "remove this number" efficiently. I did this using a segment tree: https://github.com/razimantv/leetcode-solutions/tree/main/Solutions/M/make-array-empty

No. I used to answer a lot of programming and math questions on Quora (https://www.quora.com/profile/Raziman-T-V). I also have a GitHub repository of my LeetCode solutions (https://github.com/razimantv/leetcode-solutions)

Here is my solution: https://github.com/razimantv/leetcode-solutions/tree/main/Solutions/D/difference-between-maximum-and-minimum-price-sum

If you are interested, all my solutions (mostly C++) are here, along with tags for the algorithms/tricks I used to solve them.

Very similar to maximum profit in job scheduling. Can be done with sorting+dp with binary search: https://github.com/razimantv/leetcode-solutions/tree/main/Solutions/M/maximum-profit-in-job-scheduling

One way to solve this would be to keep a hash map of prefix sums modulo k: https://github.com/razimantv/leetcode-solutions/tree/main/Solutions/C/continuous-subarray-sum

Here is my c++ implementation of a similar problem, try to take a look.

I've been learning alot from this git repository: https://cp-algorithms.com/ . Do you know of any of any sources or repositories like this that help with Leetcode or problem solving?

I am aiming to create an open-source knowledge repository inspired by cp-algorithms.com . Now, I am planning this to be a long term project. This project MIGHT have different repositories, depending on how I structure the content. I am really confused between two alternatives:

For interviews, if you can do competitive programming well that would def make you super competitive so check out codeforces and assorted sites and compete. There’s also a competitive programming handbook on the internet and this: https://cp-algorithms.com to help

I did some CP and yes it opens up some new style of approaching problems with new ideas but its definitely not necessary. I would recommend the famous CSES problem set and start with codeforces . Try to give virtual div3 for starters and then jump to div2 if you feel comfortable. There is this site https://cp-algorithms.com/ which will be your best friend. Also take a look at this https://codeforces.com/blog/entry/57282 it has all the good articles on on algo/tricks/tips written by CF folks.

I can also recommend, https://cp-algorithms.com/ and the competitive programmer handbook, regardless of your intentions these resources contain mental models and algorithms that have taken computer science many years tp develop.

The best website about data structures and algorithms for CP is IMHO cp-algorithms.com. It might be overwhelming for beginners because it contains formal proofs but I found it invaluable. Be very careful with websites like geeks4geeks. I've seen many articles with bad explanations or even plain wrong information and/or implementations.

There are a few sites I visit often such as hackerank tuitorials, geek for geek and CP-Algorithm but mostly I just learn from the top solutions in LC discussion threads.

(From https://cp-algorithms.com/graph/strongly-connected-components.html; licensed under https://github.com/e-maxx-eng/e-maxx-eng/blob/master/LICENSE)