Lab Task $03$a:

Consider the following Java program:

public class PSuffix$\{$

static void countSamePrefixSuffix$($String s$,$ int n$)$

$\{$

$//$ Stores the prefix string

String prefix $=""$;

for$($int i $=0$; i $<$ n $-1$; i$++)$

$\{$

$//$ Add the current character to the prefix string

prefix $+=$ s$.$charAt$($i$)$;

$//$ Store the suffix string

String suffix $=$ s$.$substring$($n $-1-$ i$,$ n$)$;

System.out.print$("$Proper prefix: $"+$ prefix $+",$ Proper suffix: $"+$ suffix$)$;

$//$ Check if both the strings are equal or not

if $($prefix$.$equals$($suffix$))$

$\{$

System.out.print$("*"+$ prefix.length$())$;

$\}$

System.out.println$()$;

$\}$

$\}$

public static void main$($String$[]$ args$)$

$\{$

String S $=$ "ABCAABC";

int N $=$ S$.$length$()$;

countSamePrefixSuffix$($S$,$ N$)$;

$\}$

$\}$