Types & classes — github.com/Amanhacker/Aman-Barnwal-Leetcode-Solutions

CodeHub MCPcopy Create free account

hub / github.com/Amanhacker/Aman-Barnwal-Leetcode-Solutions / types & classes

Types & classes605 in github.com/Amanhacker/Aman-Barnwal-Leetcode-Solutions

⨍ Functions 931◇ Types & classes 605

ClassBSTIterator

* Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), l

173-binary-search-tree-iterator/173-binary-search-tree-iterator.cpp:12

* Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(

297-serialize-and-deserialize-binary-tree/297-serialize-and-deserialize-binary-tree.cpp:10

* Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(

0449-serialize-and-deserialize-bst/0449-serialize-and-deserialize-bst.cpp:10

ClassCombinationIterator

1286-iterator-for-combination/1286-iterator-for-combination.cpp:1

ClassCustomStack

1381-design-a-stack-with-increment-operation/1381-design-a-stack-with-increment-operation.cpp:1

ClassFindElements

* Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), l

1261-find-elements-in-a-contaminated-binary-tree/1261-find-elements-in-a-contaminated-binary-tree.cpp:12

ClassKthLargest

703-kth-largest-element-in-a-stream/703-kth-largest-element-in-a-stream.cpp:1

359-logger-rate-limiter/359-logger-rate-limiter.cpp:1

1756-design-most-recently-used-queue/1756-design-most-recently-used-queue.cpp:1

716-max-stack/716-max-stack.cpp:1

155-min-stack/155-min-stack.cpp:1

ClassMovingAverage

346-moving-average-from-data-stream/346-moving-average-from-data-stream.cpp:1

706-design-hashmap/706-design-hashmap.cpp:1

232-implement-queue-using-stacks/232-implement-queue-using-stacks.cpp:1

225-implement-stack-using-queues/225-implement-stack-using-queues.cpp:1

1628-design-an-expression-tree-with-evaluate-function/1628-design-an-expression-tree-with-evaluate-function.cpp:6

1628-design-an-expression-tree-with-evaluate-function/1628-design-an-expression-tree-with-evaluate-function.cpp:21

1628-design-an-expression-tree-with-evaluate-function/1628-design-an-expression-tree-with-evaluate-function.cpp:36

ClassOrderedStream

1656-design-an-ordered-stream/1656-design-an-ordered-stream.cpp:1

ClassParkingSystem

1603-design-parking-system/1603-design-parking-system.cpp:1

ClassProductOfNumbers

1352-product-of-the-last-k-numbers/1352-product-of-the-last-k-numbers.cpp:1

ClassSeatManager

1845-seat-reservation-manager/1845-seat-reservation-manager.cpp:1

2129-capitalize-the-title/2129-capitalize-the-title.cpp:1

2138-divide-a-string-into-groups-of-size-k/2138-divide-a-string-into-groups-of-size-k.cpp:1

* Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), l

113-path-sum-ii/113-path-sum-ii.cpp:12

819-most-common-word/819-most-common-word.cpp:1

1567-maximum-length-of-subarray-with-positive-product/1567-maximum-length-of-subarray-with-positive-product.cpp:1

1071-greatest-common-divisor-of-strings/1071-greatest-common-divisor-of-strings.cpp:1

414-third-maximum-number/414-third-maximum-number.cpp:1

1507-reformat-date/1507-reformat-date.cpp:1

1772-sort-features-by-popularity/1772-sort-features-by-popularity.cpp:1

1962-remove-stones-to-minimize-the-total/1962-remove-stones-to-minimize-the-total.cpp:1

115-distinct-subsequences/115-distinct-subsequences.cpp:1

count-square-submatrices-with-all-ones/count-square-submatrices-with-all-ones.cpp:1

1119-remove-vowels-from-a-string/1119-remove-vowels-from-a-string.cpp:1

* Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode() : val(0), next(nullptr) {} * L

445-add-two-numbers-ii/445-add-two-numbers-ii.cpp:11

* Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(

236-lowest-common-ancestor-of-a-binary-tree/236-lowest-common-ancestor-of-a-binary-tree.cpp:10

* Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), l

subtree-of-another-tree/subtree-of-another-tree.cpp:12

495-teemo-attacking/495-teemo-attacking.cpp:1

168-excel-sheet-column-title/168-excel-sheet-column-title.cpp:1

1496-path-crossing/1496-path-crossing.cpp:1

506-relative-ranks/506-relative-ranks.cpp:1

2033-minimum-operations-to-make-a-uni-value-grid/2033-minimum-operations-to-make-a-uni-value-grid.cpp:1

1314-matrix-block-sum/1314-matrix-block-sum.cpp:1

2062-count-vowel-substrings-of-a-string/2062-count-vowel-substrings-of-a-string.cpp:1

* Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode() : val(0), next(nullptr) {} * L

1019-next-greater-node-in-linked-list/1019-next-greater-node-in-linked-list.cpp:11

1265-print-immutable-linked-list-in-reverse/1265-print-immutable-linked-list-in-reverse.cpp:11

921-minimum-add-to-make-parentheses-valid/921-minimum-add-to-make-parentheses-valid.cpp:1

} Driver Code Ends

