README.md

GoLeet

My collection of leet code problems solved in GoLang!

Link to profile, bhargavsnv100

Easy	Medium	Hard
53	89	19

Problems finished

Easy

• average-of-levels-in-binary-tree.md
• backspace-string-compare.md
• best-time-to-buy-and-sell-stock.md
• binary-tree-level-order-traversal-ii.md
• binary-tree-paths.md
• can-place-flowers.md
• check-if-two-string-arrays-are-equivalent.md
• climbing-stairs.md
• convert-binary-number-in-linked-list-to-integer.md
• find-the-town-judge.md
• flipping-an-image.md
• goat-latin.md
• implement-strstr.md
• increasing-order-search-tree.md
• isomorphic-strings.md
• kth-missing-positive-number.md
• length-of-last-word.md
• license-key-formatting.md
• longest-common-prefix.md
• lowest-common-ancestor-of-a-binary-search-tree.md
• majority-element.md
• max-consecutive-ones.md
• maximum-ascending-subarray-sum.md
• maximum-depth-of-binary-tree.md
• maximum-depth-of-n-ary-tree.md
• maximum-subarray.md
• merge-sorted-array.md
• merge-two-sorted-lists.md
• minimum-depth-of-binary-tree.md
• palindrome-number.md
• pascals-triangle-ii.md
• pascals-triangle.md
• path-sum.md
• range-sum-of-bst.md
• remove-all-adjacent-duplicates-in-string.md
• remove-duplicates-from-sorted-array.md
• remove-duplicates-from-sorted-list.md
• remove-element.md
• reshape-the-matrix.md
• reverse-integer.md
• reverse-linked-list.md
• reverse-string.md
• roman-to-int.md
• squares-of-a-sorted-array.md
• symmetric-tree.md
• tenth-line.md
• trim-a-binary-search-tree.md
• two-sum-ii-input-array-is-sorted.md
• two-sum.md
• unique-morse-code-words.md
• valid-mountain-array.md
• valid-parentheses.md
• valid-phone-numbers.md

Medium

• 3sum-closest.md
• 3sum.md
• 4sum-ii.md
• 4sum.md
• add-two-numbers.md
• binary-tree-inorder-traversal.md
• binary-tree-level-order-traversal.md
• binary-tree-postorder-traversal.md
• binary-tree-preorder-traversal.md
• binary-tree-pruning.md
• boats-to-save-people.md
• clone-graph.md
• container-with-most-water.md
• count-servers-that-communicate.md
• course-schedule-ii.md
• course-schedule.md
• custom-sort-string.md
• decode-string.md
• decoded-string-at-index.md
• diagonal-traverse.md
• domino-and-tromino-tiling.md
• evaluate-reverse-polish-notation.md
• find-k-closest-elements.md
• find-peak-element.md
• find-the-most-competitive-subsequence.md
• game-of-life.md
• gray-code.md
• increasing-triplet-subsequence.md
• integer-to-roman.md
• kth-largest-element-in-an-array.md
• kth-smallest-element-in-a-sorted-matrix.md
• letter-combinations-of-a-phone-number.md
• linked-list-random-node.md
• longest-absolute-file-path.md
• longest-increasing-subsequence.md
• longest-mountain-in-array.md
• longest-palindromic-substring.md
• longest-substring-without-repeating-characters.md
• lowest-common-ancestor-of-a-binary-tree.md
• lowest-common-ancestor-of-deepest-leaves.md
• max-consecutive-ones-iii.md
• max-number-of-k-sum-pairs.md
• maximal-network-rank.md
• maximum-length-of-repeated-subarray.md
• merge-intervals.md
• minimum-height-trees.md
• mirror-reflection.md
• multiply-strings.md
• network-delay-time.md
• number-of-matching-subsequences.md
• out-of-boundary-paths.md
• pairs-of-songs-with-total-durations-divisible-by-60.md
• partition-array-into-disjoint-intervals.md
• path-sum-ii.md
• path-sum-iii.md
• populating-next-right-pointers-in-each-node-ii.md
• populating-next-right-pointers-in-each-node.md
• pseudo-palindromic-paths-in-a-binary-tree.md
• push-dominoes.md
• range-sum-query-2d-immutable.md
• reduce-array-size-to-the-half.md
• redundant-connection.md
• remove-comments.md
• remove-duplicates-from-sorted-array-ii.md
• remove-duplicates-from-sorted-list-ii.md
• remove-nth-node-from-end-of-list.md
• restore-ip-addresses.md
• reverse-linked-list-ii.md
• rotate-image.md
• same-tree.md
• search-in-rotated-sorted-array-ii.md
• search-in-rotated-sorted-array.md
• shuffle-array.md
• simplify-path.md
• smallest-range-ii.md
• smallest-subtree-with-all-the-deepest-nodes.md
• sort-the-matrix-diagonally.md
• string-to-integer-atoi.md
• subarray-sum-equals-k.md
• sum-root-to-leaf-numbers.md
• swap-nodes-in-pairs.md
• the-kth-factor-of-n.md
• top-k-frequent-elements.md
• valid-sudoku.md
• valid-triangle-number.md
• validate-binary-search-tree.md
• validate-binary-tree-nodes.md
• word-frequency.md
• zigzag-conversion.md

Hard

• binary-tree-maximum-path-sum.md
• candy.md
• closest-subsequence-sum.md
• count-vowels-permutation.md
• create-sorted-array-through-instructions.md
• decode-ways-ii.md
• find-median-from-data-stream.md
• k-similar-strings.md
• longest-valid-parenthesis.md
• median-of-two-sorted-array.md
• merge-k-sorted-lists.md
• poor-pigs.md
• recover-binary-search-tree.md
• regular-expression-matching.md
• reverse-nodes-in-k-group.md
• sliding-window-maximum.md
• the-skyline-problem.md
• trapping-rain-water.md
• vertical-order-traversal-of-a-binary-tree.md