Performance Review on LLM for solving leetcode problems
This paper presents a comprehensive performance evaluation of Large Language Models (LLMs) in solving programming challenges from Leetcode, a widely used platform for algorithm practice and technical interviews. We began by crawling the Leetcode website to collect a diverse set of problems encompassing various difficulty levels and topics. Using this dataset, we generated solutions with multiple LLMs, including GPT-4 and GPT-3.5-turbo (ChatGPT-turbo). The generated solutions were systematically evaluated for correctness and efficiency. We employed the pass@k metric to assess the success rates within a given number of attempts and analyzed the runtime performance of the solutions. Our results highlight the strengths and limitations of current LLMs [1] in code generation and problem-solving tasks, providing insights into their potential applications and areas for improvement in automated programming assistance.
Authors
- Yixian Shen (ORCID: https://orcid.org/0000-0001-8447-872X)
- Yiyi Tao
- Shaoshuai Du
- Xinyu Qiu (ORCID: https://orcid.org/0009-0007-0131-7869)
- Lun Wang (ORCID: https://orcid.org/0000-0001-6265-493X)
- Chuanqi Shi
- Haitao Zheng (ORCID: https://orcid.org/0000-0002-5918-2940)
Institutions
- Boston University (US)
- Northeastern University (US)
- Johns Hopkins University (US)
- Duke University (US)
- University of California San Diego (US)
- Amsterdam University of the Arts (NL)
- University of Amsterdam (NL)
Publication Details
- Published
- 2024-12-20
- DOI
- https://doi.org/10.1109/aiim64537.2024.10934280
- Citations
- 3
- Primary Topic
- Algorithms and Data Compression
- Type
- article
- Field-Weighted Citation Impact
- 1.04