https://github.com/theoliverlear/leetcode-solutions
A helpful guide to solving LeetCode problems in various languages. See solutions and how different implementations affect performance.
https://github.com/theoliverlear/leetcode-solutions
algorithms documentation educational guide leetcode leetcode-solutions
Last synced: about 1 month ago
JSON representation
A helpful guide to solving LeetCode problems in various languages. See solutions and how different implementations affect performance.
- Host: GitHub
- URL: https://github.com/theoliverlear/leetcode-solutions
- Owner: theoliverlear
- Created: 2025-03-09T20:42:27.000Z (8 months ago)
- Default Branch: master
- Last Pushed: 2025-08-07T00:23:23.000Z (3 months ago)
- Last Synced: 2025-08-07T02:29:44.889Z (3 months ago)
- Topics: algorithms, documentation, educational, guide, leetcode, leetcode-solutions
- Language: Java
- Homepage:
- Size: 27.3 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# LeetCode-Solutions
---
This repository contains my solutions to [LeetCode](https://leetcode.com/)
problems. Each problem is solved in multiple languages including, but not
limited to:
- Java
- Python
- C
- C++
- TypeScript
- JavaScript
- C#
- PHP
- Go
- Rust
Each folder corresponds to a specific problem and contains subfolders for
each language. There are two ways I approach each problem, the optimized
version and the clean version. They will each have their respective solutions
in language sub-folders.
## Problems Solved
| Problem # | Problem Name | Tags | Optimized Solutions | Clean Solutions |
|----------------------------------------------------------------------------|------------------------------------------------|----------------------------------------|-----------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------------------|
| **[0001](./Problem-0001-Two-Sum/)** | Two Sum | Array, HashTable | [Link](./Problem-0001-Two-Sum/Problem-0001-Optimized/) | [Link](./Problem-0001-Two-Sum/Problem-0001-Clean/) |
| **[0002](./Problem-0002-Add-Two-Numbers/)** | Adding Two Numbers | Linked List, Math, Recursion | [Link](./Problem-0002-Add-Two-Numbers/Problem-0002-Optimized/) | [Link](./Problem-0002-Add-Two-Numbers/Problem-0002-Clean/) |
| **[0003](./Problem-0003-Longest-Substring-Without-Repeating-Characters/)** | Longest Substring Without Repeating Characters | Hash Table, String, Sliding Window | [Link](./Problem-0003-Longest-Substring-Without-Repeating-Characters/Problem-0003-Optimized/) | [Link](./Problem-0003-Longest-Substring-Without-Repeating-Characters/Problem-0003-Clean/) |
| **[0008](./Problem-0008-String-To-Integer)** | String to Integer (atoi) | String | [Link](./Problem-0008-String-To-Integer/Problem-0008-Optimized/) | [Link](./Problem-0008-String-To-Integer/Problem-0008-Clean/) |
| **[0012](./Problem-0012-Integer-To-Roman/)** | Integer to Roman | Hash Table, Math, String | [Link](./Problem-0012-Integer-To-Roman/Problem-0012-Optimized/) | [Link](./Problem-0012-Integer-To-Roman/Problem-0012-Clean/) |
| **[0094](./Problem-0094-Binary-Tree-Inorder-Traversal/)** | Binary Tree Inorder Traversal | Binary Tree, Depth-First Search, Stack | [Link](./Problem-0094-Binary-Tree-Inorder-Traversal/Problem-0094-Optimized/) | [Link](./Problem-0002-Add-Two-Numbers/Problem-0002-Clean/) |
| **[0509](./Problem-0509-Fibonacci-Number/)** | Fibonacci Number | Recursion, Math, Memoization | [Link](./Problem-0509-Fibonacci-Number/Problem-0509-Optimized/) | N/A |
| **[0912](./Problem-0912-Sort-An-Array/)** | Sort an Array | Array, Sorting, Divide and Conquer | [Link](./Problem-0912-Sort-An-Array/Problem-0912-Optimized/) | N/A |