GitHub - harsharma30/LeetCode_Coding_Practice: This repository contains my solutions to various coding challenges from LeetCode. The problems cover a wide range of data structures and algorithms, including arrays, linked lists, trees, graphs, dynamic programming, and more.

📂 LeetCode Progress

🔹 Easy Problems

✅ Two Sum ✅ Reverse Linked List ✅ Valid Parentheses

🔸 Medium Problems

✅ Add Two Numbers ✅ Longest Substring Without Repeating Characters

🔥 Hard Problems

❌ Median of Two Sorted Arrays ❌ Trapping Rain Water

Name		Name	Last commit message	Last commit date
Latest commit History 824 Commits
.github/workflows		.github/workflows
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
0021-merge-two-sorted-lists		0021-merge-two-sorted-lists
0029-divide-two-integers		0029-divide-two-integers
0042-trapping-rain-water		0042-trapping-rain-water
0043-multiply-strings		0043-multiply-strings
0145-binary-tree-postorder-traversal		0145-binary-tree-postorder-traversal
0175-combine-two-tables		0175-combine-two-tables
0179-largest-number		0179-largest-number
0214-shortest-palindrome		0214-shortest-palindrome
0241-different-ways-to-add-parentheses		0241-different-ways-to-add-parentheses
0386-lexicographical-numbers		0386-lexicographical-numbers
0432-all-oone-data-structure		0432-all-oone-data-structure
0440-k-th-smallest-in-lexicographical-order		0440-k-th-smallest-in-lexicographical-order
0494-target-sum		0494-target-sum
0515-find-largest-value-in-each-tree-row		0515-find-largest-value-in-each-tree-row
0539-minimum-time-difference		0539-minimum-time-difference
0567-permutation-in-string		0567-permutation-in-string
0590-n-ary-tree-postorder-traversal		0590-n-ary-tree-postorder-traversal
0632-smallest-range-covering-elements-from-k-lists		0632-smallest-range-covering-elements-from-k-lists
0641-design-circular-deque		0641-design-circular-deque
0670-maximum-swap		0670-maximum-swap
0729-my-calendar-i		0729-my-calendar-i
0731-my-calendar-ii		0731-my-calendar-ii
0769-max-chunks-to-make-sorted		0769-max-chunks-to-make-sorted
0773-sliding-puzzle		0773-sliding-puzzle
0796-rotate-string		0796-rotate-string
0862-shortest-subarray-with-sum-at-least-k		0862-shortest-subarray-with-sum-at-least-k
0874-walking-robot-simulation		0874-walking-robot-simulation
0884-uncommon-words-from-two-sentences		0884-uncommon-words-from-two-sentences
0921-minimum-add-to-make-parentheses-valid		0921-minimum-add-to-make-parentheses-valid
0947-most-stones-removed-with-same-row-or-column		0947-most-stones-removed-with-same-row-or-column
0951-flip-equivalent-binary-trees		0951-flip-equivalent-binary-trees
0962-maximum-width-ramp		0962-maximum-width-ramp
0992-subarrays-with-k-different-integers		0992-subarrays-with-k-different-integers
100-same-tree		100-same-tree
1013-fibonacci-number		1013-fibonacci-number
1019-squares-of-a-sorted-array		1019-squares-of-a-sorted-array
102-binary-tree-level-order-traversal		102-binary-tree-level-order-traversal
1025-minimum-cost-for-tickets		1025-minimum-cost-for-tickets
1072-flip-columns-for-maximum-number-of-equal-rows		1072-flip-columns-for-maximum-number-of-equal-rows
1093-recover-a-tree-from-preorder-traversal		1093-recover-a-tree-from-preorder-traversal
1106-parsing-a-boolean-expression		1106-parsing-a-boolean-expression
1160-letter-tile-possibilities		1160-letter-tile-possibilities
1170-shortest-common-supersequence		1170-shortest-common-supersequence
121-best-time-to-buy-and-sell-stock		121-best-time-to-buy-and-sell-stock
1218-lowest-common-ancestor-of-deepest-leaves		1218-lowest-common-ancestor-of-deepest-leaves
1233-remove-sub-folders-from-the-filesystem		1233-remove-sub-folders-from-the-filesystem
1277-count-square-submatrices-with-all-ones		1277-count-square-submatrices-with-all-ones
1302-delete-characters-to-make-fancy-string		1302-delete-characters-to-make-fancy-string
1331-rank-transform-of-an-array		1331-rank-transform-of-an-array
1335-maximum-candies-allocated-to-k-children		1335-maximum-candies-allocated-to-k-children
1346-check-if-n-and-its-double-exist		1346-check-if-n-and-its-double-exist
136-single-number		136-single-number
1364-tuple-with-same-product		1364-tuple-with-same-product
1367-linked-list-in-binary-tree		1367-linked-list-in-binary-tree
1371-find-the-longest-substring-containing-vowels-in-even-counts		1371-find-the-longest-substring-containing-vowels-in-even-counts
1381-design-a-stack-with-increment-operation		1381-design-a-stack-with-increment-operation
1387-find-elements-in-a-contaminated-binary-tree		1387-find-elements-in-a-contaminated-binary-tree
1396-count-servers-that-communicate		1396-count-servers-that-communicate
1405-longest-happy-string		1405-longest-happy-string
141-linked-list-cycle		141-linked-list-cycle
142-linked-list-cycle-ii		142-linked-list-cycle-ii
1421-find-numbers-with-even-number-of-digits		1421-find-numbers-with-even-number-of-digits
144-binary-tree-preorder-traversal		144-binary-tree-preorder-traversal
145-binary-tree-postorder-traversal		145-binary-tree-postorder-traversal
1455-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence		1455-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence
1460-number-of-substrings-containing-all-three-characters		1460-number-of-substrings-containing-all-three-characters
1475-final-prices-with-a-special-discount-in-a-shop		1475-final-prices-with-a-special-discount-in-a-shop
1477-product-of-the-last-k-numbers		1477-product-of-the-last-k-numbers
1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid		1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid
1497-check-if-array-pairs-are-divisible-by-k		1497-check-if-array-pairs-are-divisible-by-k
1500-count-largest-group		1500-count-largest-group
1514-path-with-maximum-probability		1514-path-with-maximum-probability
1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n		1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n
1524-string-matching-in-an-array		1524-string-matching-in-an-array
1528-kids-with-the-greatest-number-of-candies		1528-kids-with-the-greatest-number-of-candies
1537-maximum-score-after-splitting-a-string		1537-maximum-score-after-splitting-a-string
1545-find-kth-bit-in-nth-binary-string		1545-find-kth-bit-in-nth-binary-string
1558-course-schedule-iv		1558-course-schedule-iv
1574-shortest-subarray-to-be-removed-to-make-array-sorted		1574-shortest-subarray-to-be-removed-to-make-array-sorted
1580-shuffle-the-array		1580-shuffle-the-array
1590-make-sum-divisible-by-p		1590-make-sum-divisible-by-p

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

📂 LeetCode Progress

About

Releases

Packages

Used by

Contributors

Languages

Folders and files

Latest commit

History

Repository files navigation

📂 LeetCode Progress

About

Resources

Stars

Watchers

Forks

Releases

Packages

Used by

Contributors

Languages