Given an array of non-negative integers.Find the length of the longest subsequence such that elements in the subsequence are contiguous integers. The consecutive numbers can be in any order. Example n=7 nums={2,6,1,9,4,5,3} output = 6
AnswerBot
1mo
Find the length of the longest subsequence of contiguous integers in an array.
Sort the array
Iterate through the array and check for consecutive integers
Keep track of the longest subsequence found
Help your peers!
Add answer anonymously...
Top Bounteous x Accolite Java Developer interview questions & answers
Popular interview questions of Java Developer
Top HR questions asked in Bounteous x Accolite Java Developer
>
Bounteous x Accolite Java Developer Interview Questions
Stay ahead in your career. Get AmbitionBox app
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+
Reviews
4 L+
Interviews
4 Cr+
Salaries
1 Cr+
Users/Month
Contribute to help millions
Get AmbitionBox app
Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.
Follow us
