I am submitting my problem, please merge it after reviewing

Author: AmarGwari

ToyObsession/problem.c

@@ -0,0 +1,7 @@
+We are to input a string of characters(say, s1= XxxyXxxXXxY) and a character(say, X) that belongs to that string
+( The string represents the collection of toys and the character represents the most beautiful toy)
+ we are to input a number that denotes the no. of beautiful toys needed ( smaller than equal to the maximum beautiful toys, say 2 )
+	now we are to print the smallet length (as in no. of characters) of the substring
+eg here 2 X containing substrigs are... XxxyX  XxxX XX 
+       					 5	4    2
+					 max         min therefor 2 printed. \(>o<)/

ToyObsession/solution.c

@@ -0,0 +1,40 @@
+#include<stdio.h>
+#include<string.h>
+int main() 
+{
+	long long int T,m;
+	scanf("%lld",&T);
+	for(m=0;m<T;m++)
+
+	{	char s1[100001],s2[100001],a;
+		long long int i=1,k,b,j=0,c,l,u,N,z=999999,arr[100001],brr[100001];
+		scanf("%s%s%lld",s1,s2,&N);
+		k = strlen(s1);
+		a = s2[0];
+		for(i=0;i<k;i++)
+		{if(s1[i]==a)
+			{
+				arr[j]=i;
+				j++;
+			}
+		}
+		i=0;
+		j--;
+		while(j-(N-1)>=0)
+		{ 
+			brr[i] = arr[j]-arr[j-(N-1)]+1;
+			i++;
+			j--;
+		}	
+
+		for(l=0;l<i;l++)
+		{
+			if(brr[l]<z)	
+			z = brr[l];
+		}
+		printf("%lld\n",z);
+	} 
+	return 0;
+}
+
+