Minimum Shelf :: aspiration 2020 Problem

 

Minimum Shelf  :: aspiration 2020 Problem

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.

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 project directory.
2. Download the support files by clicking the Get Support Files.
3. You will find the following three folders:
   • bin
   • src
   • lib
   in your work directory.
4. Code the solution in  . java file inside the src folder
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 public int shelfCount(String packet) - in class Shelf.
• String packet : is the string as packets are kept in the shelf.

• You can create more methods, but do it in the same class.
  

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 method is

public int shelfCount(String packet)..
This method takes following arguments.

• packet is the string which represents the packets that are kept in the shelf.
  

• This method returns an integer, which is the minimum number of shelves needed.
  

Constraints

1. The names of the packets in the shelf should be upper case; otherwise 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 packets in the initial shelf.

Example 2

Input :

---

ZYXZYXZYXZYX

Output :

---

3

Example 3

Input :

---

ZYXZYmmmXZYXZYX

Output :

---

-1

For Java solutions

Package Name	:	test.minimumshelf
File Name	:	Shelf.java
Class Name	:	Shelf
Function Names	:	public int shelfCount(String packet)

General Instructions

	The package names, class names, method signatures 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.
	The function(s) defined above would be the only functions that would be tested. If you add a main() function for your own testing, that would not be tested.
	Command line options for the main() function are not supported currently.

--

Don't ever give up.

Even when it seems impossible,

Something will always

pull you through.

The hardest times get even

worse when you lose hope.

As long as you believe you can do it, You can.

But When you give up,

You lose !

I DONT GIVE UP.....!!!

In three words I can sum up everything I've learned about life - it goes on......

with regards

prem sasi kumar arivukalanjiam