my_code

module
v0.0.0-...-73b56a4 Latest Latest
Warning

This package is not in the latest version of its module.

 Go to latest Published: Jul 24, 2024 License: None detected not legal advice

Directories

Path Synopsis
BFS
BFS/102_binary-tree-level-order-traversal
BFS/103_binary-tree-zigzag-level-order-traversal
BFS/107_inary-tree-level-order-traversal-ii
BFS/111_minimum-depth-of-binary-tree
BFS/429_n-ary-tree-level-order-traversal
BFS/513_find-bottom-left-tree-value
BFS/515_find-largest-value-in-each-tree-row
BFS/752_open-the-lock
BFS/773_sliding-puzzle
BFS/LCR044_hPov7L
BFS/LCR045_LwUNpT
BFS/LCR109_zlDJc7
BFS/LCR149_cong-shang-dao-xia-da-yin-er-cha-shu-lcof
BFS/LCR150_cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof
BFS/LCR151_cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof
DFS
DFS/104_maximum-depth-of-binary-tree
DFS/129_sum-root-to-leaf-numbers
DFS/17_letter-combinations-of-a-phone-number
DFS/22_generate-parentheses
DFS/37_sudoku-solver
DFS/39_combination-sum
DFS/40_combination-sum-ii
DFS/437_path-sum-iii
DFS/46_permutations
DFS/47_permutations-ii
DFS/513_find-bottom-left-tree-value
DFS/51_n-queens
DFS/52_n-queens-ii
DFS/698_partition-to-k-equal-sum-subsets
DFS/77_combinations
DFS/78_subsets
DFS/90_subsets-ii
DFS/LCR045_LwUNpT
DFS/LCR049_3Etpl5
DFS/LCR050_6eUYwP
DFS/LCR079_TVdhkn
DFS/LCR080_uUsW3B
DFS/LCR081_Ygoe9J
DFS/LCR082_4sjJUc
DFS/LCR083_VvJkup
DFS/LCR084_7p8L0Z
DFS/LCR085_IDBivT
DFS/island
DFS/island/1020_number-of-enclaves
DFS/island/1254_number-of-closed-islands
DFS/island/1905_count-sub-islands
DFS/island/200_number-of-islands
DFS/island/694_number-of-distinct-islands
DFS/island/695_max-area-of-island
DFS/island/LCR695_ZL6zAn
DP
DP/10_regular-expression-matching
DP/1143_longest-common-subsequence
DP/115_distinct-subsequences
DP/120_triangle
DP/174_dungeon-game
DP/198_house-robber
DP/213_house-robber-ii
DP/256_paint-house
DP/264_ugly-number-ii
DP/300_longest-increasing-subsequence
DP/312_burst-balloons
DP/322_coin-change
DP/337_house-robber-iii
DP/338_counting-bits
DP/343_integer-break
DP/354_russian-doll-envelopes
DP/494_target-sum
DP/509_fibonacci-number
DP/53_maximum-subarray
DP/583_delete-operation-for-two-strings
DP/62_unique-paths
DP/63_unique-paths-ii
DP/647_palindromic-substrings
DP/64_minimum-path-sum
DP/70_climbing-stairs
DP/712_minimum-ascii-delete-sum-for-two-strings
DP/72_edit-distance
DP/746_min-cost-climbing-stairs
DP/887_super-egg-drop
DP/91_decode-ways
DP/931_minimum-falling-path-sum
DP/97_interleaving-string
DP/LCR003_w3tCBm
DP/LCR020_a7VOhD
DP/LCR088_GzCJIP
DP/LCR089_Gu0c2T
DP/LCR090_PzWKhm
DP/LCR091_JEj789
DP/LCR095_qJnOS7
DP/LCR097_21dk04
DP/LCR098_2AoeFn
DP/LCR099_0i0mDW
DP/LCR100_IlPe0q
DP/LCR102_YaVDxD
DP/LCR103_gaM7Ch
DP/LCR126_fei-bo-na-qi-shu-lie-lcof
DP/LCR127_qing-wa-tiao-tai-jie-wen-ti-lcof
DP/LCR130_ji-qi-ren-de-yun-dong-fan-wei-lcof
DP/LCR131_jian-sheng-zi-lcof
DP/LCR137_zheng-ze-biao-da-shi-pi-pei-lcof
DP/LCR161_lian-xu-zi-shu-zu-de-zui-da-he-lcof
DP/LCR165_ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof
DP/LCR166_li-wu-de-zui-da-jie-zhi-lcof
DP/LCR168_chou-shu-lcof
DP/bag
DP/bag/416_partition-equal-subset-sum
DP/bag/518_coin-change-ii
DP/stock/121_best-time-to-buy-and-sell-stock
DP/stock/122_best-time-to-buy-and-sell-stock-ii
DP/stock/123_best-time-to-buy-and-sell-stock-iii
DP/stock/188_best-time-to-buy-and-sell-stock-iv
DP/stock/309_best-time-to-buy-and-sell-stock-with-cooldown
DP/stock/714_best-time-to-buy-and-sell-stock-with-transaction-fee
DP/stock/LCR188_gu-piao-de-zui-da-li-run-lcof
graph
graph/207_course-schedule
graph/210_course-schedule-ii
graph/785_is-graph-bipartite
graph/797_all-paths-from-source-to-target
graph/886_possible-bipartition
graph/LCR106_vEAB3K
graph/LCR110_bP4bmD
graph/LCR113_QA2IGt
greedy/1024_video-stitching
greedy/134_gas-station
greedy/45_jump-game-ii
greedy/55_jump-game
heap
heap/215_kth-largest-element-in-an-array
heap/23_merge-k-sorted-lists
heap/295_find-median-from-data-stream
heap/703_kth-largest-element-in-a-stream
heap/LCR059_jBjn9C
heap/LCR160_shu-ju-liu-zhong-de-zhong-wei-shu-lcof
math/172_factorial-trailing-zeroes
math/204_count-primes
math/318_maximum-product-of-word-lengths
math/380_insert-delete-getrandom-o1
math/382_linked-list-random-node
math/398_random-pick-index
math/645_set-mismatch
math/67_add-binary
math/710_random-pick-with-blacklist
math/LCR002_JFETK5
math/LCR005_aseY1I
math/LCR030_FortPu
other/1276_number-of-burgers-with-no-waste-of-ingredients
other/146_lru-cache
other/162_find-peak-element
other/187_repeated-dna-sequences
other/241_different-ways-to-add-parentheses
other/2660_determine-the-winner-of-a-bowling-game
other/268_missing-number
other/2828_check-if-a-string-is-an-acronym-of-words
other/460_lfu-cache
other/LCR031_OrIXps
tree/BST
tree/BST/1038_binary-search-tree-to-greater-sum-tree
tree/BST/108_convert-sorted-array-to-binary-search-tree
tree/BST/109_convert-sorted-list-to-binary-search-tree
tree/BST/1373_maximum-sum-bst-in-binary-tree
tree/BST/230_kth-smallest-element-in-a-bst
tree/BST/235_lowest-common-ancestor-of-a-binary-search-tree
tree/BST/285_inorder-successor-in-bst
tree/BST/501_find-mode-in-binary-search-tree
tree/BST/530_minimum-absolute-difference-in-bst
tree/BST/538_convert-bst-to-greater-tree
tree/BST/700_search-in-a-binary-search-tree
tree/BST/701_insert-into-a-binary-search-tree
tree/BST/783_minimum-distance-between-bst-nodes
tree/BST/897_increasing-order-search-tree
tree/BST/95_unique-binary-search-trees-ii
tree/BST/96_unique-binary-search-trees
tree/BST/98_alidate-binary-search-tree
tree/BST/99_recover-binary-search-tree
tree/BST/LCR052_NYBBNL
tree/BST/LCR053_P5rCT8
tree/BST/LCR054_w6cpku
tree/BST/LCR174_er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof
tree/BST/LCR193_er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof
tree/binary
tree/binary/100_same-tree
tree/binary/101_symmetric-tree
tree/binary/102_binary-tree-level-order-traversal
tree/binary/103_binary-tree-zigzag-level-order-traversal
tree/binary/104_maximum-depth-of-binary-tree
tree/binary/105_construct-binary-tree-from-preorder-and-inorder-traversal
tree/binary/106_construct-binary-tree-from-inorder-and-postorder-traversal
tree/binary/107_inary-tree-level-order-traversal-ii
tree/binary/110_balanced-binary-tree
tree/binary/111_minimum-depth-of-binary-tree
tree/binary/112_path-sum
tree/binary/113_path-sum-ii
tree/binary/114_flatten-binary-tree-to-linked-list
tree/binary/116_populating-next-right-pointers-in-each-node
tree/binary/124_binary-tree-maximum-path-sum
tree/binary/1373_maximum-sum-bst-in-binary-tree
tree/binary/144_binary-tree-preorder-traversal
tree/binary/145_binary-tree-postorder-traversal
tree/binary/222_count-complete-tree-nodes
tree/binary/226_invert-binary-tree
tree/binary/236_lowest-common-ancestor-of-a-binary-tree
tree/binary/2415_reverse-odd-levels-of-binary-tree
tree/binary/297_serialize-and-deserialize-binary-tree/postorder
tree/binary/297_serialize-and-deserialize-binary-tree/preorder
tree/binary/297_serialize-and-deserialize-binary-tree/queue
tree/binary/515_find-largest-value-in-each-tree-row
tree/binary/543_diameter-of-binary-tree
tree/binary/559_maximum-depth-of-n-ary-tree
tree/binary/589_n-ary-tree-preorder-traversal
tree/binary/590_n-ary-tree-postorder-traversal
tree/binary/652_find-duplicate-subtrees
tree/binary/654_maximum-binary-tree
tree/binary/669_trim-a-binary-search-tree
tree/binary/814_binary-tree-pruning
tree/binary/889_construct-binary-tree-from-preorder-and-postorder-traversal
tree/binary/94_binary-tree-inorder-traversal
tree/binary/965_univalued-binary-tree
tree/binary/LCR044_hPov7L
tree/binary/LCR047_pOCWxh
tree/binary/LCR048_h54YBf
tree/binary/LCR051_jC7MId
tree/binary/LCR124_zhong-jian-er-cha-shu-lcof
tree/binary/LCR144_er-cha-shu-de-jing-xiang-lcof
tree/binary/LCR145_dui-cheng-de-er-cha-shu-lcof
tree/binary/LCR153_er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof
tree/binary/LCR175_er-cha-shu-de-shen-du-lcof
tree/binary/LCR176_ping-heng-er-cha-shu-lcof
tree/binary/LCR194_er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL
go.dev uses cookies from Google to deliver and enhance the quality of its services and to analyze traffic. Learn more.