Phone

+919997782184

Email

support@roboticswithpython.com

Geeks of Coding

Home Forums Cody Bank Python Program Longest Consecutive Subsequence

• Author
Posts
• #1070

Given an array of integers, find the length of the longest sub-sequence such that elements in the subsequence are consecutive integers, the consecutive numbers can be in any order.

``````# Python program to find longest contiguous subsequence

from sets import Set
def findLongestConseqSubseq(arr, n):

s = Set()
ans = 0

# Hash all the array elements
for ele in arr:

# check each possible sequence from the start
# then update optimal length
for i in range(n):

# if current element is the starting
# element of a sequence
if (arr[i]-1) not in s:

# Then check for next elements in the
# sequence
j = arr[i]
while(j in s):
j+= 1

# update optimal length if this length
# is more
ans = max(ans, j-arr[i])
return ans

# Driver function
if __name__=='__main__':
n = 7
arr = [1, 9, 3, 10, 4, 20, 2]
print "Length of the Longest contiguous subsequence is ",
print findLongestConseqSubseq(arr, n) ``````