Minimum sum partition - GFG/minimum-sum-partition.cpp:6

* Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode() : val(0), next(nullptr) {} * L

1669-merge-in-between-linked-lists/1669-merge-in-between-linked-lists.cpp:11

* Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), l

108-convert-sorted-array-to-binary-search-tree/108-convert-sorted-array-to-binary-search-tree.cpp:12

* Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), l

0865-smallest-subtree-with-all-the-deepest-nodes/0865-smallest-subtree-with-all-the-deepest-nodes.cpp:12

validate-binary-tree-nodes/validate-binary-tree-nodes.cpp:1

2169-count-operations-to-obtain-zero/2169-count-operations-to-obtain-zero.cpp:1

1154-day-of-the-year/1154-day-of-the-year.cpp:1

} Driver Code Ends

Sum of elements between k1'th and k2'th smallest elements - GFG/sum-of-elements-between-k1th-and-k2th-smallest-elements.cpp:6

2073-time-needed-to-buy-tickets/2073-time-needed-to-buy-tickets.cpp:1

1490-clone-n-ary-tree/1490-clone-n-ary-tree.cpp:21

590-n-ary-tree-postorder-traversal/590-n-ary-tree-postorder-traversal.cpp:21

1837-sum-of-digits-in-base-k/1837-sum-of-digits-in-base-k.cpp:1

1556-thousand-separator/1556-thousand-separator.cpp:1

946-validate-stack-sequences/946-validate-stack-sequences.cpp:1

reachable-nodes-in-subdivided-graph/reachable-nodes-in-subdivided-graph.cpp:1

209-minimum-size-subarray-sum/209-minimum-size-subarray-sum.cpp:1

1763-longest-nice-substring/1763-longest-nice-substring.cpp:1

* Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode() : val(0), next(nullptr) {} * L

83-remove-duplicates-from-sorted-list/83-remove-duplicates-from-sorted-list.cpp:11

1985-find-the-kth-largest-integer-in-the-array/1985-find-the-kth-largest-integer-in-the-array.cpp:1

422-valid-word-square/422-valid-word-square.cpp:1

2047-number-of-valid-words-in-a-sentence/2047-number-of-valid-words-in-a-sentence.cpp:1

785-is-graph-bipartite/785-is-graph-bipartite.cpp:1

* Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), l

0652-find-duplicate-subtrees/0652-find-duplicate-subtrees.cpp:12

796-rotate-string/796-rotate-string.cpp:1

* Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), l

1026-maximum-difference-between-node-and-ancestor/1026-maximum-difference-between-node-and-ancestor.cpp:12

number-of-ways-to-arrive-at-destination/number-of-ways-to-arrive-at-destination.cpp:1

344-reverse-string/344-reverse-string.cpp:1

1630-arithmetic-subarrays/1630-arithmetic-subarrays.cpp:1

747-largest-number-at-least-twice-of-others/747-largest-number-at-least-twice-of-others.cpp:1

1941-check-if-all-characters-have-equal-number-of-occurrences/1941-check-if-all-characters-have-equal-number-of-occurrences.cpp:1

* Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode() : val(0), next(nullptr) {} * L

382-linked-list-random-node/382-linked-list-random-node.cpp:11

1592-rearrange-spaces-between-words/1592-rearrange-spaces-between-words.cpp:1

1043-partition-array-for-maximum-sum/1043-partition-array-for-maximum-sum.cpp:1

0990-satisfiability-of-equality-equations/0990-satisfiability-of-equality-equations.cpp:1

1976-number-of-ways-to-arrive-at-destination/1976-number-of-ways-to-arrive-at-destination.cpp:1

520-detect-capital/520-detect-capital.cpp:1

2119-a-number-after-a-double-reversal/2119-a-number-after-a-double-reversal.cpp:1

} Driver Code Ends

Longest Sub-Array with Sum K - GFG/longest-sub-array-with-sum-k.cpp:7

0386-lexicographical-numbers/0386-lexicographical-numbers.cpp:1

* Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), l

783-minimum-distance-between-bst-nodes/783-minimum-distance-between-bst-nodes.cpp:12

1624-largest-substring-between-two-equal-characters/1624-largest-substring-between-two-equal-characters.cpp:1

} Driver Code Ends

Longest Common Substring - GFG/longest-common-substring.cpp:6

4-median-of-two-sorted-arrays/4-median-of-two-sorted-arrays.cpp:1

455-assign-cookies/455-assign-cookies.cpp:1

1791-find-center-of-star-graph/1791-find-center-of-star-graph.cpp:1

Longest K unique characters substring - GFG/longest-k-unique-characters-substring.cpp:10

852-peak-index-in-a-mountain-array/852-peak-index-in-a-mountain-array.cpp:1

210-course-schedule-ii/210-course-schedule-ii.cpp:1

2133-check-if-every-row-and-column-contains-all-numbers/2133-check-if-every-row-and-column-contains-all-numbers.cpp:1

3sum/3sum.cpp:1

1523-count-odd-numbers-in-an-interval-range/1523-count-odd-numbers-in-an-interval-range.cpp:1

1863-sum-of-all-subset-xor-totals/1863-sum-of-all-subset-xor-totals.cpp:1

next →1–100 of 605, ranked by callers