[LeetCode] Find the Distinct Difference Array

2670. Find the Distinct Difference Array

You are given a 0-indexed array nums of length n.

The distinct difference array of nums is an array diff of length n such that diff[i] is equal to the number of distinct elements in the suffix nums[i + 1, ..., n - 1] subtracted from the number of distinct elements in the prefix nums[0, ..., i].

Return the distinct difference array of nums.

Note that nums[i, ..., j] denotes the subarray of nums starting at index i and ending at index j inclusive. Particularly, if i > j then nums[i, ..., j] denotes an empty subarray.

Read more
[Hacker Rank] Xor and SumRead more
[Hacker Rank] Cut TreeRead more
[CS Academy] Open the BottlesRead more
[CS Academy] Odd SumRead more
[CS Academy] Palindrome CentersRead more
[CS Academy] Odd PalindromesRead more
[CS Academy] Closest NumbersRead more
[Hacker Rank] HackerRank CityRead more
[Hacker Rank] Prime Digit SumsRead more