🚀 LeetCode Daily Solutions

📌 About

This repository contains my daily LeetCode solutions in Python and Java.

The goal of this repository is to:

📅 Maintain consistency by solving LeetCode problems every day.
🧠 Improve problem-solving and algorithmic thinking.
💻 Strengthen Data Structures & Algorithms for interviews.
📚 Keep an organized archive of all solved problems.

Each solution is automatically pushed using LeetHub after successful submission on LeetCode.

📂 Repository Structure

Leetcode_daily/
│
├── 0001-two-sum/
├── 0002-add-two-numbers/
├── 0003-longest-substring-without-repeating-characters/
├── ...
├── README.md
└── stats.json

Each problem folder contains:

Solution code
Problem title
Runtime
Memory usage
LeetHub metadata

🛠 Languages Used

Python
Java
C

📈 Progress

✅ Daily LeetCode Practice
✅ Easy Problems
✅ Medium Problems
✅ Hard Problems
✅ Interview Preparation

📚 Topics Covered

Arrays

Two Pointers
Prefix Sum
Sliding Window
Matrix

Strings

Hashing
Pattern Matching
Parsing

Linked List

Fast & Slow Pointer
Reversal
Cycle Detection

Stack & Queue

Monotonic Stack
Queue
Deque

Binary Search

Lower Bound
Upper Bound
Search Space

Trees

Binary Tree
BST
DFS
BFS

Graphs

DFS
BFS
Union Find
Topological Sort
Shortest Path

Dynamic Programming

1D DP
2D DP
Knapsack
LIS
Memoization

Greedy

Backtracking

Heap / Priority Queue

Bit Manipulation

Math

Recursion

🎯 Purpose

This repository serves as my:

📖 DSA Revision Notes
💼 Interview Preparation Archive
📈 Coding Progress Tracker

🌟 My Profiles

⭐ Support

If you find this repository useful,

⭐ Star the repository to support my journey!

📜 License

This repository is intended for learning and educational purposes.

LeetCode Topics

Depth-First Search


0133-clone-graph
2492-minimum-score-of-a-path-between-two-cities
2685-count-the-number-of-complete-components
3310-remove-methods-from-project

Breadth-First Search


0133-clone-graph
2492-minimum-score-of-a-path-between-two-cities
2685-count-the-number-of-complete-components
3310-remove-methods-from-project

Union-Find


2492-minimum-score-of-a-path-between-two-cities
2685-count-the-number-of-complete-components

Graph Theory


0133-clone-graph
2492-minimum-score-of-a-path-between-two-cities
2685-count-the-number-of-complete-components
3310-remove-methods-from-project

Hash Table


0133-clone-graph

Enumeration


1291-sequential-digits

Database


0175-combine-two-tables
0176-second-highest-salary
0178-rank-scores
0180-consecutive-numbers
0181-employees-earning-more-than-their-managers
0182-duplicate-emails
0183-customers-who-never-order
0184-department-highest-salary
0185-department-top-three-salaries

