Currently register looks like:

   private static <T> void register(Map<T, T> substitutions, T annotated, T original, T target) {
        if (annotated != null) {
            guarantee(!substitutions.containsKey(annotated) || substitutions.get(annotated) == original || substitutions.get(annotated) == target, "Already registered: %s", annotated);
            substitutions.put(annotated,

🚀 Feature

An easy to implement an algorithm that calculates range sums. It supports O(1) queries and O(n) updates.

Have you read the Contribution Guidelines?

👍

Pitch

PSAs are a beginner-friendly algorithm that helps reinforce the understanding of arrays. I can implement this in C++ and Java (:

Assigned
@RohanK6 - Java
@itslinotlie - C++
@mavneeK - C
@aniket

Add a proper function and add the sorting code in the function.

User if __name__ == '__main__': and write a few lines of code with a simple example.