Question

Find the Nearest Repeated Entries in an Array

People do not like reading text in which a word is used multiple times in a short paragraph. You are to write a program which helps identify such a problem.

Write a program that takes as input an array and finds the distance between closest pairs of equal entries. For example if s = <"All, "work", "and", "no", "play", "makes", "for", "no", "work", "and", "no", "fun", "and", "no", "results">, then the second and third occurrences of "no" is the closest pair.

Answer 1

#include <iostream>
#include<cstring>
using namespace std;

int main()
{
int n;
cout<<"Enter the number of words: ";
cin>>n;
char input[n][10];
int visited[n]={0};
for(int i=0;i<n;i++)
{
cin>>input[i];
}
for(int i=0;i<n;i++)
{
int distance=1000,left,right,prev,flag;
left=i;
prev=i;
if(visited[i]==0)
{
flag=0;
for(int j=i+1;j<n;j++)
{
if(strcmp(input[j],input[i])==0)
{
if(j-prev<distance)
{
left=prev;
right=j;
distance=j-prev;
}
prev=j;
visited[j]=1;
flag=1;
}
}
if(flag==1)
cout<<"The distance between closest pairs of "<<input[i]<<" is "<<distance<<" and pair is ("<<left<<" , "<<right<<")"<<endl;
}
}
return 0;
}