• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Find and print longest consecutive number sequence in a given sequence in O(n)

August 6, 2014 by Dhaval Dave

Ex: Input: 1 2 5 3 6 8 7
    Output: 5 6 7 8

As given in Above example we need to find Longest Consecutive sequence in O(n)
I have implemented in O(n) considering by creating hash  of data type bool.

Logic :
1) Create a function
2) Pass initial values one by one to this function and length.
3) What function does ?
Answer : it checks the longest possible consecutive sequence in array
How : pass 1, function will check whether 2 is there is array,
if present increase count and pass 2 to same function.
else return length.
4) get maximum such length and last passed index for which maximum such length is there.
5) Print from max index till the length.

example :
function will return Index, Count as
1-3
2-2
5-4 //max
3-1
6-3
8-1
7-2

PS : To optimize search in hash for sequential search, we can use dynamic programming which may cause extra space. hence here we have not used it. else People are welcome to share Solution with DP

Thanks to Dhaval for suggesting this approach and Article

Code

#include <stdio.h>
#include <stdbool.h>
#define gc getchar_unlocked
#define pc putchar_unlocked
inline int scan(){register int n=0,c=gc();while(c<‘0’||c>’9′)c=gc();while(c<=’9’&&c>=’0’)n=(n<<1)+(n<<3)+c-‘0’,c=gc();return n;}
bool c[100001]={0};

int findLongestsequence(int a, int count){
    int st=a,i,j;
    a++;
    if(c[a]==1){return(findLongestsequence(a,++count));}
    return count;
}//findLongestsequence

int main(void){
    int i=0,j,t,n,st,len,count=1,maxcount=1,maxseq=-1;
    len=scan();
    j=len;
    int a[len];

    while(j–){
    a[i]=scan();
    c[a[i]]=1; //creating hash with value pair same
    i++;
    }
    printf(“Entered String :”);
    for(i=0;i<len;i++){printf(“%d “,a[i]);}
    for(i=0;i<len;i++){
        
    count = findLongestsequence(a[i],count);
    if(count > maxcount ){
    maxcount= count;
    maxseq = a[i] ;
    }
    count=1;
    
    }
    //printf(“nSt and Len : %d & %dn”,maxseq,maxcount);
    printf(“nMaximum Consequitve string “);
    while(maxcount–) printf(“%d “,maxseq++);
    return 0;
    
}

You can find working code at : http://ideone.com/8xODTn

Similar Articles

Filed Under: Amazon Interview Question, Interview Questions, Microsoft Interview Questions, problem Tagged With: Array

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Common Ancestor in a Binary Tree or Binary Search Tree

Circular Linked List

The Magic HackerEarth Nirvana solutions Hiring Challenge

flattens 2 D linked list to a single sorted link list

Find min element in Sorted Rotated Array (With Duplicates)

Python List

System Design: Designing a LLD for Hotel Booking

Best Java Book | Top Java Programming Book for Beginners

Implement a generic binary search algorithm for Integer Double String etc

Word Break Problem

Daughter’s Age VeryGood Puzzle

Urban Ladder Written Test.

DFS (Depth First Search)

CodeChef’ RRCOPY

Reversal of LinkedList

Top 10 Interviews Techniqes for Campus Interview in IIT NIT BITS for MTech

Rectangular chocolate bar Create at least one piece which consists of exactly nTiles tiles

Find two non repeating elements in an array of repeating elements

Find loop in Singly linked list

SAP Hiring Off-Campus General Aptitude

FizzBuzz Solution C C++

BlueStone E-commerce Interview Experience

Sequence Finder Dynamic Programming

Printing intermediate Integers between one element & next element of array

How Radix sort works

Password Predictor

Binary Tree in Java

Printing Longest Common Subsequence

TicTacToe Game As Asked in Flipkart

simple sql injection

Copyright © 2025 · Genesis Framework · WordPress · Log in