Performance Review on LLM for solving leetcode problems

Lun Wang, Chuanqi Shi, Shaoshui Du, Yiyi Tao, Yixian Shen +3 more
2/16/2025
cs.SEcs.AI

No confident code implementation found for this paper. 2 possible matches can be shown below.

Abstract

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 [10] in code generation and problem-solving tasks, providing insights into their potential applications and areas for improvement in automated programming assistance.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{wang2025performance,
  title  = {Performance Review on LLM for solving leetcode problems},
  author = {Lun Wang and Chuanqi Shi and Shaoshui Du and Yiyi Tao and Yixian Shen and Hang Zheng and Yanxin Shen and Xinyu Qiu},
  year   = {2025},
  eprint = {2502.15770},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2502.15770v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2502.15770.svg)](https://codeofpaper.com/paper/2502.15770)

Discussion