From 821b5fa570f8741445c31f83c7de15df8dea4a9f Mon Sep 17 00:00:00 2001
From: Anastasios Chatzialexiou <16361161+tasxatzial@users.noreply.github.com>
Date: Thu, 19 Dec 2024 11:14:01 +0200
Subject: [PATCH] forum suggestions (remove edge cases from instructions)

---
 exercises/change/instructions.md | 6 ------
 1 file changed, 6 deletions(-)

diff --git a/exercises/change/instructions.md b/exercises/change/instructions.md
index f4ab450fb..8d59ce256 100644
--- a/exercises/change/instructions.md
+++ b/exercises/change/instructions.md
@@ -6,9 +6,3 @@ Correctly determine the fewest number of coins to be given to a customer such th
 
 - An amount of 15 with available coin values [1, 5, 10, 25, 100] should return one coin of value 5 and one coin of value 10, or [5, 10].
 - An amount of 40 with available coin values [1, 5, 10, 25, 100] should return one coin of value 5, one coin of value 10, and one coin of value 25, or [5, 10, 25].
-
-## Edge cases
-
-- Does your algorithm work for any given set of coins?
-- Can you ask for negative change?
-- Can you ask for a change value smaller than the smallest coin value?