Minimum Shelf
Problem Description
At a shop of marbles, packs of marbles are prepared. Packets are named A, B, C, D, E ……..
All packets are kept in a VERTICAL SHELF in random order. Any numbers of packets with these names could be kept in that shelf as in this example: bottom of shelf ---> [AAAJKRDFDEWAAYFYYKK]-----Top of shelf.

All these packets are to be loaded on cars.

The cars are lined in order, so that the packet could be loaded on them. The cars are also named [A, B, C, D, E,………….].

Each Car will load the packet with the same alphabet. So, for example, car ‘A’ will load all the packets with name ‘A’.

Each particular car will come at the loading point only once.

The cars will come at the loading point in alphabetical order. So, car ‘B’ will come and take all the packets with name ‘B’ from the shelf, then car ‘C’ will come.

No matter how deep in the shelf any packet ‘B’ is, all of the ‘B’ packets will be displaced before the ‘C’ car arrives.

For that purpose, some additional shelves are provided. The packets which are after the packet B, are kept in those shelves.

Any one of these shelves contains only packets, having the same name. For example, if any particular shelf is used and if a packet with name X is in it, then only the packets having names X will be kept in it. That shelf will look like [XXXXXXX].

If any shelf is used once, then it could be used again only if it is vacant.

Packets from the initial shelf could be unloaded from top only.

Write a program that finds the minimum total number of shelves, including the initial one required for this loading process.
Instruction to work with Open PBT Client: 1. Specify the work directory path in the 'Work directory Path' field. The path should correspond to your solution Work directory. 2. Download the support files by clicking the Get Support Files. 3. You will find the problem directories containing: * problem.h file * problem.c file in your project directory. 4. Code the solution in .c file inside the problem directory 5. All required files will be downloaded to your work directory. Creating additional files is strongly discouraged.
Step 1:
In your Solution File: * Implement your logic in function int shelfCount(char* packet) * char* packet : is the string as packets are kept in the shelf. * You can create more functions if required, but those functions should be in the same file.

Step 2:
Your solution needs to consider the following constraints. 1. In this problem you have to write a program, that finds the minimum total number of shelves, including the initial one, required for this loading process. 2. The packets are named A, B, C, D, E …….. 3. Any numbers of packets with these names could be kept in the shelf, as in this example: [ZZLLAAJKRDFDDUUGGYFYYKK]. 4. All packets are to be loaded on cars. The cars are lined in order, so that the packets could be loaded on them. The cars are also named [A, B, C, D, E,………….]. 5. Each Car will load the packets with the same alphabet. So, for example, car ‘A’ will load all the packets with name ‘A’. 6. Each particular car will come at loading point only once. For example, car A will come only once at the loading point. 7. The cars will come at the loading point in alphabetical order. So, car ‘B’ will come and take all the packets with name ‘B’ from the shelf, then car ‘C’ will come. 8. No matter how deep in the shelf any packet ‘B’ is, all of the packets ‘B’ will be displaced before the ‘C’ car arrives. 9. For that purpose, some additional shelves are provided. The packets that are after the packet B, are kept in those shelves. 10. Any one of these shelves contains only packets, having the same name. For example, if any particular shelf is used and if a packet with name S is in it, then only packets having names S will be kept in it. That shelf will look like [SSSSSSS]. 11. If any shelf is used once, then it could be used again only if it is vacant. 12. The names of the packets in the shelf should be upper case; otherwise return -1
The Prototype of the function is int shelfCount(char* packet)
This function takes following arguments. * packet is the string as packets are kept in the shelf. * This method returns an integer, which is the minimum number of shelves needed.
Constraints
1. Name of the packets in shelf should be in upper case else return -1.
Example 1
Input

bottom of shelf --->DDDDDD<-----Top of shelf
Output

1

Explanation:
One shelf will be needed because Car A, Car B and Car C will come and go only Car D will come and collect the packet with the initial shelf.
Example 2
Input

ZYXZYXZYXZYX
Output

3
Example 3
Input

ZYXZYmmmXZYXZYX
Output

