Update README.md
Browse files
README.md
CHANGED
|
@@ -9,20 +9,13 @@ library_name: transformers
|
|
| 9 |
pipeline_tag: text-generation
|
| 10 |
widget:
|
| 11 |
- text: "
|
| 12 |
-
|
| 13 |
-
# You are given a 0-indexed m x n integer matrix grid. The width of a column is the maximum length of its integers.
|
| 14 |
-
|
| 15 |
-
# For example, if grid = [[-10], [3], [12]], the width of the only column is 3 since -10 is of length 3.
|
| 16 |
-
|
| 17 |
-
# Return an integer array ans of size n where ans[i] is the width of the ith column.
|
| 18 |
-
|
| 19 |
-
# The length of an integer x with len digits is equal to len if x is non-negative, and len + 1 otherwise.
|
| 20 |
|
| 21 |
class Solution:
|
| 22 |
-
def
|
| 23 |
```
|
| 24 |
"
|
| 25 |
-
example_title: "
|
| 26 |
---
|
| 27 |
|
| 28 |
LLM: [Salesforce/CodeGen-6B-Mono](https://huggingface.co/Salesforce/codegen-6B-mono)
|
|
|
|
| 9 |
pipeline_tag: text-generation
|
| 10 |
widget:
|
| 11 |
- text: "
|
| 12 |
+
# Given an array of integers, return indices of the two numbers such that they add up to a specific target
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 13 |
|
| 14 |
class Solution:
|
| 15 |
+
def twoSum(self, array, target) -> List[int]:
|
| 16 |
```
|
| 17 |
"
|
| 18 |
+
example_title: "Twosum problem"
|
| 19 |
---
|
| 20 |
|
| 21 |
LLM: [Salesforce/CodeGen-6B-Mono](https://huggingface.co/Salesforce/codegen-6B-mono)
|