solutions-leetcode-hackerrank

module

v0.0.0-...-60194e6 Latest Latest Go to latest Published: Dec 9, 2020 License: Unlicense

Details

Valid go.mod file
Redistributable license
Tagged version
Stable version
Learn more about best practices

Repository

github.com/tannineo/solutions-leetcode-hackerrank

Links

Open Source Insights

README ¶

algorithm-solutions

orz

algorithm-solutions

LeetCode

lodash is available for js:

use _ for lodash
https://support.leetcode.com/hc/en-us/articles/360011833974-What-are-the-environments-for-the-programming-languages-

LeetCode problem routes reference:

Leetcode Explore
Huahua's Blog: https://zxi.mytechroad.com/blog/
- the blog have:
  - a categorized problem list: https://zxi.mytechroad.com/blog/leetcode-problem-categories/
  - or visit other categories on the navi
- youtube channel: https://www.youtube.com/user/xxfflower
- bilibili channel: https://space.bilibili.com/9880352
greyireland/algorithm-pattern

See the problem list.

HackerRank

Other Platforms

About

tannineo

Directories ¶

Path	Synopsis
leetcode
0003_longest-substring-without-repeating-characters
0005_longest-palindromic-substring
0013_3sum
0020_valid-parentheses
0021_merge-two-sorted-lists
0023_merge-k-sorted-lists
0024_swap-nodes-in-pairs
0033_search-in-rotated-sorted-array
0034_find-first-and-last-position-of-element-in-sorted-array
0035_search-insert-position
0042_trapping-rain-water
0049_group-anagrams
0053_maximum-subarray
0055_jump-game
0056_merge-intervals
0064_minimum-path-sum
0072_edit-distance
0075_sort-colors
0091_decode-ways
0096_binary-tree-inorder-traversal
0098_validate-binary-search-tree
0099_recover-binary-search-tree
0101_symmetric-tree
0102_binary-tree-level-order-traversal
0104_maximum-depth-of-binary-tree
0108_convert-sorted-array-to-binary-search-tree
0110_balanced-binary-tree
0111_minimum-depth-of-binary-tree
0112_path-sum
0113_path-sum-ii
0121_best-time-to-buy-and-sell-stock
0122_best-time-to-buy-and-sell-stock-ii
0124_binary-tree-maximum-path-sum
0125_valid-palindrome
0130_surrounded-regions
0133_clone-graph
0136_single-number
0138_copy-list-with-random-pointer
0141_linked-list-cycle
0142_linked-list-cycle-ii
0144_binary-tree-preorder-traversal
0145_binary-tree-postorder-traversal
0146_lru-cache
0147_insertion-sort-list
0148_sort-list
0151_reverse-words-in-a-string
0153_find-minimum-in-rotated-sorted-array
0154_find-minimum-in-rotated-sorted-array-ii
0155_min-stack
0200_number-of-islands
0201_bitwise-and-of-numbers-range
0202_happy-number
0206_reverse-linked-list
0207_course-schedule
0208_implement-trie-prefix-tree
0210_course-schedule-ii
0221_maximal-square
0222_count-complete-tree-nodes
0230_kth-smallest-element-in-a-bst
0235_lowest-common-ancestor-of-a-binary-search-tree
0236_lowest-common-ancestor-of-a-binary-tree
0238_product-of-array-except-self
0257_binary-tree-paths
0264_ugly-number-ii
0279_perfect-squares
0283_move-zeroes
0297_serialize-and-deserialize-binary-tree
0300_longest-increasing-subsequence
0303_range-sum-query-immutable
0315_count-of-smaller-numbers-after-self
0328_odd-even-linked-list
0337_house-robber-iii
0338_counting-bits
0359_logger-rate-limiter
0367_valid-perfect-square
0368_largest-divisible-subset
0380_insert-delete-getrandom-o1
0402_remove-k-digits
0406_queue-reconstruction-by-height
0412_fizz-buzz
0429_n-ary-tree-level-order-traversal
0435_non-overlapping-intervals
0437_path-sum-iii
0438_find-all-anagrams-in-a-string
0442_find-all-duplicates-in-an-array
0445_add-two-numbers-ii
0449_serialize-and-deserialize-bst
0450_delete-node-in-a-bst
0451_sort-characters-by-frequency
0468_validate-ip-address
0501_find-mode-in-binary-search-tree
0508_most-frequent-subtree-sum
0518_coin-change-2
0520_detect-capital
0525_contiguous-array
0528_random-pick-with-weight
0530_minimum-absolute-difference-in-bst
0540_single-element-in-a-sorted-array
0543_diameter-of-binary-tree
0547_friend-circles
0560_subarray-sum-equals-k
0572_subtree-of-another-tree
0589_n-ary-tree-preorder-traversal
0590_n-ary-tree-postorder-traversal
0617_merge-two-binary-trees
0621_task-scheduler
0662_maximum-width-of-binary-tree
0669_trim-a-binary-search-tree
0673_number-of-longest-increasing-subsequence
0678_valid-parenthesis-string
0687_longest-univalue-path
0695_max-area-of-island
0701_insert-into-a-binary-search-tree
0704_binary-search
0707_design-linked-list
0712_minimum-ascii-delete-sum-for-two-strings
0746_min-cost-climbing-stairs
0763_partition-labels
0787_cheapest-flights-within-k-stops
0802_find-eventual-safe-states
0814_binary-tree-pruning
0827_making-a-large-island
0829_consecutive-numbers-sum
0841_keys-and-rooms
0844_backspace-string-compare
0872_leaf-similar-trees
0886_possible-bipartition
0901_online-stock-span
0912_sort-an-array
0918_maximum-sum-circular-subarray
0937_reorder-data-in-log-files
0953_verifying-an-alien-dictionary
0957_prison-cells-after-n-days
0965_univalued-binary-tree
0968_binary-tree-cameras
0973_k-closest-points-to-origin
0976_largest-perimeter-triangle
0986_interval-list-intersections
0994_rotting-oranges
0997_find-the-town-judge
1008_construct-binary-search-tree-from-preorder-traversal
1029_two-city-scheduling
1035_uncrossed-lines
1046_last-stone-weight
1048_longest-string-chain
1137_n-th-tribonacci-number
1143_longest-common-subsequence
1162_as-far-from-land-as-possible
1202_smallest-string-with-swaps
1214_two-sum-bsts
1218_longest-arithmetic-subsequence-of-given-difference
1232_check-if-it-is-a-straight-line
1277_count-square-submatrices-with-all-ones
1286_iterator-for-combination
1302_deepest-leaves-sum
1325_delete-leaves-with-a-given-value
1426_counting-elements
1427_perform-string-shifts
1429_first-unique-number
1430_check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree
1529_bulb-switcher-iv
1572_matrix-diagonal-sum

?	: This menu
/	: Search site
f or F	: Jump to
y or Y	: Canonical URL