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 …

Oggi vediamo il seguente esercizio di LeetCode:

Given head, the head of a linked list, determine if the linked list has a cycle in it. There is a cycle in a linked list if there is some node in the …

Oggi vediamo il seguente esercizio di LeetCode:

A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the …

Oggi vediamo il seguente esercizio di LeetCode:

You are given an array prices where prices[i] is the price of a given stock on the i-th day. You want to maximize your profit by choosing a single day …

Oggi vediamo il seguente esercizio di LeetCode:

You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in …

Oggi vediamo il seguente esercizio di LeetCode:

Given the head of a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should …

Oggi vediamo il seguente esercizio di LeetCode:

You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb …