-->

10/28/20

Playlist CSES Problems set solution | searching ans sorting with code and explanation

 Playlist CSES Problems set solution-

Playlist problem statement-
  • Time limit: 1.00 s
  •  
  • Memory limit: 512 MB
You are given a playlist of a radio station since its establishment. The playlist has a total of n songs.

What is the longest sequence of successive songs where each song is unique?

Input

The first input line contains an integer n: the number of songs.

The next line has n integers k1,k2,,kn: the id number of each song.

Output

Print the length of the longest sequence of unique songs.

Constraints
  • 1n2105
  • 1ki109
Example

Input:
8
1 2 1 3 2 7 4 2


Output:5
CSES - CSES Problem Set - Tasks solution

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.

Here is code for this->



Advertiser

all right reserved @technicalkeeda.in. Powered by Blogger.