Playlist CSES Problems set solution-
Playlist problem statement-
- Time limit: 1.00 s
- Memory limit: 512 MB
What is the longest sequence of successive songs where each song is unique?
Input
The first input line contains an integer : the number of songs.
The next line has integers : the id number of each song.
Output
Print the length of the longest sequence of unique songs.
Constraints
Input:
8
1 2 1 3 2 7 4 2
Output:5
Playlist CSES Problems set solution-
Step -1 store value in hashmap so that we can check that song played before or not.
step -2 make two-pointer i and j if v[i] has occurred earlier remove all element till v[i] and update ans.new length will be (i-j).
Step 3- if v[i] not occurred simply update ans by one.
Comments
Post a Comment