IDNLearn.com is designed to help you find reliable answers to any question you have. Explore a wide array of topics and find reliable answers from our experienced community members.
Given an array of distinct positive integers. Which of the following can be used to find the longest consecutive sub-sequence of integers? (Note that the consecutive numbers need not be sorted.)
For example, if the given array is [1 , 7, 3, 2, 8], the longest consecutive subsequence is [1 , 3, 2] as 1 , 2,3 are consecutive integers.
Sagot :
Thank you for contributing to our discussion. Don't forget to check back for new answers. Keep asking, answering, and sharing useful information. Discover insightful answers at IDNLearn.com. We appreciate your visit and look forward to assisting you again.