Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions bin/auto-sync.txt
Original file line number Diff line number Diff line change
Expand Up @@ -72,6 +72,7 @@ robot-simulator
roman-numerals
rotational-cipher
run-length-encoding
saddle-points
say
scrabble-score
secret-handshake
Expand Down
8 changes: 8 additions & 0 deletions config.json
Original file line number Diff line number Diff line change
Expand Up @@ -458,6 +458,14 @@
"strings"
]
},
{
"slug": "saddle-points",
"name": "Saddle Points",
"uuid": "5ae50dea-8879-414f-afc8-49db16b53498",
"practices": [],
"prerequisites": [],
"difficulty": 1
},
{
"slug": "series",
"name": "Series",
Expand Down
27 changes: 27 additions & 0 deletions exercises/practice/saddle-points/.docs/instructions.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,27 @@
# Instructions

Your task is to find the potential trees where you could build your tree house.

The data company provides the data as grids that show the heights of the trees.
The rows of the grid represent the east-west direction, and the columns represent the north-south direction.

An acceptable tree will be the largest in its row, while being the smallest in its column.

A grid might not have any good trees at all.
Or it might have one, or even several.

Here is a grid that has exactly one candidate tree.

```text
1 2 3 4
|-----------
1 | 9 8 7 8
→ 2 |[5] 3 2 4
3 | 6 6 7 1
```

- Row 2 has values 5, 3, 2, and 4. The largest value is 5.
- Column 1 has values 9, 5, and 6. The smallest value is 5.

So the point at `[2, 1]` (row: 2, column: 1) is a great spot for a tree house.
11 changes: 11 additions & 0 deletions exercises/practice/saddle-points/.docs/introduction.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,11 @@
# Introduction

You plan to build a tree house in the woods near your house so that you can watch the sun rise and set.

You've obtained data from a local survey company that show the height of every tree in each rectangular section of the map.
You need to analyze each grid on the map to find good trees for your tree house.

A good tree is both:

- taller than every tree to the east and west, so that you have the best possible view of the sunrises and sunsets.
- shorter than every tree to the north and south, to minimize the amount of tree climbing.
19 changes: 19 additions & 0 deletions exercises/practice/saddle-points/.meta/config.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
{
"authors": [
"resu-xuniL"
],
"files": {
"solution": [
"SaddlePoints.php"
],
"test": [
"SaddlePointsTest.php"
],
"example": [
".meta/example.php"
]
},
"blurb": "Detect saddle points in a matrix.",
"source": "J Dalbey's Programming Practice problems",
"source_url": "https://users.csc.calpoly.edu/~jdalbey/103/Projects/ProgrammingPractice.html"
}
35 changes: 35 additions & 0 deletions exercises/practice/saddle-points/.meta/example.php
Original file line number Diff line number Diff line change
@@ -0,0 +1,35 @@
<?php

declare(strict_types=1);

class SaddlePoints
{
public function saddlePoints(array $matrix): array
{
if (empty($matrix[0])) {
return [];
}

$trees = [];
$maxs = array_map('max', array_map(null, $matrix));

if (count($matrix) > 1) {
$mins = array_map('min', array_map(null, ...$matrix));
} else {
$mins = $matrix[0];
}

for ($ridx = 0; $ridx < count($matrix); $ridx++) {
for ($cidx = 0; $cidx < count($matrix[$ridx]); $cidx++) {
if ($maxs[$ridx] === $mins[$cidx]) {
array_push($trees, [
'row' => $ridx + 1,
'column' => $cidx + 1
]);
}
}
}

return $trees;
}
}
37 changes: 37 additions & 0 deletions exercises/practice/saddle-points/.meta/tests.toml
Original file line number Diff line number Diff line change
@@ -0,0 +1,37 @@
# This is an auto-generated file.
#
# Regenerating this file via `configlet sync` will:
# - Recreate every `description` key/value pair
# - Recreate every `reimplements` key/value pair, where they exist in problem-specifications
# - Remove any `include = true` key/value pair (an omitted `include` key implies inclusion)
# - Preserve any other key/value pair
#
# As user-added comments (using the # character) will be removed when this file
# is regenerated, comments can be added via a `comment` key.

[3e374e63-a2e0-4530-a39a-d53c560382bd]
description = "Can identify single saddle point"

[6b501e2b-6c1f-491f-b1bb-7f278f760534]
description = "Can identify that empty matrix has no saddle points"

[8c27cc64-e573-4fcb-a099-f0ae863fb02f]
description = "Can identify lack of saddle points when there are none"

[6d1399bd-e105-40fd-a2c9-c6609507d7a3]
description = "Can identify multiple saddle points in a column"

[3e81dce9-53b3-44e6-bf26-e328885fd5d1]
description = "Can identify multiple saddle points in a row"

[88868621-b6f4-4837-bb8b-3fad8b25d46b]
description = "Can identify saddle point in bottom right corner"

[5b9499ca-fcea-4195-830a-9c4584a0ee79]
description = "Can identify saddle points in a non square matrix"

[ee99ccd2-a1f1-4283-ad39-f8c70f0cf594]
description = "Can identify that saddle points in a single column matrix are those with the minimum value"

[63abf709-a84b-407f-a1b3-456638689713]
description = "Can identify that saddle points in a single row matrix are those with the maximum value"
33 changes: 33 additions & 0 deletions exercises/practice/saddle-points/SaddlePoints.php
Original file line number Diff line number Diff line change
@@ -0,0 +1,33 @@
<?php

/*
* By adding type hints and enabling strict type checking, code can become
* easier to read, self-documenting and reduce the number of potential bugs.
* By default, type declarations are non-strict, which means they will attempt
* to change the original type to match the type specified by the
* type-declaration.
*
* In other words, if you pass a string to a function requiring a float,
* it will attempt to convert the string value to a float.
*
* To enable strict mode, a single declare directive must be placed at the top
* of the file.
* This means that the strictness of typing is configured on a per-file basis.
* This directive not only affects the type declarations of parameters, but also
* a function's return type.
*
* For more info review the Concept on strict type checking in the PHP track
* <link>.
*
* To disable strict typing, comment out the directive below.
*/

declare(strict_types=1);

class SaddlePoints
{
public function saddlePoints(array $matrix): array
{
throw new \BadMethodCallException("Implement the saddlePoints method");
}
}
Loading
Loading