techlism / LeetCode-Solutions Public

Notifications You must be signed in to change notification settings
Fork 1
Star 5

Solutions to the Problems that I do. Mostly LeetCode but bit of GeeksforGeeks also. Created using extension LeetHub

leetcode.com/techlism

License

MIT, MIT licenses found

Licenses found

5 stars 1 fork Branches Tags Activity

Star

Notifications

techlism/LeetCode-Solutions

Branches Tags

Folders and files

Name		Name	Last commit message	Last commit date
Latest commit History 1,571 Commits
0001-two-sum		0001-two-sum
0003-longest-substring-without-repeating-characters		0003-longest-substring-without-repeating-characters
0004-median-of-two-sorted-arrays		0004-median-of-two-sorted-arrays
0007-reverse-integer		0007-reverse-integer
0008-string-to-integer-atoi		0008-string-to-integer-atoi
0015-3sum		0015-3sum
0017-letter-combinations-of-a-phone-number		0017-letter-combinations-of-a-phone-number
0018-4sum		0018-4sum
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
0028-find-the-index-of-the-first-occurrence-in-a-string		0028-find-the-index-of-the-first-occurrence-in-a-string
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
0035-search-insert-position		0035-search-insert-position
0039-combination-sum		0039-combination-sum
0040-combination-sum-ii		0040-combination-sum-ii
0041-first-missing-positive		0041-first-missing-positive
0043-multiply-strings		0043-multiply-strings
0046-permutations		0046-permutations
0047-permutations-ii		0047-permutations-ii
0049-group-anagrams		0049-group-anagrams
0050-powx-n		0050-powx-n
0053-maximum-subarray		0053-maximum-subarray
0056-merge-intervals		0056-merge-intervals
0057-insert-interval		0057-insert-interval
0058-length-of-last-word		0058-length-of-last-word
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
0066-plus-one		0066-plus-one
0067-add-binary		0067-add-binary
0070-climbing-stairs		0070-climbing-stairs
0073-set-matrix-zeroes		0073-set-matrix-zeroes
0074-search-a-2d-matrix		0074-search-a-2d-matrix
0075-sort-colors		0075-sort-colors
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
0084-largest-rectangle-in-histogram		0084-largest-rectangle-in-histogram
0086-partition-list		0086-partition-list
0088-merge-sorted-array		0088-merge-sorted-array
0090-subsets-ii		0090-subsets-ii
0092-reverse-linked-list-ii		0092-reverse-linked-list-ii
0094-binary-tree-inorder-traversal		0094-binary-tree-inorder-traversal
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
0101-symmetric-tree		0101-symmetric-tree
0102-binary-tree-level-order-traversal		0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal		0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree		0104-maximum-depth-of-binary-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversal		0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal		0106-construct-binary-tree-from-inorder-and-postorder-traversal
0107-binary-tree-level-order-traversal-ii		0107-binary-tree-level-order-traversal-ii
0108-convert-sorted-array-to-binary-search-tree		0108-convert-sorted-array-to-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree		0109-convert-sorted-list-to-binary-search-tree
0110-balanced-binary-tree		0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree		0111-minimum-depth-of-binary-tree
0112-path-sum		0112-path-sum
0113-path-sum-ii		0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list		0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node		0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii		0117-populating-next-right-pointers-in-each-node-ii
0118-pascals-triangle		0118-pascals-triangle
0121-best-time-to-buy-and-sell-stock		0121-best-time-to-buy-and-sell-stock
0124-binary-tree-maximum-path-sum		0124-binary-tree-maximum-path-sum
0125-valid-palindrome		0125-valid-palindrome
0129-sum-root-to-leaf-numbers		0129-sum-root-to-leaf-numbers
0131-palindrome-partitioning		0131-palindrome-partitioning
0133-clone-graph		0133-clone-graph
0137-single-number-ii		0137-single-number-ii
0141-linked-list-cycle		0141-linked-list-cycle
0142-linked-list-cycle-ii		0142-linked-list-cycle-ii
0143-reorder-list		0143-reorder-list
0144-binary-tree-preorder-traversal		0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal		0145-binary-tree-postorder-traversal
0149-max-points-on-a-line		0149-max-points-on-a-line
0151-reverse-words-in-a-string		0151-reverse-words-in-a-string
0152-maximum-product-subarray		0152-maximum-product-subarray
0153-find-minimum-in-rotated-sorted-array		0153-find-minimum-in-rotated-sorted-array
0154-find-minimum-in-rotated-sorted-array-ii		0154-find-minimum-in-rotated-sorted-array-ii
0160-intersection-of-two-linked-lists		0160-intersection-of-two-linked-lists
0162-find-peak-element		0162-find-peak-element
0164-maximum-gap		0164-maximum-gap
0165-compare-version-numbers		0165-compare-version-numbers
0167-two-sum-ii-input-array-is-sorted		0167-two-sum-ii-input-array-is-sorted
0169-majority-element		0169-majority-element
0171-excel-sheet-column-number		0171-excel-sheet-column-number
0173-binary-search-tree-iterator		0173-binary-search-tree-iterator
0175-combine-two-tables		0175-combine-two-tables

Repository files navigation

LeetCode-Solutions

Collection of LeetCode questions that I solve.
P.S. Now solutions from GFG (geeksforgeeks) is also supported.

Created using LeetHub

About

Solutions to the Problems that I do. Mostly LeetCode but bit of GeeksforGeeks also. Created using extension LeetHub

leetcode.com/techlism

Topics

github rust leetcode learn leetcode-solutions leetcode-cpp geeksforgeeks-solutions leetcode-rust gfg-cpp communityexchange

Resources

Readme

License

MIT, MIT licenses found

Releases

No releases published

Packages

No packages published

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

License

Licenses found

Uh oh!

techlism/LeetCode-Solutions

Folders and files

Latest commit

History

Repository files navigation

LeetCode-Solutions

About

Topics

Resources

License

Licenses found

Uh oh!

Stars

Watchers

Forks

Releases

Packages

Languages

License

Licenses found

techlism/LeetCode-Solutions

Folders and files

Latest commit

History

Repository files navigation

LeetCode-Solutions

About

Topics

Resources

License

Licenses found

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages