i3le/challange_Kombinationen_01
1
0
Fork 0
Code Issues Pull requests Actions Packages Projects Releases Wiki Activity

Update README.md

Browse source 
adding idea
This commit is contained in:
i3le 2024-08-03 09:06:18 +02:00
parent c24a96526b
commit b66ff8040b
1 changed files with 15 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

17
README.md
View file

@ -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. 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.