DSA-Learning-CPP

LeetCode Topics

Tree

0100-same-tree
0101-symmetric-tree
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0110-balanced-binary-tree
0112-path-sum
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0124-binary-tree-maximum-path-sum
0129-sum-root-to-leaf-numbers
0199-binary-tree-right-side-view
0222-count-complete-tree-nodes
0226-invert-binary-tree
0543-diameter-of-binary-tree
0958-check-completeness-of-a-binary-tree
1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree
2331-evaluate-boolean-binary-tree

Depth-First Search

0100-same-tree
0101-symmetric-tree
0104-maximum-depth-of-binary-tree
0110-balanced-binary-tree
0112-path-sum
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0124-binary-tree-maximum-path-sum
0129-sum-root-to-leaf-numbers
0199-binary-tree-right-side-view
0226-invert-binary-tree
0543-diameter-of-binary-tree
1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree
2331-evaluate-boolean-binary-tree

Breadth-First Search

0100-same-tree
0101-symmetric-tree
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0112-path-sum
0199-binary-tree-right-side-view
0226-invert-binary-tree
0958-check-completeness-of-a-binary-tree
1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree

Binary Tree

0100-same-tree
0101-symmetric-tree
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0110-balanced-binary-tree
0112-path-sum
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0124-binary-tree-maximum-path-sum
0129-sum-root-to-leaf-numbers
0199-binary-tree-right-side-view
0222-count-complete-tree-nodes
0226-invert-binary-tree
0543-diameter-of-binary-tree
0958-check-completeness-of-a-binary-tree
1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree
2331-evaluate-boolean-binary-tree

Array

0001-two-sum
0238-product-of-array-except-self
0283-move-zeroes
0414-third-maximum-number
0628-maximum-product-of-three-numbers
1288-remove-covered-intervals
1967-number-of-strings-that-appear-as-substrings-in-word
1979-find-greatest-common-divisor-of-array
3925-concatenate-array-with-reverse

Two Pointers

0283-move-zeroes

String

0067-add-binary
0520-detect-capital
1967-number-of-strings-that-appear-as-substrings-in-word
3014-minimum-number-of-pushes-to-type-word-i

Sorting

0414-third-maximum-number
0628-maximum-product-of-three-numbers
1288-remove-covered-intervals

Math

0067-add-binary
0509-fibonacci-number
0628-maximum-product-of-three-numbers
1979-find-greatest-common-divisor-of-array
2180-count-integers-with-even-digit-sum
3014-minimum-number-of-pushes-to-type-word-i
3754-concatenate-non-zero-digits-and-multiply-by-sum-i

Dynamic Programming

0124-binary-tree-maximum-path-sum
0509-fibonacci-number

Recursion

0509-fibonacci-number

Memoization

0509-fibonacci-number

Binary Search

0222-count-complete-tree-nodes

Bit Manipulation

0067-add-binary
0222-count-complete-tree-nodes

Simulation

0067-add-binary
2180-count-integers-with-even-digit-sum
3925-concatenate-array-with-reverse

Number Theory

1979-find-greatest-common-divisor-of-array

Linked List

0114-flatten-binary-tree-to-linked-list

Stack

0114-flatten-binary-tree-to-linked-list

Hash Table

0001-two-sum

Backtracking

0113-path-sum-ii

Prefix Sum

0238-product-of-array-except-self

Greedy

3014-minimum-number-of-pushes-to-type-word-i