Name		Name	Last commit message	Last commit date
Latest commit History 520 Commits
0001-two-sum		0001-two-sum
0002-add-two-numbers		0002-add-two-numbers
0003-longest-substring-without-repeating-characters		0003-longest-substring-without-repeating-characters
0004-median-of-two-sorted-arrays		0004-median-of-two-sorted-arrays
0005-longest-palindromic-substring		0005-longest-palindromic-substring
0006-zigzag-conversion		0006-zigzag-conversion
0007-reverse-integer		0007-reverse-integer
0008-string-to-integer-atoi		0008-string-to-integer-atoi
0009-palindrome-number		0009-palindrome-number
0010-regular-expression-matching		0010-regular-expression-matching
0011-container-with-most-water		0011-container-with-most-water
0012-integer-to-roman		0012-integer-to-roman
0013-roman-to-integer		0013-roman-to-integer
0014-longest-common-prefix		0014-longest-common-prefix
0015-3sum		0015-3sum
0016-3sum-closest		0016-3sum-closest
0017-letter-combinations-of-a-phone-number		0017-letter-combinations-of-a-phone-number
0018-4sum		0018-4sum
0019-remove-nth-node-from-end-of-list		0019-remove-nth-node-from-end-of-list
0020-valid-parentheses		0020-valid-parentheses
0021-merge-two-sorted-lists		0021-merge-two-sorted-lists
0022-generate-parentheses		0022-generate-parentheses
0023-merge-k-sorted-lists		0023-merge-k-sorted-lists
0024-swap-nodes-in-pairs		0024-swap-nodes-in-pairs
0025-reverse-nodes-in-k-group		0025-reverse-nodes-in-k-group
0026-remove-duplicates-from-sorted-array		0026-remove-duplicates-from-sorted-array
0027-remove-element		0027-remove-element
0028-find-the-index-of-the-first-occurrence-in-a-string		0028-find-the-index-of-the-first-occurrence-in-a-string
0029-divide-two-integers		0029-divide-two-integers
0030-substring-with-concatenation-of-all-words		0030-substring-with-concatenation-of-all-words
0031-next-permutation		0031-next-permutation
0032-longest-valid-parentheses		0032-longest-valid-parentheses
0033-search-in-rotated-sorted-array		0033-search-in-rotated-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array		0034-find-first-and-last-position-of-element-in-sorted-array
0035-search-insert-position		0035-search-insert-position
0036-valid-sudoku		0036-valid-sudoku
0037-sudoku-solver		0037-sudoku-solver
0038-count-and-say		0038-count-and-say
0039-combination-sum		0039-combination-sum
0040-combination-sum-ii		0040-combination-sum-ii
0041-first-missing-positive		0041-first-missing-positive
0042-trapping-rain-water		0042-trapping-rain-water
0043-multiply-strings		0043-multiply-strings
0044-wildcard-matching		0044-wildcard-matching
0045-jump-game-ii		0045-jump-game-ii
0046-permutations		0046-permutations
0047-permutations-ii		0047-permutations-ii
0048-rotate-image		0048-rotate-image
0049-group-anagrams		0049-group-anagrams
0050-powx-n		0050-powx-n
0051-n-queens		0051-n-queens
0052-n-queens-ii		0052-n-queens-ii
0053-maximum-subarray		0053-maximum-subarray
0054-spiral-matrix		0054-spiral-matrix
0055-jump-game		0055-jump-game
0056-merge-intervals		0056-merge-intervals
0057-insert-interval		0057-insert-interval
0058-length-of-last-word		0058-length-of-last-word
0059-spiral-matrix-ii		0059-spiral-matrix-ii
0060-permutation-sequence		0060-permutation-sequence
0061-rotate-list		0061-rotate-list
0062-unique-paths		0062-unique-paths
0063-unique-paths-ii		0063-unique-paths-ii
0064-minimum-path-sum		0064-minimum-path-sum
0065-valid-number		0065-valid-number
0066-plus-one		0066-plus-one
0067-add-binary		0067-add-binary
0068-text-justification		0068-text-justification
0069-sqrtx		0069-sqrtx
0070-climbing-stairs		0070-climbing-stairs
0071-simplify-path		0071-simplify-path
0072-edit-distance		0072-edit-distance
0073-set-matrix-zeroes		0073-set-matrix-zeroes
0074-search-a-2d-matrix		0074-search-a-2d-matrix
0075-sort-colors		0075-sort-colors
0076-minimum-window-substring		0076-minimum-window-substring
0077-combinations		0077-combinations
0078-subsets		0078-subsets
0079-word-search		0079-word-search
0080-remove-duplicates-from-sorted-array-ii		0080-remove-duplicates-from-sorted-array-ii
0081-search-in-rotated-sorted-array-ii		0081-search-in-rotated-sorted-array-ii
0082-remove-duplicates-from-sorted-list-ii		0082-remove-duplicates-from-sorted-list-ii
0083-remove-duplicates-from-sorted-list		0083-remove-duplicates-from-sorted-list
0084-largest-rectangle-in-histogram		0084-largest-rectangle-in-histogram
0085-maximal-rectangle		0085-maximal-rectangle
0086-partition-list		0086-partition-list
0087-scramble-string		0087-scramble-string
0088-merge-sorted-array		0088-merge-sorted-array
0089-gray-code		0089-gray-code
0090-subsets-ii		0090-subsets-ii
0091-decode-ways		0091-decode-ways
0092-reverse-linked-list-ii		0092-reverse-linked-list-ii
0093-restore-ip-addresses		0093-restore-ip-addresses
0094-binary-tree-inorder-traversal		0094-binary-tree-inorder-traversal
0095-unique-binary-search-trees-ii		0095-unique-binary-search-trees-ii
0096-unique-binary-search-trees		0096-unique-binary-search-trees
0097-interleaving-string		0097-interleaving-string
0098-validate-binary-search-tree		0098-validate-binary-search-tree
0099-recover-binary-search-tree		0099-recover-binary-search-tree
0100-same-tree		0100-same-tree

Folders and files

Latest commit

History

Repository files navigation