-1
For C solutions Header File | : | minimumshelf.h | Function Name | : | int shelfCount(char* packet) | File Name | : | minimumshelf.c |
For C++ solutions Header File | : | minimumshelf.h | Class Name | : | Shelf | Function Name | : | int shelfCount(char* packet) | File Name | : | minimumshelf.c |
General Instructions * | The file / class names, functions, method signatures, header files are to be used as mentioned in the problem statement. Do not use your own names or change the method signatures and fields. You can add any number of additional methods. | * | For C solutions, change the value of "C_OR_CPP" macro in header file as 1 and for C++ solutions change the value as 2. | * | Incase of iostream.h specify as iostream only. | * | Command line options for the main() function are not supported currently. |
Decode the Code
Problem Description
Smugglers are becoming very smart day by day. Now they have developed a new technique of sending their messages from one smuggler to another.
In their new technology, they are sending their messages in a number format. This format represents the way that numbers and characters are padded on mobile’s keypad. One smuggler sends a text message to the second smuggler, using the numbers corresponding to the letters on the keypad. When the receiving smuggler gets the message, he simply opens the “create text message” function in his mobile and types the number string. This way the receiver finally reads the original message.
For Example: -
6999066263304447777077766622337778 -----> message sent by the first smuggler. my name is robert---------> message decoded by the second smuggler.
Where ‘0’ denotes the "space".

Explanation:
By pressing ‘6’ (i.e. key’6’ one time) on the keypad, the mobile shows ‘m’ on display screen in write text message area.
By pressing ‘999’ (i.e. key ‘9’ three times) on the keypad, the mobile shows ‘y’ on display screen in write text message area.
By pressing ‘0’ (i.e. key ’0’ one time) on the keypad, the mobile shows ‘space’ on display screen in write text message area.
By pressing ‘66’ (i.e. key’6’ two times) on the keypad, the mobile shows ‘n’ on display screen in write text message area.
By pressing ‘2’ (i.e. key ’2’ one time) on the keypad, the mobile shows ‘a’ on display screen in write text message area.
By pressing ‘6’ (i.e. key '6'one time) on the keypad, the mobile shows ‘m’ on display screen in write text message area.
By pressing ‘33’ (i.e. key ‘3’ two times) on the keypad, the mobile shows ‘e’ on display screen in write text message area.
By pressing ‘0’ (i.e. key ‘0’ one time) on the keypad, the mobile shows ‘space’ on display screen in write text message area.
By pressing ‘444’ (i.e. key’4’ three times) on the keypad, the mobile shows ‘i’ on display screen in write text message area.
By pressing ‘7777’ (i.e. key ’7’ four times) on the keypad, the mobile shows ‘s’ on display screen in write text message area.
By pressing ‘0’ (i.e. key ‘0’ one time) on the keypad, the mobile shows ‘space’ on display screen in write text message area.
By pressing ‘777’ (i.e. key ’7’ three times) on the keypad, the mobile shows ‘r’ on display screen in write text message area.
By pressing ‘666’ (i.e. key ’6’ three times) on the keypad, the mobile shows ‘o’ on display screen in write text message area.
By pressing ‘22’ (i.e. key ‘2’ two times) on the keypad, the mobile shows ‘b’ on display screen in write text message area.
By pressing ‘33’ (i.e. key ‘3’ two times) on the keypad, the mobile shows ‘e’ on display screen in write text message area.
By pressing ‘777’ (i.e. key ’7’ three times) on the keypad, the mobile shows ‘r’ on display screen in write text message area.
By pressing '8' (i.e. key ’8’ one time) on the keypad, the mobile shows ‘t’ on display screen in write text message area.
But for word monkey
6#666#665533999 this string will be sent by the smuggler one
Here ‘# ‘ denotes that if smuggler watches ‘#’ then it means character previous to # is on the same key to the character after the ‘#’ and smuggler has to wait for 2 seconds and then press the same key.
Explanation:
By pressing ‘6’ i.e. key’6’ one time on the keypad, the mobile shows ‘m’ on display screen.
For '#' wait for 2 seconds, and then press next.
By pressing ‘666’ i.e. key’6’ three times on the keypad, the mobile shows ‘o’ on display screen.
For ‘#’ wait for 2 seconds, and then press next.
By pressing ‘66’ i.e. key’6’ two times on the keypad, the mobile shows ‘n’ on display screen.
By pressing ‘55’ i.e. key’5’ two times on the keypad, the mobile shows ‘k’ on display screen.
By pressing ‘33’ i.e. key’3’ two times on the keypad, the mobile shows ‘e’ on display screen.
By pressing ‘999’ i.e. key’9’ three times on the keypad, the mobile shows ‘y’ on display screen.
*Here lower case doesn’t matter.
*Assuming that the smuggler one will not send any numeral characters in the original message. For example smuggler will not send any message like "I need 1000 bucks" as it contains numerals.

