Proposal: Add New Exercise – "Find the Longest Consecutive Sequence"

[ChuqiaoHuang]

Description:
This exercise challenges users to implement a function that finds the longest consecutive sequence of numbers in an unsorted array. The sequence must consist of numbers that appear consecutively when sorted (but the array itself is not necessarily sorted).
The function should return the length of the longest consecutive sequence.

Why Add This?

• Reinforces array iteration and sorting techniques.
• Teaches how to use sets for efficient lookups.
• Encourages students to think about optimizing performance beyond brute-force solutions.

Test Cases:
longestConsecutive([100, 4, 200, 1, 3, 2]); // ➞ 4 (sequence: [1, 2, 3, 4])
longestConsecutive([9, 1, 4, 7, 3, 2, 5, 6, 0]); // ➞ 6 (sequence: [0, 1, 2, 3, 4, 5])
longestConsecutive([1, 2, 3, 4, 5]); // ➞ 5 (sequence: [1, 2, 3, 4, 5])
longestConsecutive([10, 5, 12, 3, 55, 30]); // ➞ 1 (no consecutive sequence)
longestConsecutive([]); // ➞ 0 (empty array)

If available, I would like to be assigned.