From b66ff8040be4cf1abd594e70ebee391e62dc1361 Mon Sep 17 00:00:00 2001 From: i3le Date: Sat, 3 Aug 2024 09:06:18 +0200 Subject: [PATCH] Update README.md adding idea --- README.md | 17 +++++++++++++++-- 1 file changed, 15 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index a799c1a..2aed769 100644 --- a/README.md +++ b/README.md @@ -1,3 +1,16 @@ -# challange_Kombinationen_01 +# Challange +you have one list of numbers like : (1,2,3) with no fixed length ( could contain 1 or 10000 ) itams. -ich habe versucht ein problem zu formulieren auf das ich jetzt noch keine gute lösung habe. \ No newline at end of file +Want to have a funktion that forfills the following requirements: +- give you all possible kombinations in one list back +- No Duplicates in direct order like (123112) double a number like that is prhibitit. +- No Duplicates il lager sections like (12 123 123 12) + +an example of an possible Result: + +(1,3,1,2,3,2,1) +build an algorythem that crate an list as defined wiht as less computional steps as possibe. + +# How to use that? +you can commit any solutions in any programming language. +or a formalisation of the problem or idea.