Welcome to my LeetCode Submissions Repository! This repository contains my solutions to various LeetCode problems, categorized by difficulty and topic. I aim to continuously improve my problem-solving skills and maintain a well-structured collection of solutions.
- 🔥 Languages Used: Python, Java, Javascript(as needed)
- 📌 Topics Covered: Data Structures & Algorithms (Arrays, Strings, Recurssion, Searching, etc.)
- 🏆 Goal: Consistently solve problems to enhance problem-solving skills and prepare for coding interviews.
📦 LeetCode-Solutions
┣ 📂 Easy
┃ ┣ 📜 two_sum.py
┃ ┣ 📜 valid_parentheses.py
┃ ┗ 📜 merge_two_sorted_lists.py
┣ 📂 Medium
┃ ┣ 📜 add_two_numbers.py
┃ ┣ 📜 longest_substring.py
┃ ┗ 📜 rotate_image.py
┣ 📂 Hard
┃ ┣ 📜 XX
┃ ┣ 📜 XX
┃ ┗ 📜 XX
┣ 📜 README.md
┗ 📜 .gitignore
- Clone the repository:
git clone https://github.com/your-username/LeetCode-Solutions.git
- Navigate to the problem folder:
cd LeetCode-Solutions/Easy
- Run a solution (Example for Python):
python two_sum.py
Difficulty | Solved |
---|---|
Easy | ✅ XX |
Medium | ✅ XX |
Hard | ✅ XX |
📌 Total Problems Solved: XX / YYYY 🎯
- ✅ Arrays & Strings
- ✅ Linked Lists
- ✅ Stack & Queue
- ✅ Hashmaps
- ✅ Binary Trees
- ✅ Graphs
- ✅ Dynamic Programming
- ✅ Greedy Algorithms
This repository is primarily for personal use, but feel free to explore and suggest improvements! If you have optimized versions of solutions, feel free to fork and submit a PR.
- 📧 Email: tusharmyself06@gmail.com
- 🏛️ LinkedIn: Tushar Verma
- 🏆 LeetCode: My Profile
🚀 Happy Coding & Keep Grinding! 💡
0070-climbing-stairs |
1013-fibonacci-number |
1236-n-th-tribonacci-number |
0003-longest-substring-without-repeating-characters |
0966-binary-subarrays-with-sum |
1046-max-consecutive-ones-iii |
1813-maximum-erasure-value |
0036-valid-sudoku |
0054-spiral-matrix |
0074-search-a-2d-matrix |
0079-word-search |
1791-richest-customer-wealth |
2722-prime-in-diagonal |
0303-range-sum-query-immutable |
1294-range-frequency-queries |
1294-range-frequency-queries |
2148-minimum-number-of-moves-to-seat-everyone |
0053-maximum-subarray |
0108-convert-sorted-array-to-binary-search-tree |
0169-majority-element |
0164-maximum-gap |
0164-maximum-gap |
1951-find-the-winner-of-the-circular-game |
0278-first-bad-version |
0374-guess-number-higher-or-lower |
0204-count-primes |
2083-three-divisors |
2507-number-of-common-factors |
0292-nim-game |
0292-nim-game |
0909-stone-game |
2573-remove-nodes-from-linked-list |
0108-convert-sorted-array-to-binary-search-tree |
0230-kth-smallest-element-in-a-bst |
0530-minimum-absolute-difference-in-bst |
0783-search-in-a-binary-search-tree |
0062-unique-paths |