Arrays in Java are indexed from 0 to length - 1, not 1 to length, therefore you should be assign your variable accordingly and use the correct comparison operator.

Your loop should look like this:

for (int counter = myArray.length - 1; counter >= 0; counter--) {

let arr = [1, 2, 3];

arr.slice().reverse().forEach(x => console.log(x))

will print:

3
2
1

arr will still be [1, 2, 3], the .slice() creates a shallow copy.

Something like this would work:

var fruits = ["apple","banana","cherry"];
var direction = 1;  // or -1

var i = direction > 0 ? 0 : fruits.length - 1,
    stop = direction > 0 ? fruits.length : -1;
for (; i != stop; i += direction)
    console.log(i, fruits[i]);

var fruits = ["apple", "banana", "cherry"];

function iterate(direction) {
  var results = $("#results").empty();
  var i = direction > 0 ? 0 : fruits.length - 1,
    stop = direction > 0 ? fruits.length : -1;
  for (; i != stop; i += direction)
    $("<span>").text(i + ": " + fruits[i] + "\n").appendTo(results);
}

<script src="https://ajax.googleapis.com/ajax/libs/jquery/2.0.0/jquery.min.js"></script>
<button onclick="iterate(1)">Forward</button>
<button onclick="iterate(-1)">Backward</button>
<pre id="results" />

Because your forwards-condition has to receive the length property of your array each time, whilst the other condition only has to check for "greater then zero", a very fast task.

When your array length doesn't change during the loop, and you really look at ns-perfomance, you can use

for (var i=0, l=arr.length; i<l; i++)

BTW: Instead of for (var i = arr.length; i > 0; --i) you might use for (var i = arr.length; i-- > 0; ) which really runs through your array from n-1 to 0, not from n to 1.

noUncheckedIndexedAccess is primarily useful for objects, and for arrays if the index you're looking up might be more than the length of the array.

If you can be absolutely certain that the value exists at the index specified - such as with dead-simple code like this (assuming you don't mutate the array inside the function) - then simply assert that the value exists before passing it around:

Copyfor (let i = arr.length - 1; i >= 0; --i) {
  doSomething(arr[i]!);
}

Another option would be to reverse the array, then iterate over it, which is a bit more computationally expensive, but easier to make sense of at a glance.

Copyarr.reverse().forEach(doSomething);

Copy// no mutation:
[...arr].reverse().forEach(doSomething);

Copy// no mutation:
for (const item of [...arr].reverse()) {
    doSomething(item);
}

Those last three are what I'd prefer over a for loop when feasible.