Beginner, learning Java to solve LeetCode 2150. Find All Lonely Numbers in the Array

[marsh locust]

Detected code, here are some useful tools:

Formatted code

class Solution {
  public List<Integer> findLonely(int [] nums) {
    var counter = Arrays.stream(nums).collect(HashMap<Integer, Integer> ::new , (map, number) -> {
      map.put(number, map.getOrDefault(number, 0) + 1);
    }
    , (intoMap, fromMap) -> fromMap.entrySet().forEach(mapEntry -> {
      var key = mapEntry.getKey();
      intoMap.put(key, intoMap.get(key) + mapEntry.getValue());
    }
    ));
    return counter.entrySet().stream().filter(mapEntry -> {
      if (mapEntry.getValue() != 1) {
        return false;
      }
      var key = mapEntry.getKey();
      return !(counter.containsKey(key - 1) || counter.containsKey(key + 1));
    }
    ).map(Map.Entry::getKey).toList();
  }
}

<@&987246399047479336> please have a look, thanks.

[marsh locust]

@fleet hatch

Your question has been closed due to inactivity.

If it was not resolved yet, feel free to just post a message below
to reopen it, or create a new thread.

Note that usually the reason for nobody calling back is that your
question may have been not well asked and hence no one felt confident
enough answering.

When you reopen the thread, try to use your time to improve the quality
of the question by elaborating, providing details, context, all relevant code
snippets, any errors you are getting, concrete examples and perhaps also some
screenshots. Share your attempt, explain the expected results and compare
them to the current results.

Also try to make the information easily accessible by sharing code
or assignment descriptions directly on Discord, not behind a link or
PDF-file; provide some guidance for long code snippets and ensure
the code is well formatted and has syntax highlighting. Kindly read through
https://stackoverflow.com/help/how-to-ask for more.

With enough info, someone knows the answer for sure 👍