GitHub - harshubhatnagar/Leetcode-DSA: Leetcode solution to the problem that I have solved in past and solution that I am going to solve on daily basis

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 292 Commits
0005-longest-palindromic-substring		0005-longest-palindromic-substring
0012-integer-to-roman		0012-integer-to-roman
0038-count-and-say		0038-count-and-say
0049-group-anagrams		0049-group-anagrams
0076-minimum-window-substring		0076-minimum-window-substring
0100-same-tree		0100-same-tree
0219-contains-duplicate-ii		0219-contains-duplicate-ii
0237-delete-node-in-a-linked-list		0237-delete-node-in-a-linked-list
0334-increasing-triplet-subsequence		0334-increasing-triplet-subsequence
0443-string-compression		0443-string-compression
0523-continuous-subarray-sum		0523-continuous-subarray-sum
0645-set-mismatch		0645-set-mismatch
0692-top-k-frequent-words		0692-top-k-frequent-words
0766-toeplitz-matrix		0766-toeplitz-matrix
0976-largest-perimeter-triangle		0976-largest-perimeter-triangle
1-two-sum		1-two-sum
102-binary-tree-level-order-traversal		102-binary-tree-level-order-traversal
1046-last-stone-weight		1046-last-stone-weight
112-path-sum		112-path-sum
113-path-sum-ii		113-path-sum-ii
1155-number-of-dice-rolls-with-target-sum		1155-number-of-dice-rolls-with-target-sum
116-populating-next-right-pointers-in-each-node		116-populating-next-right-pointers-in-each-node
118-pascals-triangle		118-pascals-triangle
121-best-time-to-buy-and-sell-stock		121-best-time-to-buy-and-sell-stock
1239-maximum-length-of-a-concatenated-string-with-unique-characters		1239-maximum-length-of-a-concatenated-string-with-unique-characters
1293-shortest-path-in-a-grid-with-obstacles-elimination		1293-shortest-path-in-a-grid-with-obstacles-elimination
1328-break-a-palindrome		1328-break-a-palindrome
1335-minimum-difficulty-of-a-job-schedule		1335-minimum-difficulty-of-a-job-schedule
1383-maximum-performance-of-a-team		1383-maximum-performance-of-a-team
141-linked-list-cycle		141-linked-list-cycle
142-linked-list-cycle-ii		142-linked-list-cycle-ii
1457-pseudo-palindromic-paths-in-a-binary-tree		1457-pseudo-palindromic-paths-in-a-binary-tree
1531-string-compression-ii		1531-string-compression-ii
1578-minimum-time-to-make-rope-colorful		1578-minimum-time-to-make-rope-colorful
16-3sum-closest		16-3sum-closest
1662-check-if-two-string-arrays-are-equivalent		1662-check-if-two-string-arrays-are-equivalent
1680-concatenation-of-consecutive-binary-numbers		1680-concatenation-of-consecutive-binary-numbers
1770-maximum-score-from-performing-multiplication-operations		1770-maximum-score-from-performing-multiplication-operations
1832-check-if-the-sentence-is-pangram		1832-check-if-the-sentence-is-pangram
1844-replace-all-digits-with-characters		1844-replace-all-digits-with-characters
188-best-time-to-buy-and-sell-stock-iv		188-best-time-to-buy-and-sell-stock-iv
19-remove-nth-node-from-end-of-list		19-remove-nth-node-from-end-of-list
1996-the-number-of-weak-characters-in-the-game		1996-the-number-of-weak-characters-in-the-game
2-add-two-numbers		2-add-two-numbers
20-valid-parentheses		20-valid-parentheses
200-number-of-islands		200-number-of-islands
2007-find-original-array-from-doubled-array		2007-find-original-array-from-doubled-array
203-remove-linked-list-elements		203-remove-linked-list-elements
206-reverse-linked-list		206-reverse-linked-list
2095-delete-the-middle-node-of-a-linked-list		2095-delete-the-middle-node-of-a-linked-list
21-merge-two-sorted-lists		21-merge-two-sorted-lists
218-the-skyline-problem		218-the-skyline-problem
235-lowest-common-ancestor-of-a-binary-search-tree		235-lowest-common-ancestor-of-a-binary-search-tree
242-valid-anagram		242-valid-anagram
278-first-bad-version		278-first-bad-version
299-bulls-and-cows		299-bulls-and-cows
3-longest-substring-without-repeating-characters		3-longest-substring-without-repeating-characters
336-palindrome-pairs		336-palindrome-pairs
349-intersection-of-two-arrays		349-intersection-of-two-arrays
350-intersection-of-two-arrays-ii		350-intersection-of-two-arrays-ii
36-valid-sudoku		36-valid-sudoku
383-ransom-note		383-ransom-note
393-utf-8-validation		393-utf-8-validation
394-decode-string		394-decode-string
4-median-of-two-sorted-arrays		4-median-of-two-sorted-arrays
409-longest-palindrome		409-longest-palindrome
412-fizz-buzz		412-fizz-buzz
42-trapping-rain-water		42-trapping-rain-water
424-longest-repeating-character-replacement		424-longest-repeating-character-replacement
429-n-ary-tree-level-order-traversal		429-n-ary-tree-level-order-traversal
438-find-all-anagrams-in-a-string		438-find-all-anagrams-in-a-string
46-permutations		46-permutations
509-fibonacci-number		509-fibonacci-number
542-01-matrix		542-01-matrix
557-reverse-words-in-a-string-iii		557-reverse-words-in-a-string-iii
566-reshape-the-matrix		566-reshape-the-matrix
567-permutation-in-string		567-permutation-in-string
589-n-ary-tree-preorder-traversal		589-n-ary-tree-preorder-traversal
606-construct-string-from-binary-tree		606-construct-string-from-binary-tree
609-find-duplicate-file-in-system		609-find-duplicate-file-in-system
617-merge-two-binary-trees		617-merge-two-binary-trees
62-unique-paths		62-unique-paths
622-design-circular-queue		622-design-circular-queue
623-add-one-row-to-tree		623-add-one-row-to-tree
653-two-sum-iv-input-is-a-bst		653-two-sum-iv-input-is-a-bst
658-find-k-closest-elements		658-find-k-closest-elements
692-top-k-frequent-words		692-top-k-frequent-words
695-max-area-of-island		695-max-area-of-island
70-climbing-stairs		70-climbing-stairs
704-binary-search		704-binary-search
718-maximum-length-of-repeated-subarray		718-maximum-length-of-repeated-subarray
732-my-calendar-iii		732-my-calendar-iii
733-flood-fill		733-flood-fill
74-search-a-2d-matrix		74-search-a-2d-matrix
746-min-cost-climbing-stairs		746-min-cost-climbing-stairs
77-combinations		77-combinations
814-binary-tree-pruning		814-binary-tree-pruning
83-remove-duplicates-from-sorted-list		83-remove-duplicates-from-sorted-list
838-push-dominoes		838-push-dominoes
844-backspace-string-compare		844-backspace-string-compare