Question

We have n parking spaces, where the car can park within 1 parking space, but the truck needs to park within 2 parking space. Implement the solution(n) function that will return a set of string that corresponds to a full parking lot configuration for n spaces.

Example: solution(6), where 6 is the number of space we have, -> one possible solution from the set could be CTTC (1 + 2 + 2 + 1 = 6).

Answer 1

//C++ program

#include <iostream>
#define ARR_SIZE 100
using namespace std;

void solution(int n, int i)
{ static char arr[ARR_SIZE];
if (n == 0)
{
for(int k=0;k<i;k++)cout<<arr[k];
cout<<"\n";
}
else if(n > 0)
{   
for (int k = 1; k <= 2; k++)
{
if(k==1)arr[i]= 'C';
if(k==2)arr[i]= 'T';
solution(n-k, i+1);
}
}
}
int main()
{
int n = 6;
cout<<"parking lot configuration for "<<n <<" spaces \n";
solution(n, 0);
return 0;
}

//sample output