Statistics

Problem Statement for "StreetParking"

Problem Statement

You are looking for a place to park your car on a suburban street. You can park at any position that meets the following requirements:

1.	It is not directly in front of a private driveway.
2.	It is not directly in front of a bus stop.
3.	It is not 5 meters before a bus stop.
4.	It is not 10 meters before a bus stop.
5.	It is not directly in front of a side-street.
6.	It is not 5 meters before a side-street.
7.	It is not 5 meters after a side-street.

The street will be represented as a String, where each character describes a section of the street 5 meters in length. So the first character describes the first 5 meters of the street, the second character describes the next 5 meters and so on. street will use 'D' for driveway, 'B' for bus stop, 'S' for side-street and '-' for all other sections of the street. A position is directly in front of an object if it has the same index as the object in street. A position is before an object if its index is lower than the index of the object in street. Finally, a position is after an object if its index is higher than the index of the object in street.

Given the street return the total number of possible parking spaces on that street.

Definition

Class:
StreetParking
Method:
freeParks
Parameters:
String
Returns:
int
Method signature:
int freeParks(String street)
(be sure your method is public)

Constraints

  • street will have between 1 and 50 characters inclusive.
  • street will only contain characters 'D', 'B', 'S' and '-'.

Examples

  1. "---B--S-D--S--"

    Returns: 4

    The street looks like this: ---B--S-D--S-- ^ ^ ^ ^ | | | | The arrows indicate where you are allowed to park on this street. Thus the method should return 4.

  2. "DDBDDBDDBDD"

    Returns: 0

    This street is full of private driveways and bus stops. You cannot park anywhere on this street. The method should return 0.

  3. "--S--S--S--S--"

    Returns: 2

    You can only park at the first and last positions on this street. The method should return 2.

  4. "SSD-B---BD-DDSB-----S-S--------S-B----BSB-S--B-S-D"

    Returns: 14

  5. "-SB---S----DD-D-DS---B--BD-S-SD---D----D-B---B-SDD"

    Returns: 15

  6. "------BB-----D--------S--D-BSSS-----B---S-S-SSS---"

    Returns: 23

  7. "------BB-----D--------S--D-BSSS-----B---S-S-SSS---"

    Returns: 23

  8. "----------S--S----D---------SD---DD--D---DSB-B----"

    Returns: 32

  9. "-S---------DDDB---BB----SSD---D-B---S-B-----DD---S"

    Returns: 24

  10. "-D--B---BD-D--------S---DS-SS-S-B-SBB---B--D--BS--"

    Returns: 16

  11. "------DD--S--D--S-S-DSS---B--D--S---B----S----DD-"

    Returns: 19

  12. "-D--B---DS-----B-----S-B--------------B-B-S----DB-"

    Returns: 25

  13. "---D--D---SDB-S-B--SSD-S---D-------SB------D------"

    Returns: 28

  14. "----B---D-S------S-S------DD---SS-B----DD-D-------"

    Returns: 28

  15. "DDDDDDDDDDDDDDDDDD"

    Returns: 0

  16. "D"

    Returns: 0

  17. "B"

    Returns: 0

  18. "S"

    Returns: 0

  19. "-"

    Returns: 1

  20. "--------------------"

    Returns: 20

  21. "SSSSSSSSSSSSSSSSSSSSSSS"

    Returns: 0

  22. "BBBBBBBBBBBBBBBBBB"

    Returns: 0

  23. "-DD-BDDD---B-DSBD---S-B--S--DDS-D-DBSBBDDD-S------"

    Returns: 12

  24. "---D-DDS---SDS---------B-B-D-D-B-DB--S--BD-SDDSB-D"

    Returns: 15

  25. "D--------DBBSBDSBB-------------DBS-DB-S-B--B----S-"

    Returns: 22

  26. "-D--BB-SD-D-B-DDD--B--DBB-S-BB-D-SDBD-------S--B-B"

    Returns: 11

  27. "SD-D-DS-DDD---------BS-SS-D-DD----S--DB---DDBDD---"

    Returns: 19

  28. "B--D-B--D---S-BDDD-D-----D---D---SB--D-B---DBB----"

    Returns: 25

  29. "--S-DDDSDSB--B-DSS----DD----BBBSD---BSD-B-BB-B-SB-"

    Returns: 9

  30. "B-S-D---D-S----DSDBDBD-BDBDD---D-S---DS-DSSS-BDS-"

    Returns: 11

  31. "BDS-D-B-DSB-DSB-BSBD--DS--SB-S-D-SB--BS--B-DB-BD-B"

    Returns: 4

  32. "-SDBS-DBB----SBSSDD--BB---B-DB-DS-DS--DD---DB--D-D"

    Returns: 11

  33. "B--"

    Returns: 2

  34. "--B"

    Returns: 0

  35. "S--"

    Returns: 1

  36. "--S"

    Returns: 1

  37. "D--"

    Returns: 2

  38. "--D"

    Returns: 2

  39. "-S-"

    Returns: 0

  40. "--------------------------------------------------"

    Returns: 50

  41. "-BBBBBBBBB"

    Returns: 0

  42. "-BDDDDDD"

    Returns: 0

  43. "SSD-B---BD----DD--D--SSDB-"

    Returns: 9

  44. "--B--B--B--B--B"

    Returns: 0

  45. "-B"

    Returns: 0

  46. "-"

    Returns: 1

  47. "S-B"

    Returns: 0

This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2024, TopCoder, Inc. All rights reserved.
This problem was used for: