some more info and some difficulty added!

problems/fibonacisequence/manifest.json

@@ -2,5 +2,6 @@
     "title": "Fibonacci Sequence",
     "description": "Calculate the n-th Fibonacci number using a function. The Fibonacci sequence is defined as follows: F(0) = 0, F(1) = 1, and F(n) = F(n-1) + F(n-2) for n > 1.",
     "description_md": "problems/fibonacisequence/description.md",
+    "difficulty": "medium",
     "test_code": "problems/fibonacisequence/test.py"
 }

problems/reversedstring/manifest.json

@@ -2,5 +2,6 @@
     "title":"Reversed String",
     "description":"Reverse a String using a Function ; Try to write as little code as possible",
     "description_md":"problems/reversedstring/description.md",
+    "difficulty":"easy",
     "test_code":"problems/reversedstring/test.py"
 }

problems/sortlist/manifets.json

@@ -2,5 +2,6 @@
   "title": "Sort List",
   "description": "Sort a List with a Function (sortlist); the function is supposed to take the list as an argument and is supposed to return the sorted list and print it.",
   "description_md": "problems/sortlist/description.md",
+  "difficulty": "easy",
   "test_code": "problems/sortlist/test.py"
 }