So policemen need your help to track the smugglers. You have to write a program that decodes the sending smuggler’s string (from the number format into plain text).
Instructions to work with Open PBT Client: 1. Specify the work directory path in the 'Work directory Path' field. The path should correspond to your solution Work directory. 2. Download the support files by clicking the Get Dev Files. 3. You will find the problem directories containing: * problem.h file * problem.c file in your project directory. 4. Code the solution in .c file inside the problem directory 5. All required files will be downloaded to your work directory. Creating additional files is strongly discouraged.
Step 1:
In your Solution File: * Implement your logic in function char* decodeCode(char* encodedString) * char* encodedString : is string which is sent by the smuggler1. * You can create more functions if required, but those functions should be in the same file.

Step 2:
In your solution keep in mind the following constraints. 1. In this problem you have to write a program that decodes the string, which is sent by the first smuggler. 2. The function decodeCode() takes the string encodedString as an argument. That string is what the first smuggler sends to the second smuggler. 3. The function decodeCode() returns a string, which is the decoded string in plain text. 4. If encodedString is empty then returns empty string. 5. encodedString should only contain integers, and the special character '#' (if needed). 6. encodedString should not have any alphabetic character (e.x. 'a','b') else return empty string 7. encodedString should not have any special character except '#' else return empty string
The Prototype of the function is char* decodeCode(char* encodedString)
This function takes following argument. * char* encodedString: which represents the string which is send by the smuggler1. * function decodeCode() will return a string which is the decoded string of that string which is send by the smuggler1.
The constraints are: 1. encodedString should only contain integers, and the special character '#' (if needed). 2. encodedString should not contain any alphabetical characters (e.x. 'a', 'b'); otherwise return empty string 3. encodedString should not contain any special characters, except '#'; otherwise return empty string 4. encodedString is empty then returns empty string.
Example 1
Input

char* encodedString = 6999066263304447777077766622337778
Output

my name is robert

Explanation: when you will type the given string in the mobile in create text message area then my name is robert message will be displayed.
Example 2
Input

char* encodedString =777733663084433072#222552433
Output

send the package
Example 3
Input

char* encodedString =777733663T084L43m30@72#222552433
Output

" "

Explanation:
Input string encodedString is having character other than numeric and special character other than # so returning " "(empty string)
For C solutions Header File | : | decodethecode.h | Function Name | : | char* decodeCode(char* encodedString) | File Name | : | decodethecode.c |
For C++ solutions Header File | : | decodethecode.h | Class Name | : | DecodeTheCode | Function Name | : | char* decodeCode(char* encodedString) | File Name | : | decodethecode.c |
General Instructions * | The file / class names, functions, method signatures, header files are to be used as mentioned in the problem statement. Do not use your own names or change the method signatures and fields. You can add any number of additional methods. | * | For C solutions, change the value of "C_OR_CPP" macro in header file as 1 and for C++ solutions change the value as 2. | * | Incase of iostream.h specify as iostream only. | * | Command line options for the main() function are not supported currently. |

Area Under Curve
Write a program to find the area under the curve y = f(x) between x = a and x = b, integrate y = f(x) between the limits of a and b.
The area under a curve between two points can be found by doing a definite integral between the two points.
Instructions to work with Open PBT Client: 1. Specify the work directory path in the 'Work directory Path' field. The path should correspond to your solution Work directory. 2. Download the support files by clicking the Get Support Files. 3. You will find the problem directories containing: * problem.h file * problem.c file in your project directory. 4. Code the solution in.c file inside the problem directory 5. All required files will be downloaded to your work directory. Creating additional files is strongly discouraged.
The Prototype of the Function is : double getAreaUnderCurve (struct Term* equation, int noOfTerms, int limit1,int limit2) * Where equation represents number of Term in a equation with x_pow and coeff of X * Where noOfTerms is the number of terms in the equation * Where limit1 and limit2 are the 2 given points to find the area. * The function getAreaUnderCurve() return the area of type double corrected to 4 decimal places.(eg : 5.2704. )
Example 1
Input :

Term equation = x + 3(x^2); int noOfTerms = 2; int limit1 = 4; int limit2 = 8; where, struct Term* equation => { equation[0].exponent = 1; equation[0].coefficient = 1; equation[1].exponent = 2; equation[1].coefficient = 3; }
Output :

