leetcode-solution-with-shanawaz

Collection of LeetCode questions to ace the coding interview! - Created using LeetHub.

Name		Name	Last commit message	Last commit date
Latest commit History 1,743 Commits
0 - 1 Knapsack Problem - GFG		0 - 1 Knapsack Problem - GFG
0012-integer-to-roman		0012-integer-to-roman
0038-count-and-say		0038-count-and-say
0049-group-anagrams		0049-group-anagrams
0130-surrounded-regions		0130-surrounded-regions
0207-course-schedule		0207-course-schedule
0210-course-schedule-ii		0210-course-schedule-ii
0237-delete-node-in-a-linked-list		0237-delete-node-in-a-linked-list
0433-minimum-genetic-mutation		0433-minimum-genetic-mutation
0523-continuous-subarray-sum		0523-continuous-subarray-sum
0542-01-matrix		0542-01-matrix
0645-set-mismatch		0645-set-mismatch
0692-top-k-frequent-words		0692-top-k-frequent-words
0695-max-area-of-island		0695-max-area-of-island
0766-toeplitz-matrix		0766-toeplitz-matrix
0835-image-overlap		0835-image-overlap
0841-keys-and-rooms		0841-keys-and-rooms
0847-shortest-path-visiting-all-nodes		0847-shortest-path-visiting-all-nodes
0886-possible-bipartition		0886-possible-bipartition
0976-largest-perimeter-triangle		0976-largest-perimeter-triangle
0994-rotting-oranges		0994-rotting-oranges
1-two-sum		1-two-sum
100-same-tree		100-same-tree
1007-minimum-domino-rotations-for-equal-row		1007-minimum-domino-rotations-for-equal-row
1008-construct-binary-search-tree-from-preorder-traversal		1008-construct-binary-search-tree-from-preorder-traversal
101-symmetric-tree		101-symmetric-tree
102-binary-tree-level-order-traversal		102-binary-tree-level-order-traversal
1020-number-of-enclaves		1020-number-of-enclaves
1022-sum-of-root-to-leaf-binary-numbers		1022-sum-of-root-to-leaf-binary-numbers
1029-two-city-scheduling		1029-two-city-scheduling
103-binary-tree-zigzag-level-order-traversal		103-binary-tree-zigzag-level-order-traversal
104-maximum-depth-of-binary-tree		104-maximum-depth-of-binary-tree
1046-last-stone-weight		1046-last-stone-weight
1048-longest-string-chain		1048-longest-string-chain
105-construct-binary-tree-from-preorder-and-inorder-traversal		105-construct-binary-tree-from-preorder-and-inorder-traversal
106-construct-binary-tree-from-inorder-and-postorder-traversal		106-construct-binary-tree-from-inorder-and-postorder-traversal
107-binary-tree-level-order-traversal-ii		107-binary-tree-level-order-traversal-ii
1074-number-of-submatrices-that-sum-to-target		1074-number-of-submatrices-that-sum-to-target
108-convert-sorted-array-to-binary-search-tree		108-convert-sorted-array-to-binary-search-tree
1080-insufficient-nodes-in-root-to-leaf-paths		1080-insufficient-nodes-in-root-to-leaf-paths
1091-shortest-path-in-binary-matrix		1091-shortest-path-in-binary-matrix
1092-shortest-common-supersequence		1092-shortest-common-supersequence
11-container-with-most-water		11-container-with-most-water
110-balanced-binary-tree		110-balanced-binary-tree
111-minimum-depth-of-binary-tree		111-minimum-depth-of-binary-tree
112-path-sum		112-path-sum
113-path-sum-ii		113-path-sum-ii
1137-n-th-tribonacci-number		1137-n-th-tribonacci-number
114-flatten-binary-tree-to-linked-list		114-flatten-binary-tree-to-linked-list
1143-longest-common-subsequence		1143-longest-common-subsequence
115-distinct-subsequences		115-distinct-subsequences
1155-number-of-dice-rolls-with-target-sum		1155-number-of-dice-rolls-with-target-sum
1162-as-far-from-land-as-possible		1162-as-far-from-land-as-possible
118-pascals-triangle		118-pascals-triangle
120-triangle		120-triangle
1202-smallest-string-with-swaps		1202-smallest-string-with-swaps
1207-unique-number-of-occurrences		1207-unique-number-of-occurrences
121-best-time-to-buy-and-sell-stock		121-best-time-to-buy-and-sell-stock
122-best-time-to-buy-and-sell-stock-ii		122-best-time-to-buy-and-sell-stock-ii
1220-count-vowels-permutation		1220-count-vowels-permutation
123-best-time-to-buy-and-sell-stock-iii		123-best-time-to-buy-and-sell-stock-iii
1239-maximum-length-of-a-concatenated-string-with-unique-characters		1239-maximum-length-of-a-concatenated-string-with-unique-characters
124-binary-tree-maximum-path-sum		124-binary-tree-maximum-path-sum
1249-minimum-remove-to-make-valid-parentheses		1249-minimum-remove-to-make-valid-parentheses
1254-number-of-closed-islands		1254-number-of-closed-islands
1260-shift-2d-grid		1260-shift-2d-grid
1268-search-suggestions-system		1268-search-suggestions-system
127-word-ladder		127-word-ladder
128-longest-consecutive-sequence		128-longest-consecutive-sequence
1288-remove-covered-intervals		1288-remove-covered-intervals
1289-minimum-falling-path-sum-ii		1289-minimum-falling-path-sum-ii
129-sum-root-to-leaf-numbers		129-sum-root-to-leaf-numbers
1293-shortest-path-in-a-grid-with-obstacles-elimination		1293-shortest-path-in-a-grid-with-obstacles-elimination
13-roman-to-integer		13-roman-to-integer
1302-deepest-leaves-sum		1302-deepest-leaves-sum
1312-minimum-insertion-steps-to-make-a-string-palindrome		1312-minimum-insertion-steps-to-make-a-string-palindrome
133-clone-graph		133-clone-graph
1332-remove-palindromic-subsequences		1332-remove-palindromic-subsequences
1335-minimum-difficulty-of-a-job-schedule		1335-minimum-difficulty-of-a-job-schedule
1337-the-k-weakest-rows-in-a-matrix		1337-the-k-weakest-rows-in-a-matrix
135-candy		135-candy
1354-construct-target-array-with-multiple-sums		1354-construct-target-array-with-multiple-sums
1359-count-all-valid-pickup-and-delivery-options		1359-count-all-valid-pickup-and-delivery-options
136-single-number		136-single-number
1367-linked-list-in-binary-tree		1367-linked-list-in-binary-tree
1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree		1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree
138-copy-list-with-random-pointer		138-copy-list-with-random-pointer
1383-maximum-performance-of-a-team		1383-maximum-performance-of-a-team
1396-design-underground-system		1396-design-underground-system
141-linked-list-cycle		141-linked-list-cycle
1423-maximum-points-you-can-obtain-from-cards		1423-maximum-points-you-can-obtain-from-cards
144-binary-tree-preorder-traversal		144-binary-tree-preorder-traversal
1448-count-good-nodes-in-binary-tree		1448-count-good-nodes-in-binary-tree
145-binary-tree-postorder-traversal		145-binary-tree-postorder-traversal
1457-pseudo-palindromic-paths-in-a-binary-tree		1457-pseudo-palindromic-paths-in-a-binary-tree
1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts		1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts
1473-paint-house-iii		1473-paint-house-iii
148-sort-list		148-sort-list
1480-running-sum-of-1d-array		1480-running-sum-of-1d-array
1531-string-compression-ii		1531-string-compression-ii

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

leetcode-solution-with-shanawaz

About

Releases

Packages

Languages

123shanawaz/leetcode-solution-with-shanawaz

Folders and files

Latest commit

History

Repository files navigation

leetcode-solution-with-shanawaz

About

Resources

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages