Skip to content

/ leetcode

My leetcode solutions

3 stars 0 forks
Star
Watch
develop
2 branches 0 tags
Go to file
Code
Clone

Use Git or checkout with SVN using the web URL.

Latest commit

 

Git stats

Files

Permalink
Failed to load latest commit information.
Type
Name
Latest commit message
Commit time
problemset
 
 
.editorconfig
 
 
3sum-closest.js
 
 
3sum.java
 
 
3sum.js
 
 
README.md
 
 
add-binary.js
 
 
add-two-numbers.js
 
 
balanced-binary-tree.js
 
 
best-time-to-buy-and-sell-stock-ii.js
 
 
best-time-to-buy-and-sell-stock.js
 
 
binary-tree-inorder-traversal.js
 
 
binary-tree-level-order-traversal-ii.js
 
 
binary-tree-level-order-traversal.js
 
 
binary-tree-postorder-traversal.js
 
 
binary-tree-preorder-traversal.js
 
 
binary-tree-right-side-view.js
 
 
binary-tree-zigzag-level-order-traversal.js
 
 
climbing-stairs.js
 
 
clone-graph.js
 
 
combinations.js
 
 
compare-version-numbers.js
 
 
container-with-most-water.js
 
 
contains-duplicate.js
 
 
convert-sorted-array-to-binary-search-tree.js
 
 
convert-sorted-list-to-binary-search-tree.js
 
 
copy-list-with-random-pointer.js
 
 
count-and-say.js
 
 
count-complete-tree-nodes.js
 
 
count-primes.js
 
 
decode-ways.js
 
 
delete-node-in-a-linked-list.js
 
 
evaluate-reverse-polish-notation.js
 
 
excel-sheet-column-number.js
 
 
excel-sheet-column-title.js
 
 
factorial-trailing-zeroes.js
 
 
find-minimum-in-rotated-sorted-array-ii.js
 
 
find-minimum-in-rotated-sorted-array.js
 
 
first-bad-version.js
 
 
flatten-binary-tree-to-linked-list.js
 
 
generate-parentheses.js
 
 
happy-number.js
 
 
house-robber-ii.js
 
 
house-robber.js
 
 
insertion-sort-list.js
 
 
intersection-of-two-linked-lists.js
 
 
invert-binary-tree.js
 
 
isomorphic-strings.js
 
 
jump-game.js
 
 
kth-largest-element-in-an-array.js
 
 
length-of-last-word.js
 
 
letter-combinations-of-a-phone-number.js
 
 
linked-list-cycle-ii.js
 
 
linked-list-cycle.js
 
 
list-unsolved.sh
 
 
longest-common-prefix.js
 
 
longest-consecutive-sequence.js
 
 
lowest-common-ancestor-of-a-binary-search-tree.js
 
 
majority-element.js
 
 
maximum-depth-of-binary-tree.js
 
 
maximum-subarray.js
 
 
merge-k-sorted-lists.js
 
 
merge-sorted-array.js
 
 
merge-two-sorted-lists.js
 
 
minimum-depth-of-binary-tree.js
 
 
minimum-path-sum.js
 
 
move-zeroes.js
 
 
n-queens-ii.js
 
 
n-queens.js
 
 
number-of-1-bits.js
 
 
number-of-islands.js
 
 
package.json
 
 
palindrome-linked-list.js
 
 
partition-list.js
 
 
pascals-triangle-ii.js
 
 
pascals-triangle.js
 
 
path-sum-ii.js
 
 
path-sum.js
 
 
plus-one.js
 
 
populating-next-right-pointers-in-each-node-ii.js
 
 
populating-next-right-pointers-in-each-node.js
 
 
power-of-two.js
 
 
recover-binary-search-tree.js
 
 
remove-duplicates-from-sorted-array.js
 
 
remove-duplicates-from-sorted-list-ii.js
 
 
remove-duplicates-from-sorted-list.js
 
 
remove-element.js
 
 
remove-linked-list-elements.js
 
 
remove-nth-node-from-end-of-list.js
 
 
reorder-list.js
 
 
reverse-bits.js
 
 
reverse-integer.js
 
 
reverse-linked-list-ii.js
 
 
reverse-linked-list.js
 
 
reverse-nodes-in-k-group.js
 
 
reverse-words-in-a-string.js
 
 
rotate-array.js
 
 
rotate-image.js
 
 
rotate-list.js
 
 
same-tree.js
 
 
search-a-2d-matrix-ii.js
 
 
search-a-2d-matrix.js
 
 
search-for-a-range.js
 
 
search-in-rotated-sorted-array.js
 
 
search-insert-position.js
 
 
set-matrix-zeroes.js
 
 
simplify-path.js
 
 
single-number-ii.js
 
 
single-number.js
 
 
sort-colors.js
 
 
sort-list.js
 
 
spiral-matrix-ii.js
 
 
spiral-matrix.js
 
 
sqrtx.js
 
 
subsets.js
 
 
sum-root-to-leaf-numbers.js
 
 
summary-ranges.js
 
 
swap-nodes-in-pairs.js
 
 
symmetric-tree.js
 
 
triangle.js
 
 
two-sum.js
 
 
ugly-number.js
 
 
unique-binary-search-trees-ii.js
 
 
unique-binary-search-trees.js
 
 
unique-paths-ii.js
 
 
unique-paths.js
 
 
util.js
 
 
valid-palindrome.js
 
 
valid-parentheses.js
 
 
valid-sudoku.js
 
 
validate-binary-search-tree.js
 
 
zigzag-conversion.js
 
 

README.md

README

This is my repository for personal leetcode solutions. Most code should be written in Javascript, but other language might be used as well.

Abbreviation Naming

When trying to use multiple solutions towards one problem, the following abbrevations might be used as postfix.

Abbreviation Name
BS Binary Search
BT Backtracking
BFS Breadth-first Search
DC Divide and Conquer
DFS Depth-first Search
DP Dynamic Programming
GD Greedy
HM Hashmap

Note

To view unsolved problems locally, run sh ./list-unsolved.sh, or install this tampermonkey script if you prefer to view from website.

About

My leetcode solutions

Resources

Readme

Releases

No releases published

Packages

No packages published

Languages

You can’t perform that action at this time.