The function getAreaUnderCurve() returns 472.0.
Explanation :

Example 2
Input :

Term[] equation = x; int noOfTerms = 1; int limit1 = 1; int limit2 = 1;
Output :

The function getAreaUnderCurve() returns 0.0
Example 3
Input :

Term equation = x; int noOfTerms = 1; int limit1 = 2; int limit2 = 1;
Output :

The function getAreaUnderCurve() returns 1.5
For C solutions Header File | : | areaundercurve.h | Function Name | : | double getAreaUnderCurve (struct Term* equation, int noOfTerms, int limit1,int limit2) | | File Name | : | areaundercurve.c | |
For C++ solutions Header File | : | areaundercurve.h | Class Name | : | AreaUnderCurve | Function Name | : | double getAreaUnderCurve (struct Term* equation, int noOfTerms, int limit1,int limit2) | FileName | : | areaundercurve.c |
General Instructions * | The file / class names, functions, method signatures, header files are to be used as mentioned in the problem statement. Do not use your own names or change the method signatures and fields. You can add any number of additional methods. | * | For C solutions, change the value of "C_OR_CPP" macro in header file as 1 and for C++ solutions change the value as 2. | * | Incase of iostream.h specify as iostream only. | * | Command line options for the main() function are not supported currently. |

Genetic Diseases
Problem Description
Many human diseases could be controlled by the knowledge of the gene’s structure and pattern. The human gene could be represented by four nucleotides. Each nucleotide is represented by a character - ‘J’, ’S’, ’M’, and ’F’. The string pattern of these nucleotides helps us understand the genes. The functions of the genes are based on these strings.

Some biologists want to discover the medicine for the diseases, which could be controlled with the help of these genes. So they decided to compare the two genes and find the problem, so they could make the cure.

Let’s have two genes JMFMJFM and MFFJM.

One of the methods to get the problem of these two genes is called alignment comparison. In the alignment comparison, spaces are inserted (if necessary) in some positions of the genes. These spaces make them equally long and then we could score these resulting genes according to the scoring matrix (shown below).

For example, one space is inserted into JMFMJFM to result in JMFMJF-M, and three spaces are inserted into MFFJM to result in -MF--FJM. A space is denoted by the sign (-). The two genes are now equal in length. These two strings are aligned: JMFMJF-M -MF--FJM

In this alignment, there are four matches - M in the second position, F in the third, F in the sixth, and M in the eighth. Each pair of aligned characters is assigned a score according to the above scoring matrix.

The score of the alignment above is (-3)+5+5+(-2)+(-3)+5+(-3)+5=9.

Many other alignments are also possible. One is shown below (a different number of spaces is inserted into different positions): JMFMJFM -MFFJ-M

This alignment gives a score of (-3)+5+5+(-2)+5+(-1) +5=14.

So, this one is better than the previous one, and this one is also the optimal. No other alignment could give a higher score.
Then, the similarity of the two genes is 14.

This way the max score will result in the least problems.

SCORE | GRADE | 0 => score | 0 | 0 <= score <= 10 | A | 10 < score <= 20 | B | 20 < score <= 30 | C | 30 < score <= 40 | D | 40 < score <= 50 | E |
On the basis of this grade the biologists could make the cure .
Instructions to work with Open PBT Client: 1. Specify the work directory path in the 'Work directory Path' field. The path should correspond to your solution Work directory. 2. Download the support files by clicking the Get Dev Files. 3. You will find the problem directories containing: * problem.h file * problem.c file in your project directory. 4. Code the solution in .c file inside the problem directory 5. All required files will be downloaded to your work directory. Creating additional files is strongly discouraged.
Step 1:
In your Solution File: * Implement your logic in function char rectifyDiseases(char* pattern1 , char* pattern2) * char* pattern1 : represents the pattern of first gene. * char* pattern2 : represents the pattern of second gene. * You can create more functions if required, but those functions should be in the same file.

