Welcome to my curated repository of LeetCode solutions! 💻🚀
Organized by language and topics for easier navigation:
leetcode/
├── cpp/ ⚙️ C++ Solutions
│ ├── array/ 📊 Array problems
│ ├── binary-search/ 🔍 Binary Search problems
│ ├── dp/ 🧠 Dynamic Programming
│ └── ... 🔄 Other categories
├── python/ 🐍 Python Solutions
├── sql/ 🗄️ SQL Solutions
├── js/ 📜 JavaScript Solutions
└── README.md 📝 Project overview
💡 Run the included
organize_workspace.bat
script to automatically organize files by language!
-
Clone the repo:
git clone https://github.com/LSUDOKO/leetcode.git cd leetcode
-
Run the organization script:
organize_workspace.bat
-
Run your solution:
- C++:
g++ -std=c++17 cpp/array/1-Two-Sum.cpp -o TwoSum && TwoSum
- Python:
python python/1-Two-Sum.py
- SQL: Open
.sql
file in your database client - JavaScript:
node js/2667-Create-Hello-World-Function.js
- C++:
- 0034-find-first-and-last-position-of-element-in-sorted-array
- 0035-search-insert-position
- 0152-maximum-product-subarray
- 0493-reverse-pairs
- 0792-binary-search
- 0034-find-first-and-last-position-of-element-in-sorted-array
- 0035-search-insert-position
- 0493-reverse-pairs
- 0792-binary-search
Want to contribute? That's great! Here's how:
- Fork this repo ❤️
- Create a branch:
git checkout -b feat/new-solution
- Add your solution into the correct folder ✨
- Commit & push 🎉
- Open a Pull Request 👍
This project is licensed under the MIT License 🔓