Files

0 - 1 Knapsack Problem - GFG
0002-add-two-numbers
0003-longest-substring-without-repeating-characters
0004-median-of-two-sorted-arrays
0007-reverse-integer
0008-string-to-integer-atoi
0013-roman-to-integer
0017-letter-combinations-of-a-phone-number
0019-remove-nth-node-from-end-of-list
0021-merge-two-sorted-lists
0022-generate-parentheses
0024-swap-nodes-in-pairs
0025-reverse-nodes-in-k-group
0026-remove-duplicates-from-sorted-array
0031-next-permutation
0032-longest-valid-parentheses
0033-search-in-rotated-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array
0035-search-insert-position
0036-valid-sudoku
0039-combination-sum
0040-combination-sum-ii
0041-first-missing-positive
0042-trapping-rain-water
0049-group-anagrams
0050-powx-n
0053-maximum-subarray
0054-spiral-matrix
0055-jump-game
0056-merge-intervals
0057-insert-interval
0061-rotate-list
0062-unique-paths
0066-plus-one
0074-search-a-2d-matrix
0075-sort-colors
0076-minimum-window-substring
0078-subsets
0083-remove-duplicates-from-sorted-list
0090-subsets-ii
0098-validate-binary-search-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0105-construct-binary-tree-from-preorder-and-inorder-traversal
- 0105-construct-binary-tree-from-preorder-and-inorder-traversal.cpp
- NOTES.md
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0108-convert-sorted-array-to-binary-search-tree
0110-balanced-binary-tree
0118-pascals-triangle
0121-best-time-to-buy-and-sell-stock
0122-best-time-to-buy-and-sell-stock-ii
0124-binary-tree-maximum-path-sum
0129-sum-root-to-leaf-numbers
0133-clone-graph
0134-gas-station
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
0148-sort-list
0150-evaluate-reverse-polish-notation
0151-reverse-words-in-a-string
0152-maximum-product-subarray
0153-find-minimum-in-rotated-sorted-array
0154-find-minimum-in-rotated-sorted-array-ii
0171-excel-sheet-column-number
0179-largest-number
0183-customers-who-never-order
0196-delete-duplicate-emails
0198-house-robber
0199-binary-tree-right-side-view
0205-isomorphic-strings
0207-course-schedule
0208-implement-trie-prefix-tree
0213-house-robber-ii
0219-contains-duplicate-ii
0230-kth-smallest-element-in-a-bst
0232-implement-queue-using-stacks
0234-palindrome-linked-list
0237-delete-node-in-a-linked-list
0240-search-a-2d-matrix-ii
0242-valid-anagram
0279-perfect-squares
0287-find-the-duplicate-number
0297-serialize-and-deserialize-binary-tree
0322-coin-change
0328-odd-even-linked-list
0345-reverse-vowels-of-a-string
0373-find-k-pairs-with-smallest-sums
0402-remove-k-digits
0404-sum-of-left-leaves
0416-partition-equal-subset-sum
0424-longest-repeating-character-replacement
0435-non-overlapping-intervals
0442-find-all-duplicates-in-an-array
0445-add-two-numbers-ii
0448-find-all-numbers-disappeared-in-an-array
0452-minimum-number-of-arrows-to-burst-balloons
0494-target-sum
0496-next-greater-element-i
0513-find-bottom-left-tree-value
0540-single-element-in-a-sorted-array
0547-number-of-provinces
0560-subarray-sum-equals-k
0584-find-customer-referee
0595-big-countries
0605-can-place-flowers
0617-merge-two-binary-trees
0621-task-scheduler
0627-swap-salary
0645-set-mismatch
0658-find-k-closest-elements
0662-maximum-width-of-binary-tree
0678-valid-parenthesis-string
0692-top-k-frequent-words
0695-max-area-of-island
0700-search-in-a-binary-search-tree
0707-design-linked-list
0713-subarray-product-less-than-k
0740-delete-and-earn
0766-toeplitz-matrix
0767-reorganize-string
0848-shifting-letters
0852-peak-index-in-a-mountain-array
0860-lemonade-change
0872-leaf-similar-trees
0875-koko-eating-bananas
0876-middle-of-the-linked-list
0904-fruit-into-baskets
0938-range-sum-of-bst
0956-tallest-billboard
0976-largest-perimeter-triangle
0986-interval-list-intersections
0987-vertical-order-traversal-of-a-binary-tree
0994-rotting-oranges
1-two-sum
1004-max-consecutive-ones-iii
1008-construct-binary-search-tree-from-preorder-traversal
102-binary-tree-level-order-traversal
1020-number-of-enclaves
1027-longest-arithmetic-subsequence
103-binary-tree-zigzag-level-order-traversal
104-maximum-depth-of-binary-tree
1047-remove-all-adjacent-duplicates-in-string
1048-longest-string-chain
105-construct-binary-tree-from-preorder-and-inorder-traversal
106-construct-binary-tree-from-inorder-and-postorder-traversal
107-binary-tree-level-order-traversal-ii
108-convert-sorted-array-to-binary-search-tree
1091-shortest-path-in-binary-matrix
1092-shortest-common-supersequence
11-container-with-most-water
110-balanced-binary-tree
112-path-sum
113-path-sum-ii
114-flatten-binary-tree-to-linked-list
1143-longest-common-subsequence
1146-snapshot-array
1162-as-far-from-land-as-possible
118-pascals-triangle
1187-make-array-strictly-increasing
119-pascals-triangle-ii
12-integer-to-roman
120-triangle
1207-unique-number-of-occurrences
1208-get-equal-substrings-within-budget
1209-remove-all-adjacent-duplicates-in-string-ii
121-best-time-to-buy-and-sell-stock
124-binary-tree-maximum-path-sum
125-valid-palindrome
1254-number-of-closed-islands
1260-shift-2d-grid
1268-search-suggestions-system
128-longest-consecutive-sequence
129-sum-root-to-leaf-numbers
1290-convert-binary-number-in-a-linked-list-to-integer
13-roman-to-integer
130-surrounded-regions
1312-minimum-insertion-steps-to-make-a-string-palindrome
1319-number-of-operations-to-make-network-connected
1328-break-a-palindrome
133-clone-graph
1332-remove-palindromic-subsequences
1354-construct-target-array-with-multiple-sums
1373-maximum-sum-bst-in-binary-tree
1376-time-needed-to-inform-all-employees
1383-maximum-performance-of-a-team
14-longest-common-prefix
141-linked-list-cycle
142-linked-list-cycle-ii
1423-maximum-points-you-can-obtain-from-cards
143-reorder-list
1448-count-good-nodes-in-binary-tree
148-sort-list
1480-running-sum-of-1d-array
1484-group-sold-products-by-the-date
1492-the-kth-factor-of-n
151-reverse-words-in-a-string
1512-number-of-good-pairs
152-maximum-product-subarray
1527-patients-with-a-condition
1528-shuffle-string
153-find-minimum-in-rotated-sorted-array
1539-kth-missing-positive-number
154-find-minimum-in-rotated-sorted-array-ii
1569-number-of-ways-to-reorder-array-to-get-same-bst
1575-count-all-possible-routes
16-3sum-closest
160-intersection-of-two-linked-lists
162-find-peak-element
1636-sort-array-by-increasing-frequency
1641-count-sorted-vowel-strings
1642-furthest-building-you-can-reach
1647-minimum-deletions-to-make-character-frequencies-unique
1658-minimum-operations-to-reduce-x-to-zero
1662-check-if-two-string-arrays-are-equivalent
1667-fix-names-in-a-table
167-two-sum-ii-input-array-is-sorted
168-excel-sheet-column-title
1689-partitioning-into-minimum-number-of-deci-binary-numbers
169-majority-element
1695-maximum-erasure-value
1704-determine-if-string-halves-are-alike
171-excel-sheet-column-number
1710-maximum-units-on-a-truck
1721-swapping-nodes-in-a-linked-list
173-binary-search-tree-iterator
1757-recyclable-and-low-fat-products
1802-maximum-value-at-a-given-index-in-a-bounded-array
1814-count-nice-pairs-in-an-array
1833-maximum-ice-cream-bars
1873-calculate-special-bonus
19-remove-nth-node-from-end-of-list
1903-largest-odd-number-in-string
198-house-robber
199-binary-tree-right-side-view
2-add-two-numbers
200-number-of-islands
2007-find-original-array-from-doubled-array
202-happy-number
203-remove-linked-list-elements
206-reverse-linked-list
207-course-schedule
208-implement-trie-prefix-tree
209-minimum-size-subarray-sum
21-merge-two-sorted-lists
2104-sum-of-subarray-ranges
2149-rearrange-array-elements-by-sign
215-kth-largest-element-in-an-array
219-contains-duplicate-ii
224-basic-calculator
225-implement-stack-using-queues
2259-remove-digit-from-number-to-maximize-result
226-invert-binary-tree
2260-minimum-consecutive-cards-to-pick-up
227-basic-calculator-ii
229-majority-element-ii
2294-partition-array-such-that-maximum-difference-is-k
23-merge-k-sorted-lists
230-kth-smallest-element-in-a-bst
2300-successful-pairs-of-spells-and-potions
2309-greatest-english-letter-in-upper-and-lower-case
2328-number-of-increasing-paths-in-a-grid
234-palindrome-linked-list
235-lowest-common-ancestor-of-a-binary-search-tree
236-lowest-common-ancestor-of-a-binary-tree
2364-count-number-of-bad-pairs
237-delete-node-in-a-linked-list
238-product-of-array-except-self
2396-strictly-palindromic-number
2404-most-frequent-even-element
2405-optimal-partition-of-string
2418-sort-the-people
2419-longest-subarray-with-maximum-bitwise-and
242-valid-anagram
2433-find-the-original-array-of-prefix-xor
2443-sum-of-number-and-its-reverse
2448-minimum-cost-to-make-array-equal
2462-total-cost-to-hire-k-workers
2487-remove-nodes-from-linked-list
2491-divide-players-into-teams-of-equal-skill
2525-categorize-box-according-to-criteria
257-binary-tree-paths
258-add-digits
2653-sliding-subarray-beauty
268-missing-number
28-implement-strstr
287-find-the-duplicate-number
289-game-of-life
297-serialize-and-deserialize-binary-tree
3-longest-substring-without-repeating-characters
303-range-sum-query-immutable
304-range-sum-query-2d-immutable
31-next-permutation
322-coin-change
33-search-in-rotated-sorted-array
338-counting-bits
34-find-first-and-last-position-of-element-in-sorted-array
344-reverse-string
345-reverse-vowels-of-a-string
347-top-k-frequent-elements
349-intersection-of-two-arrays
36-valid-sudoku
378-kth-smallest-element-in-a-sorted-matrix
387-first-unique-character-in-a-string
389-find-the-difference
39-combination-sum
392-is-subsequence
3sum-closest
3sum
4-median-of-two-sorted-arrays
40-combination-sum-ii
402-remove-k-digits
404-sum-of-left-leaves
406-queue-reconstruction-by-height
410-split-array-largest-sum
413-arithmetic-slices
415-add-strings
416-partition-equal-subset-sum
42-trapping-rain-water
437-path-sum-iii
438-find-all-anagrams-in-a-string
445-add-two-numbers-ii
450-delete-node-in-a-bst
451-sort-characters-by-frequency
454-4sum-ii
456-132-pattern
46-permutations
462-minimum-moves-to-equal-array-elements-ii
47-permutations-ii
48-rotate-image
485-max-consecutive-ones
49-group-anagrams
494-target-sum
4sum
5-longest-palindromic-substring
50-powx-n
509-fibonacci-number
51-n-queens
513-find-bottom-left-tree-value
516-longest-palindromic-subsequence
518-coin-change-2
52-n-queens-ii
525-contiguous-array
53-maximum-subarray
530-minimum-absolute-difference-in-bst
532-k-diff-pairs-in-an-array
540-single-element-in-a-sorted-array
542-01-matrix
543-diameter-of-binary-tree
55-jump-game
557-reverse-words-in-a-string-iii
56-merge-intervals
560-subarray-sum-equals-k
567-permutation-in-string
572-subtree-of-another-tree
58-length-of-last-word
583-delete-operation-for-two-strings
599-minimum-index-sum-of-two-lists
61-rotate-list
62-unique-paths
623-add-one-row-to-tree
628-maximum-product-of-three-numbers
630-course-schedule-iii
653-two-sum-iv-input-is-a-bst
658-find-k-closest-elements
66-plus-one
665-non-decreasing-array
67-add-binary
680-valid-palindrome-ii
695-max-area-of-island
696-count-binary-substrings
700-search-in-a-binary-search-tree
703-kth-largest-element-in-a-stream
705-design-hashset
709-to-lower-case
71-simplify-path
73-set-matrix-zeroes
733-flood-fill
735-asteroid-collision
739-daily-temperatures
74-search-a-2d-matrix
740-delete-and-earn
745-prefix-and-suffix-search
747-largest-number-at-least-twice-of-others
75-sort-colors
76-minimum-window-substring
78-subsets
783-minimum-distance-between-bst-nodes
785-is-graph-bipartite
796-rotate-string
799-champagne-tower
8-string-to-integer-atoi
80-remove-duplicates-from-sorted-array-ii
81-search-in-rotated-sorted-array-ii
82-remove-duplicates-from-sorted-list-ii
820-short-encoding-of-words
83-remove-duplicates-from-sorted-list
84-largest-rectangle-in-histogram
852-peak-index-in-a-mountain-array
86-partition-list
863-all-nodes-distance-k-in-binary-tree
867-transpose-matrix
876-middle-of-the-linked-list
88-merge-sorted-array
886-possible-bipartition
890-find-and-replace-pattern
896-monotonic-array
9-palindrome-number
905-sort-array-by-parity
912-sort-an-array
92-reverse-linked-list-ii
930-binary-subarrays-with-sum
934-shortest-bridge
968-binary-tree-cameras
973-k-closest-points-to-origin
98-validate-binary-search-tree
987-vertical-order-traversal-of-a-binary-tree
99-recover-binary-search-tree
994-rotting-oranges
Binary Tree to DLL - GFG
Boolean Parenthesization - GFG
Check for BST - GFG
Check for Balanced Tree - GFG
Check if subtree - GFG
Children Sum Parent - GFG
Coin Change - GFG
Delete Middle of Linked List - GFG
Delete a Node in Single Linked List - GFG
Delete without head pointer - GFG
Diameter of a Binary Tree - GFG
Find Pair Given Difference - GFG
Find a pair with given target in BST - GFG
Fixing Two nodes of a BST - GFG
Flatten binary tree to linked list - GFG
Form a palindrome - GFG
Given a linked list of 0s, 1s and 2s, sort it. - GFG
Insert in Middle of Linked List - GFG
Knapsack with Duplicate Items - GFG
Kth largest element in BST - GFG
Kth smallest element - GFG
Left View of Binary Tree - GFG
Level order traversal - GFG
Linked List Insertion - GFG
Longest Common Subsequence - GFG
Longest Common Substring - GFG
Longest Palindromic Subsequence - GFG
Longest Repeating Subsequence - GFG
Lowest Common Ancestor in a BST - GFG
Matrix Chain Multiplication - GFG
Maximum Width of Tree - GFG
Maximum path sum from any node - GFG
Minimize the sum of product - GFG
Minimum Cost of ropes - GFG
Minimum number of deletions and insertions. - GFG
Minimum number of deletions. - GFG
Minimum sum partition - GFG
Mirror Tree - GFG
Nearly Sorted Algorithm - GFG
Node at a given index in linked list - GFG
Number of Coins - GFG
Palindromic patitioning - GFG
Partition Equal Subset Sum - GFG
Perfect Sum Problem - GFG
Rod Cutting - GFG
Shortest Common Supersequence - GFG
Subset Sum Problem - GFG
Sum of elements between k1'th and k2'th smallest elements - GFG
ZigZag Tree Traversal - GFG
add-binary
add-two-numbers
array-partition-i
backspace-string-compare
balanced-binary-tree
best-time-to-buy-and-sell-stock
binary-search-tree-to-greater-sum-tree
binary-search
binary-tree-inorder-traversal
binary-tree-level-order-traversal
binary-tree-postorder-traversal
binary-tree-preorder-traversal
build-array-from-permutation
check-if-all-as-appears-before-all-bs
concatenation-of-array
contains-duplicate
convert-bst-to-greater-tree
count-common-words-with-one-occurrence
count-primes
daily-temperatures
delete-node-in-a-linked-list
design-hashmap
design-hashset
diameter-of-binary-tree
evaluate-reverse-polish-notation
fibonacci-number
find-first-palindromic-string-in-the-array
find-subsequence-of-length-k-with-the-largest-sum
find-the-duplicate-number
first-bad-version
generate-parentheses
how-many-numbers-are-smaller-than-the-current-number
implement-queue-using-stacks
implement-stack-using-queues
intersection-of-two-arrays-ii
intersection-of-two-arrays
intersection-of-two-linked-lists
invert-binary-tree
isomorphic-strings
jewels-and-stones
kth-largest-element-in-an-array
largest-rectangle-in-histogram
linked-list-cycle-ii
linked-list-cycle
longest-common-prefix
longest-consecutive-sequence
majority-element-ii
majority-element
max-consecutive-ones
maximum-depth-of-binary-tree
maximum-product-subarray
maximum-subarray
merge-sorted-array
merge-two-sorted-lists
middle-of-the-linked-list
min-stack
minimum-number-of-days-to-make-m-bouquets
minimum-size-subarray-sum
missing-number
move-zeroes
n-queens
next-greater-element-ii
online-stock-span
palindrome-linked-list
pascals-triangle-ii
permutations
plus-one
populating-next-right-pointers-in-each-node
power-of-three
power-of-two
powx-n
product-of-array-except-self
remove-all-adjacent-duplicates-in-string
remove-duplicates-from-sorted-array
remove-element
remove-nth-node-from-end-of-list
reshape-the-matrix
reverse-linked-list
reverse-nodes-in-k-group
reverse-string
reverse-words-in-a-string-iii
reverse-words-in-a-string
richest-customer-wealth
rotate-array
rotate-image
rotate-list
running-sum-of-1d-array
same-tree
search-a-2d-matrix
search-in-rotated-sorted-array
search-insert-position
single-number
sliding-window-maximum
sort-array-by-parity-ii
sqrtx
squares-of-a-sorted-array
subarray-sums-divisible-by-k
subsets
sum-of-subarray-minimums
symmetric-tree
trapping-rain-water
two-sum-ii-input-array-is-sorted
two-sum
valid-parentheses
valid-sudoku
README.md

0105-construct-binary-tree-from-preorder-and-inorder-traversal

Name		Name	Last commit message	Last commit date
parent directory ..
0105-construct-binary-tree-from-preorder-and-inorder-traversal.cpp		0105-construct-binary-tree-from-preorder-and-inorder-traversal.cpp
NOTES.md		NOTES.md

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Files

0105-construct-binary-tree-from-preorder-and-inorder-traversal

0105-construct-binary-tree-from-preorder-and-inorder-traversal

Files

0105-construct-binary-tree-from-preorder-and-inorder-traversal

Directory actions

More options

Directory actions

More options

Latest commit

History

0105-construct-binary-tree-from-preorder-and-inorder-traversal

Folders and files

parent directory