Blog

Oggi vediamo il seguente esercizio di LeetCode:

You are given an array of integers nums, and there is a sliding window of size k which is moving from the very left of the array to the very right. You …

Oggi vediamo il seguente esercizio di LeetCode:

Given an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct.

Possiamo …

Oggi vediamo il seguente esercizio di LeetCode:

Given an array nums of size n, return the majority element. The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume …