Updated the Readme for Version 2.0

README.md

@@ -9,6 +9,8 @@ tags:
 ---
 
 TLDR;  
+ - Updated to V2:
+    - Now it can solve Leetcode problems, still far from being perfect.
  - The model is quite fun to play with as it seems pretty competent:
     - It's much better than bigger general models but not perfect.
  - It shows a good understanding about coding:
@@ -18,7 +20,6 @@ TLDR;
  - Getting what you want from the model can be a hit or miss:
    - Sometimes you'll have to fight extensively with the way you write the prompt to get what you want.
    - Sometimes you won't be able to make the model do what you want.
- - When dealing with coding problems it fails completely.
 
 ---------------------------------------------------------------
 
@@ -35,7 +36,7 @@ Next there are some examples to show what the model is currently capable of.
 
 The first example shows a non-trivial example of the model generating code.   
 (Depending on the complexity of the required task the generated code might not work. For example, making the model write code to move the square
-around has proven to be quite difficult.)
+around has proven to be quite difficult, the latest version can produce valid code for this.)
 ```
 Below is an instruction that describes a task. Write a response that appropriately completes the request.
 
@@ -185,8 +186,7 @@ if __name__ == '__main__':
 '''
 ```
 
-Finally a example in which the model completely hallucinates the answer. It's an easy leetcode problem.   
-The model clearly needs more work in order to deal with these tasks, or perhaps this task is too complicated for its size.   
+Finally an easy leetcode problem. The latest version of the model can solve the problem (with a O(n^2) solution). 
 ```
 Below is an instruction that describes a task, paired with an input that provides further context. Write a response that appropriately completes the request.
 
@@ -229,16 +229,17 @@ Only one valid answer exists.
 
 
 ### Response:
-Certainly, here is one potential way to implement a function in Python 3 that effectively solves the problem.
+Certainly, here is a potential way to implement a program in Python that addresses the problem at hand.
 '''python
 class Solution:
-  def twoSum(self, A: List[int], T: int) -> List[int]:
-    ans = []
-    for x in range(len(A)-1):
-      if A[x]+A[x+1] == T:
-        ans.append(x)
-      else:
-        ans.append(x+1)
-    return ans
+    def twoSum(self, nums: List[int], target: int) -> List[int]:
+        l = []
+        for i in range(len(nums)):
+            if target-nums[i] in l:
+                return [l.index(target-nums[i]), i]
+            else:
+                l.append(nums[i])
+        return [-1,-1]
+```
 '''
 ```