accumulator | Cryptographic accumulators in Rust | Cryptography library

I need to create a slider for a game that you can set skills to each player,

The rules are :

1. Each skill starts at 0.
2. The skills cannot total more than 100 points at any time.
3. It should always be possible to assign any 0-100 value to a given skill. Given rule (2), if this gets us over 100 total points, the excess automatically, immediately, removed from the other skills, according to their current values.
4. It's not required to use all 100 points (or any).
5. A skill's value is always an integer.

For example :

• We start with:
  Stamina: 0 | Speed: 0 | Armor: 0 | Strength: 0 | Remaining: 100

• The player adds 50 Speed.
  Stamina: 0 | Speed: 50 | Armor: 0 | Strength: 0 | Remaining: 50

• The player adds 25 Armor.
  Stamina: 0 | Speed: 50 | Armor: 25 | Strength: 0 | Remaining: 25 - 115

• The player now adds 40 Stamina. The excess is automatically reduced from the other skills, weighted by their current values.
  Stamina: 40 | Speed: 40 | Armor: 20 | Strength: 0 | Remaining: 0

• The player then reduces Speed to 10.
  Stamina: 40 | Speed: 30 | Armor: 20 | Strength: 0 | Remaining: 10

• Finally, the player sets Strength to 100.
  Stamina: 0 | Speed: 0 | Armor: 0 | Strength: 100 | Remaining: 0

To do so i've created a function the receives 3 arguments :

1. An array of values of the slider

let arrToCalc = [14,24,55,0]

1. The index number of the skill (0 for Stamina, 1 for Speed ...etc)

let newValueIndex = 2

1. New value for base the calculation on

let newVal = 64.

Im not sure my calculations are accurate so i'm getting partial good results.

when set to

Scenario : From the following XML, Concatenate the marks and subject of a student with a "-" and put it as output in JSON.

Input:

In this task, we creating a function called highsum. It looks at a list of strings and sums up all the numerical characters. We then return the location of the element of the list with the highest value.

For example given list highestSum([“jx72i9r”, “9ch37@r2”, “8rgku3op8”]). We then must find [17, 21,19] which is all the numerical values added up. Because 21 is the highest value we need the function to return 1 because that is the location of 9ch37@r2 in the list.

This is what I have so far:-

I'm coming to kotlin after working in mostly dynamically typed languages for years, so I get a lot of what I'm seeing, but I'm still tripping up a bit over reading some of the type annotations.

Most of them make sense (I've written some C++ and typescript so I'm not wholey familiar with more strictly type languages). so stuff like annotating the parameters and return types for functions, variable declaration, stuff like that makes sense.

What I'm having trouble with is the more complex annotations like looking at this explanation of the fold method when talking about higher order functions:

I was trying to calculate the average of a ternary tree. It seems not possible to finish it inside one function. Is there any way to solve this question, or it's necessary to use two functions? Thanks.

I have some documents like this:

I am looking to use accumulators in my xslt3 below and process only unmatched keys and ignore others.

I want loop through each All_Time_Offs/Time_Off and if Time_Off_Key is present in the Payroll_Input/Input_Key -> Then do not process. Else process the record

I am new to Haskell and am trying to implement a function with an accumulator, but don't how to correctly use it.

Here is a function using a list of numbers, and return a triple (Int, Int, Int) with length, the sum, and the sum of square of a list by using the built-in function:

I have the following aggregation code which returns all the students for each school in my school ID list. For each student there is an academic year ID that looks like this: ObjectId("5ede4682341e8426f1cf6285")