Update README.md
Browse filesUpdated the readme to reflect the release of LeetCodeWizard v1.0
README.md
CHANGED
|
@@ -9,13 +9,30 @@ tags:
|
|
| 9 |
- CP
|
| 10 |
---
|
| 11 |
|
| 12 |
-
|
| 13 |
-
The model has been LoRA fine-tuned using [axolotl](https://github.com/OpenAccess-AI-Collective/Axolotl).
|
| 14 |
|
| 15 |
-
|
|
|
|
|
|
|
| 16 |
|
| 17 |
-
|
|
|
|
| 18 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 19 |
This is the result of one of the Google's phone interviews.
|
| 20 |
Question 1:
|
| 21 |
```
|
|
@@ -28,7 +45,7 @@ Solve the problem using Python 3 and explain your solution.
|
|
| 28 |
Given an array of integers arr, return true if the number of occurrences of each value in the array is unique or false otherwise.
|
| 29 |
|
| 30 |
|
| 31 |
-
|
| 32 |
Example 1:
|
| 33 |
|
| 34 |
Input: arr = [1,2,2,1,1,3]
|
|
@@ -151,4 +168,6 @@ class Solution(object):
|
|
| 151 |
pos.append(i)
|
| 152 |
return [sum(abs(j-i) for j in pos) for i in xrange(n)]
|
| 153 |
'''
|
| 154 |
-
```
|
|
|
|
|
|
|
|
|
| 9 |
- CP
|
| 10 |
---
|
| 11 |
|
| 12 |
+
# LeetCodeWizard: A LLM for mastering programming interviews and solving programming problems.
|
|
|
|
| 13 |
|
| 14 |
+
<p align="center">
|
| 15 |
+
<img src="https://raw.githubusercontent.com/Nan-Do/LeetCodeContestsDataset/main/LeetCodeWizardLogo.png" width="400"/>
|
| 16 |
+
</p>
|
| 17 |
|
| 18 |
+
**What is LeetCodeWizard?**
|
| 19 |
+
- LeetCodeWizard is a general large language model specifically trained solve and explain Leetcode problems
|
| 20 |
|
| 21 |
+
**How was the model developed?**
|
| 22 |
+
- This model is a fine-tuned version of the [WizardCoder-Python-7B](https://huggingface.co/WizardLM/WizardCoder-Python-7B-V1.0) with a dataset of [Leetcode problems](https://github.com/Nan-Do/LeetCodeContestsDataset)
|
| 23 |
+
|
| 24 |
+
|
| 25 |
+
**Model capabilities:**
|
| 26 |
+
- It should be able to solve most of the problems found at [Leetcode](https://leetcode.com/) and even pass the sample interviews they offer on the site.
|
| 27 |
+
|
| 28 |
+
- It can write both the code and the explanations for the solutions.
|
| 29 |
+
|
| 30 |
+
| Model | Checkpoint | Base Model |
|
| 31 |
+
|--------------------|---------------------------------------------------------------------------------------------|------------|
|
| 32 |
+
| LeetCodeWizard-13B-V1.0 | 🤗 <a href="https://huggingface.co/Nan-Do/LeetCodeWizard_13B_v1.0/tree/main" target="_blank">HF Link</a> | WizardCoder-Python-13B-V1.0 |
|
| 33 |
+
| LeetCodeWizard-7B-V1.0 | 🤗 <a href="https://huggingface.co/Nan-Do/LeetCodeWizard_7B_V1.0/tree/main" target="_blank">HF Link</a> | WizardCoder-Python-7B-V1.0 |
|
| 34 |
+
|
| 35 |
+
**Examples:**.
|
| 36 |
This is the result of one of the Google's phone interviews.
|
| 37 |
Question 1:
|
| 38 |
```
|
|
|
|
| 45 |
Given an array of integers arr, return true if the number of occurrences of each value in the array is unique or false otherwise.
|
| 46 |
|
| 47 |
|
| 48 |
+
Examples
|
| 49 |
Example 1:
|
| 50 |
|
| 51 |
Input: arr = [1,2,2,1,1,3]
|
|
|
|
| 168 |
pos.append(i)
|
| 169 |
return [sum(abs(j-i) for j in pos) for i in xrange(n)]
|
| 170 |
'''
|
| 171 |
+
```
|
| 172 |
+
|
| 173 |
+
[<img src="https://raw.githubusercontent.com/OpenAccess-AI-Collective/axolotl/main/image/axolotl-badge-web.png" alt="Built with Axolotl" width="200" height="32"/>](https://github.com/OpenAccess-AI-Collective/axolotl)
|