Step 2:
Your solution needs to consider the following constraints. 1. In this problem you have to write a program that helps the biologists to get an accurate grade. 2. The human gene could be represented by four nucleotides. Each nucleotide is represented by a character - ‘J’, ’S’, ’M’, and ’F’. 3. The string pattern of these nucleotides helps us understand the genes. 4. The functions of the genes are based on these strings. 5. The cure could be prepared only by comparing the two strings. 6. One of the methods for comparison is called alignment comparison. 7. You have to compare the strings’ characters to the Scoring matrix. 8. String length should not be greater than 10 else return \0. 9. String should be consisting of only given four characters else return \0. 10. Characters being returned by the method should be in capital letters.
The Prototype of the function is char rectifyDiseases(char* pattern1 , char* pattern2) This method takes following arguments. * pattern1 which represents the pattern of first gene. * pattern2 which represents the pattern of second gene. * This method returns a character which is grade.
Constraints
* String length should not be greater than 10 else return \0. * String should be consist of only given four characters else return \0. * Characters being returned by the method should be in capital letters.
Example 1
Input

String pattern1=JMFMJFM
String pattern2=MFFJM
Output

B
Example 2
Input

String pattern1=JMFKMJFM
String pattern2=MFFJBM
Output

\0
Explanation: Input string contains other than ‘J’,’S’,’M’ & ’F’ characters.
Example 3
Input

String pattern1=JMFMFFFFFFFFFFFJFM
String pattern2=MFFJJJJJJJJJJFFFFFMMMMM
Output

\0
Explanation: Length of the input string is greater than 10.
For C solutions Header File | : | geneticdiseases.h | Function Name | : | char rectifyDiseases(char* pattern1 , char* pattern2); | File Name | : | geneticdiseases.c |
For C++ solutions Header File | : | geneticdiseases.h | Class Name | : | GeneticDiseases | Function Name | : | char rectifyDiseases(char* pattern1 , char* pattern2); | File Name | : | geneticdiseases.c |
General Instructions * | The file / class names, functions, method signatures, header files are to be used as mentioned in the problem statement. Do not use your own names or change the method signatures and fields. You can add any number of additional methods. | * | For C solutions, change the value of "C_OR_CPP" macro in header file as 1 and for C++ solutions change the value as 2. | * | Incase of iostream.h specify as iostream only. | * | Command line options for the main() function are not supported currently. |

Padovan String
Problem Description

A Padovan string P(n) for a natural number n is defined as:

P(0) = ‘X’

P(1) = ‘Y’

P(2) = ‘Z’

P(n) = P(n-2) + P(n-3), n>2 where + denotes string concatenation.
For a string of the characters ‘X’ , ‘Y’ and ‘Z’ only, and given value of n, write a program that counts the number of occurrences of the string in the n-th Padovan string P(n).

An example is given below.

For n = 6 and the string ZY, the program should count the occurrences of ZY in P(6).

P(0) = ‘X’

P(1) = ‘Y’

P(2) = ‘Z’

P(n) = P(n-2) + P(n-3), n>2

P(3) = P(1)+P(0)

P(3) = YX

P(4) = P(2)+P(1)

P(4) = ZY

P(5) = P(3)+P(2)

P(5) = YXZ

P(6) = P(4)+P(3)

P(6) = ZYYX

So, the number of occurrences of the string ZY in P(6) is 1.
Instruction to work with Open PBT Client: 1. Specify the work directory path in the 'Work directory Path' field. The path should correspond to your solution Work directory. 2. Download the support files by clicking the Get Dev Files. 3. You will find the problem directories containing: * problem.h file * problem.c file in your project directory. 4. Code the solution in .c file inside the problem directory 5. All required files will be downloaded to your work directory. Creating additional files is strongly discouraged.
Step 1:
In your Solution File: * Implement your logic in function int stringOccurrences(int n, char* str) * int n :n is an integer represents n(th) for which full main string has to formed, from which occurrence of string str has to be found. * char* str :str is a string represents sub string whose occurrence has to be found in the main string. * You can create more functions if required, but those functions should be in the same file.

Step 2:
In your solution keep in mind the following constraints:. 1. In this problem you have to write a program that counts the number of occurrences of the string in the n-th Padovan string P(n). 2. Padovan formula is P(n) = P(n-2) + P(n-3) where n>2 and n is the integer. 3. In the above Padovan formula + sign means string concatenation. 4. For the Padovan formula value of P(0),P(1) and P(2) is given. You have to use those value only. 5. n should not be greater than 40 otherwise return -1 6. string str should be consist of only X,Y and Z in upper case otherwise return -1
The Prototype of the function is int stringOccurrences(int n, char* str)
This function takes following arguments. * n is the value for which full main string has to formed, from which occurrence of string str has to be found. * str represents sub string whose occurrence has to be found in the main string. * This function returns a number of occurrence of string str in the main string.
The constraints are: 1. n should not be greater than 40 otherwise return -1 2. string str should be consist of only X,Y and Z in upper case otherwise return -1
Example 1
Input

