Do it for FUN | SUMFIのBlog

[LeetCode] Relocate Marbles 2023-07-09|PSLeetCode|Problem Solving-Hash Table

You are given a 0-indexed integer array nums representing the initial positions of some marbles. You are also given two 0-indexed integer arrays moveFrom and moveTo of equal length.

Throughout moveFrom.length steps, you will change the positions of the marbles. On the ith step, you will move all marbles at position moveFrom[i] to position moveTo[i].

After completing all the steps, return the sorted list of occupied positions.

Notes:

We call a position occupied if there is at least one marble in that position.

There may be multiple marbles in a single position.

[LeetCode] Longest Alternating Subarray 2023-07-09|PSLeetCode|Problem Solving-Two Pointer

2765. Longest Alternating Subarray

You are given a 0-indexed integer array nums. A subarray s of length m is called alternating if:

m is greater than 1.

s1 = s0 + 1.

The 0-indexed subarray s looks like [s0, s1, s0, s1,...,s(m-1) % 2]. In other words, s1 - s0 = 1, s2 - s1 = -1, s3 - s2 = 1, s4 - s3 = -1, and so on up to s[m - 1] - s[m - 2] = (-1)m.

Return the maximum length of all alternating subarrays present in nums or -1 if no such subarray exists**.

A subarray is a contiguous non-empty sequence of elements within an array.