---
license: mit
datasets:
- mhhmm/leetcode-solutions-python
- deepmind/code_contests
language:
- en
library_name: transformers
pipeline_tag: text-generation
widget:
- text: "
  # You are given a 0-indexed m x n integer matrix grid. The width of a column is the maximum length of its integers.
  
  # For example, if grid = [[-10], [3], [12]], the width of the only column is 3 since -10 is of length 3.
  
  # Return an integer array ans of size n where ans[i] is the width of the ith column.
  
  # The length of an integer x with len digits is equal to len if x is non-negative, and len + 1 otherwise.

  class Solution:
    def findColumnWidth(self, grid: List[List[int]]) -> List[int]:

  "
  example_title: "New Medium Problem on Leetcode"
---

LLM: [Salesforce/CodeGen-6B-Mono](https://huggingface.co/Salesforce/codegen-6B-mono)

I'm using [Peft](https://github.com/huggingface/peft) for tuning

Tuning: 
- [LoRA](https://github.com/microsoft/LoRA)
- [Leetcode](https://huggingface.co/datasets/mhhmm/leetcode-solutions-python)
- [Google Deepind Code contests](https://huggingface.co/datasets/deepmind/code_contests)
- Google Colab Pro+ in 2 hours, shoutout to my friend TieuPhuong