int n = 6 string str = ZY
Output

1
Explanation : This question is explained in problem description.
Example 2
Input

int n = 6
String str = ZYmm
Output

-1
Explanation :
String str is containing character other than X, Z and Y.
Example 3
Input

int n = 8
String str = XZ
Output

1
For C solutions Header File | : | padovanstring.h | Function Name | : | int stringOccurrences(int n, char* str) | File Name | : | padovanstring.c |
For C++ solutions Header File | : | padovanstring.h | Class Name | : | PadovanString | Function Name | : | int stringOccurrences(int n, char* str) | File Name | : | padovanstring.c |
General Instructions * | The file / class names, functions, method signatures, header files are to be used as mentioned in the problem statement. Do not use your own names or change the method signatures and fields. You can add any number of additional methods. | * | For C solutions, change the value of "C_OR_CPP" macro in header file as 1 and for C++ solutions change the value as 2. | * | In case of iostream.h specify as iostream only. | * | Command line options for the main() function are not supported currently. |

Pebble Merchant
Problem Description
There is a pebble merchant. He sells the pebbles, that are used for shining the floor. His main duty is to take the length of the room’s sides. But he sometimes mistakes doing that and the mistakes result in losses. So, he comes to you, and asks you to make a small intelligent car, which could run along the room’s walls and calculate their length. The car has to come back from where it’s started. This means the starting point is the same as the ending one. When the car gives the length of the room’s walls, you could calculate the surface area of the floor. Knowing the surface area, you could calculate the price for covering the whole floor with pebbles.

3 kilograms of pebbles are needed for covering an area of 1 square meter .
The rate of the pebbles is $5 per kilogram.

For example

The car’s measurements are illustrated, using two arrays.

Array 1 = {L, R, L, R, R, L, R, R, L, R, R, L, R, L, L, R, Z}

Where

L denotes, that the car turned Left.
R denotes, that the car turned Right.
Z denotes, that the finishing point is after the last turn.

The following picture will clear any misunderstandings (on this example Array 1 = {L,R,R,R,Z})

Array 2 = {3, 4, 2, 3, 2, 4, 5, 4, 2, 3, 2, 1, 2, 2, 2, 1, 2}

An element of Array 2 denotes the length (in meters), covered by the car, after taking the corresponding turn.

{3L, 4R, 2L, 3R, 2R, 4L, 5R, 4R, 2L, 3R, 2R, 1L, 2R, 2L, 2L, 1R, 2Z}

In this representation it is clearly visible that the direction from entry turning point is measured, along with the distance to the next turning point.

The last element Z in Array 1 represents that the corresponding length in the Array 2 is the final distance and the car will be at finishing point after covering this length.

The area of the given picture is 63 square meters and the cost for covering it is $945.
Instructions to work with Open PBT Client: 1. Specify the work directory path in the 'Work directory Path' field. The path should correspond to your solution work directory. 2. Download the support files by clicking the Get Dev Files. 3. You will find the problem directories containing: * problem.h file * problem.c file in your project directory. 4. Code the solution in .c file inside the problem directory 5. All required files will be downloaded to your work directory. Creating additional files is strongly discouraged.
Step 1:
In your Solution File: * Implement your logic in the function int * findCost(char direction[],int length[]). * char direction[] : is a character array which represents turning direction of car. * int length[] : is an integer array, which represents the length, traveled by the car, in each direction. * You can create more functions if required, but those functions should be in the same file.

Step 2:
Your solution needs to consider the following constraints. 1. In this problem you have to make a program for the pebble merchant. 2. His main duty is to take the length of the room’s sides. But he sometimes mistakes doing that and the mistakes result in losses. 3. So, he comes to you and asks you to make a small intelligent car, which could run along the room’s walls and calculate their length. 4. The car has to come back from where it started. 5. This means the starting point is the same as the ending one. 6. The direction array contains only L, R and Z in UPPER CASE; otherwise return {0,0}
The Prototype of the function is int * findCost(char direction[],int length[]).
This method takes the following arguments: * direction is a character array, which represents the turning directions of the car. * length is an integer array, which represents the length, traveled by the car, in each direction.

* This method returns an integer array having two elements first is the calculated area and second is the estimated cost.
The constraints are: 1. The direction array contains only L, R and Z in UPPER CASE; otherwise return {0,0} 2. The direction array's last element should be Z; otherwise return {0,0} 3. Each element in the length array should be greater than 0; otherwise return {0,0}
Example 1
Input

