GitHub - prashant-smart/Leetcode-Daily-Questions: Leetcode solutions !

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 1,124 Commits
0010-regular-expression-matching		0010-regular-expression-matching
0012-integer-to-roman		0012-integer-to-roman
0017-letter-combinations-of-a-phone-number		0017-letter-combinations-of-a-phone-number
0020-valid-parentheses		0020-valid-parentheses
0024-swap-nodes-in-pairs		0024-swap-nodes-in-pairs
0026-remove-duplicates-from-sorted-array		0026-remove-duplicates-from-sorted-array
0033-search-in-rotated-sorted-array		0033-search-in-rotated-sorted-array
0038-count-and-say		0038-count-and-say
0049-group-anagrams		0049-group-anagrams
0050-powx-n		0050-powx-n
0064-minimum-path-sum		0064-minimum-path-sum
0068-text-justification		0068-text-justification
0071-simplify-path		0071-simplify-path
0072-edit-distance		0072-edit-distance
0076-minimum-window-substring		0076-minimum-window-substring
0087-scramble-string		0087-scramble-string
0133-clone-graph		0133-clone-graph
0151-reverse-words-in-a-string		0151-reverse-words-in-a-string
0152-maximum-product-subarray		0152-maximum-product-subarray
0188-best-time-to-buy-and-sell-stock-iv		0188-best-time-to-buy-and-sell-stock-iv
0210-course-schedule-ii		0210-course-schedule-ii
0211-design-add-and-search-words-data-structure		0211-design-add-and-search-words-data-structure
0212-word-search-ii		0212-word-search-ii
0219-contains-duplicate-ii		0219-contains-duplicate-ii
0221-maximal-square		0221-maximal-square
0222-count-complete-tree-nodes		0222-count-complete-tree-nodes
0224-basic-calculator		0224-basic-calculator
0237-delete-node-in-a-linked-list		0237-delete-node-in-a-linked-list
0239-sliding-window-maximum		0239-sliding-window-maximum
0258-add-digits		0258-add-digits
0263-ugly-number		0263-ugly-number
0268-missing-number		0268-missing-number
0295-find-median-from-data-stream		0295-find-median-from-data-stream
0300-longest-increasing-subsequence		0300-longest-increasing-subsequence
0329-longest-increasing-path-in-a-matrix		0329-longest-increasing-path-in-a-matrix
0334-increasing-triplet-subsequence		0334-increasing-triplet-subsequence
0345-reverse-vowels-of-a-string		0345-reverse-vowels-of-a-string
0347-top-k-frequent-elements		0347-top-k-frequent-elements
0355-design-twitter		0355-design-twitter
0374-guess-number-higher-or-lower		0374-guess-number-higher-or-lower
0399-evaluate-division		0399-evaluate-division
0433-minimum-genetic-mutation		0433-minimum-genetic-mutation
0445-add-two-numbers-ii		0445-add-two-numbers-ii
0516-longest-palindromic-subsequence		0516-longest-palindromic-subsequence
0523-continuous-subarray-sum		0523-continuous-subarray-sum
0542-01-matrix		0542-01-matrix
0547-number-of-provinces		0547-number-of-provinces
0587-erect-the-fence		0587-erect-the-fence
0605-can-place-flowers		0605-can-place-flowers
0645-set-mismatch		0645-set-mismatch
0647-palindromic-substrings		0647-palindromic-substrings
0692-top-k-frequent-words		0692-top-k-frequent-words
0703-kth-largest-element-in-a-stream		0703-kth-largest-element-in-a-stream
0704-binary-search		0704-binary-search
0712-minimum-ascii-delete-sum-for-two-strings		0712-minimum-ascii-delete-sum-for-two-strings
0721-accounts-merge		0721-accounts-merge
0743-network-delay-time		0743-network-delay-time
0766-toeplitz-matrix		0766-toeplitz-matrix
0785-is-graph-bipartite		0785-is-graph-bipartite
0787-cheapest-flights-within-k-stops		0787-cheapest-flights-within-k-stops
0797-all-paths-from-source-to-target		0797-all-paths-from-source-to-target
0827-making-a-large-island		0827-making-a-large-island
0841-keys-and-rooms		0841-keys-and-rooms
0881-boats-to-save-people		0881-boats-to-save-people
0887-super-egg-drop		0887-super-egg-drop
0899-orderly-queue		0899-orderly-queue
0901-online-stock-span		0901-online-stock-span
0934-shortest-bridge		0934-shortest-bridge
0935-knight-dialer		0935-knight-dialer
0946-validate-stack-sequences		0946-validate-stack-sequences
0947-most-stones-removed-with-same-row-or-column		0947-most-stones-removed-with-same-row-or-column
0959-regions-cut-by-slashes		0959-regions-cut-by-slashes
0976-largest-perimeter-triangle		0976-largest-perimeter-triangle
0981-time-based-key-value-store		0981-time-based-key-value-store
0983-minimum-cost-for-tickets		0983-minimum-cost-for-tickets
0990-satisfiability-of-equality-equations		0990-satisfiability-of-equality-equations
1000-minimum-cost-to-merge-stones		1000-minimum-cost-to-merge-stones
1010-pairs-of-songs-with-total-durations-divisible-by-60		1010-pairs-of-songs-with-total-durations-divisible-by-60
1020-number-of-enclaves		1020-number-of-enclaves
1031-maximum-sum-of-two-non-overlapping-subarrays		1031-maximum-sum-of-two-non-overlapping-subarrays
1043-partition-array-for-maximum-sum		1043-partition-array-for-maximum-sum
1046-last-stone-weight		1046-last-stone-weight
1047-remove-all-adjacent-duplicates-in-string		1047-remove-all-adjacent-duplicates-in-string
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
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
1091-shortest-path-in-binary-matrix		1091-shortest-path-in-binary-matrix
112-path-sum		112-path-sum
113-path-sum-ii		113-path-sum-ii
1130-minimum-cost-tree-from-leaf-values		1130-minimum-cost-tree-from-leaf-values
114-flatten-binary-tree-to-linked-list		114-flatten-binary-tree-to-linked-list
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
1192-critical-connections-in-a-network		1192-critical-connections-in-a-network
12-integer-to-roman		12-integer-to-roman
120-triangle		120-triangle
1209-remove-all-adjacent-duplicates-in-string-ii		1209-remove-all-adjacent-duplicates-in-string-ii
1220-count-vowels-permutation		1220-count-vowels-permutation