How velkonost/leetcode works
Project type and purpose
• This is not a web application or microservice ecosystem but a monolithic, file-based code repository (“leetcode”) containing hundreds of self-contained algorithm solutions.
• Each subdirectory is a standalone problem implementation (mostly in Kotlin, with a few SQL and one JavaScript solution).
• The purpose is purely educational/archival: store, document, and execute individual LeetCode solutions.
File structure
• Top level
• README.md (“# leetcode”)
• 400+ problem directories named “<number>-<title>”
• Inside each problem directory
• README.md – problem statement or notes
• A single source file (two-sum.kt, complement-of-base-10-integer.kt, etc.)
• No shared code libraries, build scripts, frameworks, or external service configurations exist.
• This structure follows a flat, directory-per-module modular pattern.
Insights from the README
• The repo README contains only a title and no architectural or dependency information.
• Each problem’s README may contain sample I/O or complexity notes but no “system” details.