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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Performance Review on LLM for solving leetcode problems

Yixian Shen, Yiyi Tao, Shaoshuai Du, Xinyu Qiu et al.
3 citations
Algorithms and Data Compression
1.04
article

Performance Review on LLM for solving leetcode problems

Yixian Shen, Yiyi Tao, Shaoshuai Du, Xinyu Qiu, Lun Wang, Chuanqi Shi, Haitao Zheng
article en
3 citations

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

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)
Openalex Percentile: Top 18%
Algorithms and Data Compression
1.04
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Performance Review on LLM for solving leetcode problems — Yixian Shen, Yiyi Tao, et al. · (2024) | TGRS Research Map | TGRS