Files

easy
hard
medium
- c
- cpp
- csharp
- golang
- java
- javascript
- kotlin
  - c0000
  - c0000_2_add-two-numbers
  - c0001_3_longest-substring-without-repeating-characters
  - c0002_5_longest-palindromic-substring
  - c0003_6_zigzag-conversion
  - c0004_8_string-to-integer-atoi
  - c0005_11_container-with-most-water
  - c0006_12_integer-to-roman
  - c0007_15_3sum
  - c0008_16_3sum-closest
  - c0009_17_letter-combinations-of-a-phone-number
  - c0010_18_4sum
  - c0011_19_remove-nth-node-from-end-of-list
  - c0012_22_generate-parentheses
  - c0013_24_swap-nodes-in-pairs
  - c0014_29_divide-two-integers
  - c0015_31_next-permutation
  - c0016_33_search-in-rotated-sorted-array
  - c0017_34_search-for-a-range
  - c0018_36_valid-sudoku
  - c0019_39_combination-sum
  - c0020_40_combination-sum-ii
  - c0021_43_multiply-strings
  - c0022_46_permutations
  - c0023_47_permutations-ii
  - c0024_48_rotate-image
  - c0025_49_group-anagrams
  - c0026_50_powx-n
  - c0027_54_spiral-matrix
  - c0028_55_jump-game
  - c0029_56_merge-intervals
  - c0030_59_spiral-matrix-ii
  - c0031_60_permutation-sequence
  - c0032_61_rotate-list
  - c0033_62_unique-paths
  - c0034_63_unique-paths-ii
  - c0035_64_minimum-path-sum
  - c0036_71_simplify-path
  - c0037_73_set-matrix-zeroes
  - c0038_74_search-a-2d-matrix
  - c0039_75_sort-colors
  - c0040_77_combinations
  - c0041_78_subsets
  - c0042_79_word-search
  - c0043_80_remove-duplicates-from-sorted-array-ii
  - c0044_81_search-in-rotated-sorted-array-ii
  - c0045_82_remove-duplicates-from-sorted-list-ii
  - c0046_86_partition-list
  - c0047_89_gray-code
  - c0048_90_subsets-ii
  - c0049_91_decode-ways
  - c0050_92_reverse-linked-list-ii
  - c0051_93_restore-ip-addresses
  - c0052_94_binary-tree-inorder-traversal
  - c0053_95_unique-binary-search-trees-ii
  - c0054_96_unique-binary-search-trees
  - c0055_98_validate-binary-search-tree
  - c0056_102_binary-tree-level-order-traversal
  - c0057_103_binary-tree-zigzag-level-order-traversal
  - c0058_105_construct-binary-tree-from-preorder-and-inorder-traversal
  - c0059_106_construct-binary-tree-from-inorder-and-postorder-traversal
    - 00_leetcode_0059.kt
  - c0060_109_convert-sorted-list-to-binary-search-tree
  - c0061_113_path-sum-ii
  - c0062_114_flatten-binary-tree-to-linked-list
  - c0063_116_populating-next-right-pointers-in-each-node
  - c0064_117_populating-next-right-pointers-in-each-node-ii
  - c0065_120_triangle
  - c0066_127_word-ladder
  - c0067_129_sum-root-to-leaf-numbers
  - c0068_130_surrounded-regions
  - c0069_131_palindrome-partitioning
  - c0070_133_clone-graph
  - c0071_134_gas-station
  - c0072_137_single-number-ii
  - c0073_138_copy-list-with-random-pointer
  - c0074_139_word-break
  - c0075_142_linked-list-cycle-ii
  - c0076_143_reorder-list
  - c0077_144_binary-tree-preorder-traversal
  - c0078_147_insertion-sort-list
  - c0079_148_sort-list
  - c0080_150_evaluate-reverse-polish-notation
  - c0081_151_reverse-words-in-a-string
  - c0082_152_maximum-product-subarray
  - c0083_153_find-minimum-in-rotated-sorted-array
  - c0084_156_binary-tree-upside-down
  - c0085_161_one-edit-distance
  - c0086_162_find-peak-element
  - c0087_163_missing-ranges
  - c0088_165_compare-version-numbers
  - c0089_166_fraction-to-recurring-decimal
  - c0090_173_binary-search-tree-iterator
  - c0091_179_largest-number
  - c0092_186_reverse-words-in-a-string-ii
  - c0093_187_repeated-dna-sequences
  - c0094_199_binary-tree-right-side-view
  - c0095_200_number-of-islands
  - c0096_201_bitwise-and-of-numbers-range
  - c0097_207_course-schedule
  - c0098_208_implement-trie-prefix-tree
  - c0099_209_minimum-size-subarray-sum
  - c0100_210_course-schedule-ii
  - c0101_211_add-and-search-word-data-structure-design
  - c0102_213_house-robber-ii
  - c0103_215_kth-largest-element-in-an-array
  - c0104_216_combination-sum-iii
  - c0105_220_contains-duplicate-iii
  - c0106_221_maximal-square
  - c0107_222_count-complete-tree-nodes
  - c0108_223_rectangle-area
  - c0109_227_basic-calculator-ii
  - c0110_228_summary-ranges
  - c0111_229_majority-element-ii
  - c0112_230_kth-smallest-element-in-a-bst
  - c0113_236_lowest-common-ancestor-of-a-binary-tree
  - c0114_238_product-of-array-except-self
  - c0115_240_search-a-2d-matrix-ii
  - c0116_241_different-ways-to-add-parentheses
  - c0117_244_shortest-word-distance-ii
  - c0118_245_shortest-word-distance-iii
  - c0119_247_strobogrammatic-number-ii
  - c0120_249_group-shifted-strings
  - c0121_250_count-univalue-subtrees
  - c0122_251_flatten-2d-vector
  - c0123_253_meeting-rooms-ii
  - c0124_254_factor-combinations
  - c0125_255_verify-preorder-sequence-in-binary-search-tree
  - c0126_259_3sum-smaller
  - c0127_260_single-number-iii
  - c0128_261_graph-valid-tree
  - c0129_264_ugly-number-ii
  - c0130_267_palindrome-permutation-ii
  - c0131_271_encode-and-decode-strings
  - c0132_274_h-index
  - c0133_275_h-index-ii
  - c0134_277_find-the-celebrity
  - c0135_279_perfect-squares
  - c0136_280_wiggle-sort
  - c0137_281_zigzag-iterator
  - c0138_284_peeking-iterator
  - c0139_285_inorder-successor-in-bst
  - c0140_286_walls-and-gates
  - c0141_287_find-the-duplicate-number
  - c0142_288_unique-word-abbreviation
  - c0143_289_game-of-life
  - c0144_294_flip-game-ii
  - c0145_298_binary-tree-longest-consecutive-sequence
  - c0146_299_bulls-and-cows
  - c0147_300_longest-increasing-subsequence
  - c0148_304_range-sum-query-2d-immutable
  - c0149_306_additive-number
  - c0150_307_range-sum-query-mutable
  - c0151_309_best-time-to-buy-and-sell-stock-with-cooldown
  - c0152_310_minimum-height-trees
  - c0153_311_sparse-matrix-multiplication
  - c0154_313_super-ugly-number
  - c0155_314_binary-tree-vertical-order-traversal
  - c0156_318_maximum-product-of-word-lengths
  - c0157_319_bulb-switcher
  - c0158_320_generalized-abbreviation
  - c0159_322_coin-change
  - c0160_323_number-of-connected-components-in-an-undirected-graph
  - c0161_324_wiggle-sort-ii
  - c0162_325_maximum-size-subarray-sum-equals-k
  - c0163_328_odd-even-linked-list
  - c0164_331_verify-preorder-serialization-of-a-binary-tree
  - c0165_332_reconstruct-itinerary
  - c0166_333_largest-bst-subtree
  - c0167_334_increasing-triplet-subsequence
  - c0168_337_house-robber-iii
  - c0169_338_counting-bits
  - c0170_341_flatten-nested-list-iterator
  - c0171_343_integer-break
  - c0172_347_top-k-frequent-elements
  - c0173_348_design-tic-tac-toe
  - c0174_351_android-unlock-patterns
  - c0175_353_design-snake-game
  - c0176_355_design-twitter
  - c0177_356_line-reflection
  - c0178_357_count-numbers-with-unique-digits
  - c0179_360_sort-transformed-array
  - c0180_361_bomb-enemy
  - c0181_362_design-hit-counter
  - c0182_364_nested-list-weight-sum-ii
  - c0183_365_water-and-jug-problem
  - c0184_366_find-leaves-of-binary-tree
  - c0185_368_largest-divisible-subset
  - c0186_369_plus-one-linked-list
  - c0187_370_range-addition
  - c0188_372_super-pow
  - c0189_373_find-k-pairs-with-smallest-sums
  - c0190_375_guess-number-higher-or-lower-ii
  - c0191_376_wiggle-subsequence
  - c0192_377_combination-sum-iv
  - c0193_378_kth-smallest-element-in-a-sorted-matrix
  - c0194_379_design-phone-directory
  - c0195_380_insert-delete-getrandom-o1
  - c0196_382_linked-list-random-node
  - c0197_384_shuffle-an-array
  - c0198_385_mini-parser
  - c0199_386_lexicographical-numbers
  - c0200_388_longest-absolute-file-path
  - c0201_390_elimination-game
  - c0202_392_is-subsequence
  - c0203_393_utf-8-validation
  - c0204_394_decode-string
  - c0205_395_longest-substring-with-at-least-k-repeating-characters
  - c0206_396_rotate-function
  - c0207_397_integer-replacement
  - c0208_398_random-pick-index
  - c0209_399_evaluate-division
  - c0210_402_remove-k-digits
  - c0211_406_queue-reconstruction-by-height
  - c0212_413_arithmetic-slices
  - c0213_416_partition-equal-subset-sum
  - c0214_417_pacific-atlantic-water-flow
  - c0215_418_sentence-screen-fitting
  - c0216_419_battleships-in-a-board
  - c0217_421_maximum-xor-of-two-numbers-in-an-array
  - c0218_423_reconstruct-original-digits-from-english
  - c0219_424_longest-repeating-character-replacement
  - c0220_435_non-overlapping-intervals
  - c0221_436_find-right-interval
  - c0222_439_ternary-expression-parser
  - c0223_442_find-all-duplicates-in-an-array
  - c0224_444_sequence-reconstruction
  - c0225_445_add-two-numbers-ii
  - c0226_449_serialize-and-deserialize-bst
  - c0227_450_delete-node-in-a-bst
  - c0228_451_sort-characters-by-frequency
  - c0229_452_minimum-number-of-arrows-to-burst-balloons
  - c0230_454_4sum-ii
  - c0231_456_132-pattern
  - c0232_462_minimum-moves-to-equal-array-elements-ii
  - c0233_464_can-i-win
  - c0234_467_unique-substrings-in-wraparound-string
  - c0235_468_validate-ip-address
  - c0236_469_convex-polygon
  - c0237_473_matchsticks-to-square
  - c0238_474_ones-and-zeroes
  - c0239_477_total-hamming-distance
  - c0240_481_magical-string
  - c0241_484_find-permutation
  - c0242_486_predict-the-winner
  - c0243_487_max-consecutive-ones-ii
  - c0244_490_the-maze
  - c0245_491_increasing-subsequences
  - c0246_494_target-sum
  - c0247_495_teemo-attacking
  - c0248_498_diagonal-traverse
  - c0249_503_next-greater-element-ii
  - c0250_505_the-maze-ii
  - c0251_508_most-frequent-subtree-sum
  - c0252_513_find-bottom-left-tree-value
  - c0253_515_find-largest-value-in-each-tree-row
  - c0254_516_longest-palindromic-subsequence
  - c0255_522_longest-uncommon-subsequence-ii
  - c0256_523_continuous-subarray-sum
  - c0257_524_longest-word-in-dictionary-through-deleting
  - c0258_525_contiguous-array
  - c0259_526_beautiful-arrangement
  - c0260_529_minesweeper
  - c0261_531_lonely-pixel-i
  - c0262_533_lonely-pixel-ii
  - c0263_535_encode-and-decode-tinyurl
  - c0264_536_construct-binary-tree-from-string
  - c0265_537_complex-number-multiplication
  - c0266_539_minimum-time-difference
  - c0267_540_single-element-in-a-sorted-array
  - c0268_542_01-matrix
  - c0269_544_output-contest-matches
  - c0270_545_boundary-of-binary-tree
  - c0271_547_friend-circles
  - c0272_548_split-array-with-equal-sum
  - c0273_549_binary-tree-longest-consecutive-sequence-ii
  - c0274_553_optimal-division
  - c0275_554_brick-wall
  - c0276_555_split-concatenated-strings
  - c0277_556_next-greater-element-iii
  - c0278_560_subarray-sum-equals-k
  - c0279_562_longest-line-of-consecutive-one-in-matrix
  - c0280_565_array-nesting
  - c0281_567_permutation-in-string
  - c0282_573_squirrel-simulation
  - c0283_576_out-of-boundary-paths
  - c0284_582_kill-process
  - c0285_583_delete-operation-for-two-strings
  - c0286_592_fraction-addition-and-subtraction
  - c0287_593_valid-square
  - c0288_609_find-duplicate-file-in-system
  - c0289_611_valid-triangle-number
  - c0290_616_add-bold-tag-in-string
  - c0291_621_task-scheduler
  - c0292_623_add-one-row-to-tree
  - c0293_625_minimum-factorization
  - c0294_634_find-the-derangement-of-an-array
  - c0295_635_design-log-storage-system
  - c0296_636_exclusive-time-of-functions
  - c0297_638_shopping-offers
  - c0298_640_solve-the-equation
  - c0299_646_maximum-length-of-pair-chain
  - c0300_647_palindromic-substrings
  - c0301_648_replace-words
  - c0302_649_dota2-senate
  - c0303_650_2-keys-keyboard
  - c0304_651_4-keys-keyboard
  - c0305_652_find-duplicate-subtrees
  - c0306_654_maximum-binary-tree
  - c0307_655_print-binary-tree
  - c0308_658_find-k-closest-elements
  - c0309_659_split-array-into-consecutive-subsequences
  - c0310_662_maximum-width-of-binary-tree
  - c0311_663_equal-tree-partition
  - c0312_666_path-sum-iv
  - c0313_667_beautiful-arrangement-ii
  - c0314_670_maximum-swap
  - c0315_672_bulb-switcher-ii
  - c0316_673_number-of-longest-increasing-subsequence
  - c0317_676_implement-magic-dictionary
  - c0318_677_map-sum-pairs
  - c0319_678_valid-parenthesis-string
  - c0320_681_next-closest-time
  - c0321_684_redundant-connection
  - c0322_688_knight-probability-in-chessboard
  - c0323_692_top-k-frequent-words
  - c0324_694_number-of-distinct-islands
  - c0325_698_partition-to-k-equal-sum-subsets
  - c0326_712_minimum-ascii-delete-sum-for-two-strings
  - c0327_713_subarray-product-less-than-k
  - c0328_714_best-time-to-buy-and-sell-stock-with-transaction-fee
  - c0329_718_maximum-length-of-repeated-subarray
  - c0330_721_accounts-merge
  - c0331_722_remove-comments
  - c0332_723_candy-crush
  - c0333_725_split-linked-list-in-parts
  - c0334_729_my-calendar-i
  - c0335_731_my-calendar-ii
  - c0336_735_asteroid-collision
  - c0337_737_sentence-similarity-ii
  - c0338_738_monotone-increasing-digits
  - c0339_739_daily-temperatures
  - c0340_740_delete-and-earn
  - c0341_742_closest-leaf-in-a-binary-tree
  - c0342_743_network-delay-time
  - c0343_748_shortest-completing-word
  - c0344_750_number-of-corner-rectangles
  - c0345_752_open-the-lock
  - c0346_754_reach-a-number
  - c0347_755_pour-water
  - c0348_756_pyramid-transition-matrix
  - c0349_763_partition-labels
  - c0350_764_largest-plus-sign
  - c0351_767_reorganize-string
  - c0352_769_max-chunks-to-make-sorted
  - c0353_775_global-and-local-inversions
  - c0354_776_split-bst
  - c0355_777_swap-adjacent-in-lr-string
  - c0356_779_k-th-symbol-in-grammar
  - c0357_781_rabbits-in-forest
  - c0358_785_is-graph-bipartite
  - c0359_787_cheapest-flights-within-k-stops
  - c0360_789_escape-the-ghosts
  - c0361_790_domino-and-tromino-tiling
  - c0362_791_custom-sort-string
  - c0363_792_number-of-matching-subsequences
  - c0364_794_valid-tic-tac-toe-state
  - c0365_795_number-of-subarrays-with-bounded-maximum
  - c0366_797_all-paths-from-source-to-target
  - c0367_799_champagne-tower
  - c0368_801_minimum-swaps-to-make-sequences-increasing
  - c0369_802_find-eventual-safe-states
  - c0370_807_max-increase-to-keep-city-skyline
  - c0371_808_soup-servings
  - c0372_809_expressive-words
  - c0373_813_largest-sum-of-averages
  - c0374_814_binary-tree-pruning
  - c0375_816_ambiguous-coordinates
  - c0376_817_linked-list-components
  - leetcode_all_medium.dirs
- python
- python3
- ruby
- scala
- swift
template
README.md
README.pdf
code_refactoring.bash
code_reset.bat.txt
init_push_github.bash

c0059_106_construct-binary-tree-from-inorder-and-postorder-traversal

Church.Zhong

and

Church.Zhong

update Makefile and template

Jun 20, 2018

8cc4a07 · Jun 20, 2018

History

Name	Name	Last commit message	Last commit date
parent directory ..
00_leetcode_0059.kt	00_leetcode_0059.kt	update Makefile and template	Jun 20, 2018

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Files

c0059_106_construct-binary-tree-from-inorder-and-postorder-traversal

c0059_106_construct-binary-tree-from-inorder-and-postorder-traversal

Files

c0059_106_construct-binary-tree-from-inorder-and-postorder-traversal

Directory actions

More options

Directory actions

More options

Latest commit

History

c0059_106_construct-binary-tree-from-inorder-and-postorder-traversal

Folders and files

parent directory