direction[] = {L,R,R,L,L,R,R,R,R,L,Z} length[]= {2,2,1,1,1,2,5,2,2,3,1}
Output

{18,270}
Explanation : The area of the resultant figure is 18 square meters and the cost for covering it is $270.
Example 2
Input

direction[] = {L,L,R,R,L,R,R,L,R,L,R,R,L,R,L,R,R,L,Z} length[]= {1,1,1,1,2,2,2,2,1,2,1,2,2,1,1,1,1,2,2}
Output

{24,360}
Example 3
Input

direction[] = {L,R,L,R,R,L,R,R,L,R,A,L,Z} length[]= {1,2,2,2,2,2,5,2,1,2,3,2,2}
Output

{0,0}
For C solutions Header File | : | pebblemerchant.h | Function Name | : | int * findCost(char direction[],int length[]) | File Name | : | pebblemerchant.c |
For C++ solutions Header File | : | pebblemerchant.h | Class Name | : | PebbleMerchant | Function Name | : | int * findCost(char direction[],int length[]) | File Name | : | pebblemerchant.c |
General Instructions * | The file / class names, functions, method signatures, header files are to be used as mentioned in the problem statement. Do not use your own names or change the method signatures and fields. You can add any number of additional methods. | * | For C solutions, change the value of "C_OR_CPP" macro in header file as 1 and for C++ solutions change the value as 2. | * | Incase of iostream.h specify as iostream only. | * | Command line options for the main() function are not supported currently. |

Padovan String
Problem Description

A Padovan string P(n) for a natural number n is defined as:

P(0) = ‘X’

P(1) = ‘Y’

P(2) = ‘Z’

P(n) = P(n-2) + P(n-3), n>2 where + denotes string concatenation.
For a string of the characters ‘X’ , ‘Y’ and ‘Z’ only, and given value of n, write a program that counts the number of occurrences of the string in the n-th Padovan string P(n).

An example is given below.

For n = 6 and the string ZY, the program should count the occurrences of ZY in P(6).

P(0) = ‘X’

P(1) = ‘Y’

P(2) = ‘Z’

P(n) = P(n-2) + P(n-3), n>2

P(3) = P(1)+P(0)

P(3) = YX

P(4) = P(2)+P(1)

P(4) = ZY

P(5) = P(3)+P(2)

P(5) = YXZ

P(6) = P(4)+P(3)

P(6) = ZYYX

So, the number of occurrences of the string ZY in P(6) is 1.
Instruction to work with Open PBT Client: 1. Specify the work directory path in the 'Work directory Path' field. The path should correspond to your solution Work directory. 2. Download the support files by clicking the Get Dev Files. 3. You will find the problem directories containing: * problem.h file * problem.c file in your project directory. 4. Code the solution in .c file inside the problem directory 5. All required files will be downloaded to your work directory. Creating additional files is strongly discouraged.
Step 1:
In your Solution File: * Implement your logic in function int stringOccurrences(int n, char* str) * int n :n is an integer represents n(th) for which full main string has to formed, from which occurrence of string str has to be found. * char* str :str is a string represents sub string whose occurrence has to be found in the main string. * You can create more functions if required, but those functions should be in the same file.

Step 2:
In your solution keep in mind the following constraints:. 1. In this problem you have to write a program that counts the number of occurrences of the string in the n-th Padovan string P(n). 2. Padovan formula is P(n) = P(n-2) + P(n-3) where n>2 and n is the integer. 3. In the above Padovan formula + sign means string concatenation. 4. For the Padovan formula value of P(0),P(1) and P(2) is given. You have to use those value only. 5. n should not be greater than 40 otherwise return -1 6. string str should be consist of only X,Y and Z in upper case otherwise return -1
The Prototype of the function is int stringOccurrences(int n, char* str)
This function takes following arguments. * n is the value for which full main string has to formed, from which occurrence of string str has to be found. * str represents sub string whose occurrence has to be found in the main string. * This function returns a number of occurrence of string str in the main string.
The constraints are: 1. n should not be greater than 40 otherwise return -1 2. string str should be consist of only X,Y and Z in upper case otherwise return -1
Example 1
Input

int n = 6 string str = ZY
Output

1
Explanation : This question is explained in problem description.
Example 2
Input

int n = 6
String str = ZYmm
Output

