Repository navigation

Practice

Public

About

Collection of LeetCode questions to ace the coding interview!

0 stars

1 watching

Report repository

Name		Name	Last commit message	Last commit date
0001-two-sum		0001-two-sum
0002-add-two-numbers		0002-add-two-numbers
0011-container-with-most-water		0011-container-with-most-water
0019-remove-nth-node-from-end-of-list		0019-remove-nth-node-from-end-of-list
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
0039-combination-sum		0039-combination-sum
0042-trapping-rain-water		0042-trapping-rain-water
0051-n-queens		0051-n-queens
0053-maximum-subarray		0053-maximum-subarray
0054-spiral-matrix		0054-spiral-matrix
0062-unique-paths		0062-unique-paths
0063-unique-paths-ii		0063-unique-paths-ii
0064-minimum-path-sum		0064-minimum-path-sum
0070-climbing-stairs		0070-climbing-stairs
0072-edit-distance		0072-edit-distance
0078-subsets		0078-subsets
0079-word-search		0079-word-search
0083-remove-duplicates-from-sorted-list		0083-remove-duplicates-from-sorted-list
0094-binary-tree-inorder-traversal		0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree		0098-validate-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
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
0108-convert-sorted-array-to-binary-search-tree		0108-convert-sorted-array-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
0116-populating-next-right-pointers-in-each-node		0116-populating-next-right-pointers-in-each-node
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
0128-longest-consecutive-sequence		0128-longest-consecutive-sequence
0144-binary-tree-preorder-traversal		0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal		0145-binary-tree-postorder-traversal
0146-lru-cache		0146-lru-cache
0150-evaluate-reverse-polish-notation		0150-evaluate-reverse-polish-notation
0152-maximum-product-subarray		0152-maximum-product-subarray
0167-two-sum-ii-input-array-is-sorted		0167-two-sum-ii-input-array-is-sorted
0169-majority-element		0169-majority-element
0189-rotate-array		0189-rotate-array
0198-house-robber		0198-house-robber
0199-binary-tree-right-side-view		0199-binary-tree-right-side-view
0200-number-of-islands		0200-number-of-islands
0206-reverse-linked-list		0206-reverse-linked-list
0213-house-robber-ii		0213-house-robber-ii
0215-kth-largest-element-in-an-array		0215-kth-largest-element-in-an-array
0222-count-complete-tree-nodes		0222-count-complete-tree-nodes
0226-invert-binary-tree		0226-invert-binary-tree
0229-majority-element-ii		0229-majority-element-ii
0230-kth-smallest-element-in-a-bst		0230-kth-smallest-element-in-a-bst
0232-implement-queue-using-stacks		0232-implement-queue-using-stacks
0235-lowest-common-ancestor-of-a-binary-search-tree		0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree		0236-lowest-common-ancestor-of-a-binary-tree
0239-sliding-window-maximum		0239-sliding-window-maximum
0242-valid-anagram		0242-valid-anagram
0257-binary-tree-paths		0257-binary-tree-paths
0283-move-zeroes		0283-move-zeroes
0287-find-the-duplicate-number		0287-find-the-duplicate-number
0295-find-median-from-data-stream		0295-find-median-from-data-stream
0322-coin-change		0322-coin-change
0347-top-k-frequent-elements		0347-top-k-frequent-elements
0380-insert-delete-getrandom-o1		0380-insert-delete-getrandom-o1
0402-remove-k-digits		0402-remove-k-digits
0416-partition-equal-subset-sum		0416-partition-equal-subset-sum
0443-string-compression		0443-string-compression
0446-arithmetic-slices-ii-subsequence		0446-arithmetic-slices-ii-subsequence
0455-assign-cookies		0455-assign-cookies
0485-max-consecutive-ones		0485-max-consecutive-ones
0494-target-sum		0494-target-sum
0496-next-greater-element-i		0496-next-greater-element-i
0503-next-greater-element-ii		0503-next-greater-element-ii
0518-coin-change-ii		0518-coin-change-ii
0543-diameter-of-binary-tree		0543-diameter-of-binary-tree
0547-number-of-provinces		0547-number-of-provinces
0606-construct-string-from-binary-tree		0606-construct-string-from-binary-tree
0653-two-sum-iv-input-is-a-bst		0653-two-sum-iv-input-is-a-bst
0661-image-smoother		0661-image-smoother
0700-search-in-a-binary-search-tree		0700-search-in-a-binary-search-tree
0733-flood-fill		0733-flood-fill
0735-asteroid-collision		0735-asteroid-collision
0739-daily-temperatures		0739-daily-temperatures
0747-min-cost-climbing-stairs		0747-min-cost-climbing-stairs
0783-search-in-a-binary-search-tree		0783-search-in-a-binary-search-tree
0784-insert-into-a-binary-search-tree		0784-insert-into-a-binary-search-tree
0789-kth-largest-element-in-a-stream		0789-kth-largest-element-in-a-stream
0872-leaf-similar-trees		0872-leaf-similar-trees
0907-sum-of-subarray-minimums		0907-sum-of-subarray-minimums
0931-minimum-falling-path-sum		0931-minimum-falling-path-sum
0938-range-sum-of-bst		0938-range-sum-of-bst
0975-range-sum-of-bst		0975-range-sum-of-bst
0add-two-integers		0add-two-integers
0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence3-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div225-implement-stack-using-queues		0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence3-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div225-implement-stack-using-queues
0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divapple-divdiv-classcompanytagscontainer-tagoccurence4-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divfacebook-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divsalesforce-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div316-remove-duplicate-letters		0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divapple-divdiv-classcompanytagscontainer-tagoccurence4-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divfacebook-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divamazon-divdiv-classcompanytagscontainer-tagoccurence2-div-divdiv-classcompanytagscontainer-tag-stylebackground-color-rgba0-10-32-005-divsalesforce-divdiv-classcompanytagscontainer-tagoccurence2-div-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div316-remove-duplicate-letters
0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1081-smallest-subsequence-of-distinct-characters		0div-idbig-omega-company-tagsdiv-idbig-omega-topbardiv-classcompanytagscontainer-styleoverflow-x-scroll-flex-wrap-nowrap-div-classcompanytagscontainer-tagno-companies-found-for-this-problem-div-divdiv-classcompanytagscontainer-chevrondivsvg-version11-idicon-xmlnshttp-wwww3org-2000-svg-xmlns-xlinkhttp-wwww3org-1999-xlink-x0px-y0px-viewbox0-0-32-32-fill4087f1-xml-spacepreserve-stylewidth-20px-polygon-points16-22-6-12-74-106-16-192-246-106-26-12-polygonrect-id-x3c-transparent-rectangle-x3e-classst0-fillnone-width32-height32-rect-svg-div-div-div-div1081-smallest-subsequence-of-distinct-characters
0kth-missing-positive-number		0kth-missing-positive-number
0odd-even-linked-list		0odd-even-linked-list
1013-fibonacci-number		1013-fibonacci-number

Repository files navigation

Practice

Collection of LeetCode questions to ace the coding interview!

About

Collection of LeetCode questions to ace the coding interview!

0 stars

1 watching

Report repository

Releases

Packages

Contributors

Languages