-1
Explanation :
String str is containing character other than X, Z and Y.
Example 3
Input

int n = 8
String str = XZ
Output

1
For C solutions Header File | : | padovanstring.h | Function Name | : | int stringOccurrences(int n, char* str) | File Name | : | padovanstring.c |
For C++ solutions Header File | : | padovanstring.h | Class Name | : | PadovanString | Function Name | : | int stringOccurrences(int n, char* str) | File Name | : | padovanstring.c |
General Instructions * | The file / class names, functions, method signatures, header files are to be used as mentioned in the problem statement. Do not use your own names or change the method signatures and fields. You can add any number of additional methods. | * | For C solutions, change the value of "C_OR_CPP" macro in header file as 1 and for C++ solutions change the value as 2. | * | In case of iostream.h specify as iostream only. | * | Command line options for the main() function are not supported currently. |

Board Coloring
Problem Description

In this problem you are given a board in which some of the elements are placed as shown in diagram below. Each element represents a color.
Fill the other elements in the board, such that none of the adjacent elements (vertically, horizontally and diagonally) should be of the same color.
Find out the minimum number of colors that should be used to fill the blank spaces in the board, so that the above condition is met.
Color representation is -: 0, 1, 2, 3, 4, 5, 6, 7…………………….
There is sample board:

For Example:
Given Board :

Matrix representation of board is :
[ _ 1 _ _ ]
[ 2 _ _ _ ]
[ _ _ 2 _ ]
[ 2 _ _ _ ] here blank space is represented by '_' .
Minimum colors to fill this board (given in the picture)is 4.
Instruction to work with Open PBT Client: 1. Specify the work directory path in the 'Work directory Path' field. The path should correspond to your solution Work directory. 2. Download the support files by clicking the Get Dev Files. 3. You will find the problem directories containing: * problem.h file * problem.c file in your project directory. 4. Code the solution in.c file inside the problem directory 5. All required files will be downloaded to your work directory. Creating additional files is strongly discouraged.
Step 1:
In your Solution File: * Implement your logic in function int color(char board[4][4]) * char board[4][4]board is 2 dimensional matrix of order M X M where M = 4. * You can create more functions if required, but those functions should be in the same file.

Step 2:
In your solution keep in mind the following constraints. 1. In this problem you have to write a program that finds the minimum number of colors needed to fill a board in which some of the elements are placed in advance. 2. Function color() will take 2 dimension board as a input. 3. Function color() returns the minimum number of colors that could fill the board meeting the given condition. 4. Board is a 2 dimensional of M X M where M = 4 else return 0 5. Fill the other elements in the board, such that none of the adjacent elements (vertically, horizontally and diagonally) should be of the same color.
The Prototype of the function is int color(char board[4][4])
This function takes following arguments. * board is 2 dimensional matrix of order M X M where M = 4. * This function returns minimum no of color by which board can be filled.
The constraints are: 1. Board is a 2 dimensional of M X M where M = 4 else return 0 2. Fill the other elements in the board, such that none of the adjacent elements (vertically, horizontally and diagonally) should be of the same color.
Example 1
Input

{ 2 0 _ 1 }
{ _ 1 _ _ }
{ _ 2 _ 0 }
{ _ _ _ 1 }
Output

5
Explanation:
We need a minimum 5 different colors to complete the board.
Example 2
Input

{ 2 0 _ 1 3}
{ _ 1 _ _ 2}
{ _ 2 _ 0 1}
{ _ _ _ 1 2}
{ _ _ _ _ 0}
Output

0

Explanation:
Size of the board is greater than 4X4.
Example 3
Input

{ _ 0 }
{ 1 _ }
Output

0

Explanation:
Size of the board is less than 4X4.
For C solutions Header File | : | boardcoloring.h | Function Name | : | int color(char board1[4][4]) | File Name | : | boardcoloring.c |
For C++ solutions Header File | : | boardcoloring.h | Class Name | : | BoardColoring | Function Name | : | int color(char board1[4][4]) | File Name | : | boardcoloring.c |
General Instructions * | The file / class names, functions, method signatures, header files are to be used as mentioned in the problem statement. Do not use your own names or change the method signatures and fields. You can add any number of additional methods. | * | For C solutions, change the value of "C_OR_CPP" macro in header file as 1 and for C++ solutions change the value as 2. | * | Incase of iostream.h specify as iostream only. | * | Command line options for the main() function are not supported currently. |