Types & classes — github.com/deepaktalwardt/interview-prep-cpp

CodeHub MCPcopy Create free account

hub / github.com/deepaktalwardt/interview-prep-cpp / types & classes

Types & classes134 in github.com/deepaktalwardt/interview-prep-cpp

⨍ Functions 288◇ Types & classes 134

↓ 2 callersClasssums

AlgoExpert/max-path-sum-in-binary-tree.cpp:14

↓ 1 callersClassDegrees

LeetCode/277-find-the-celebrity.cpp:30

↓ 1 callersClassKeyWithFreq

LeetCode/692-top-k-frequent-words.cpp:6

↓ 1 callersClassKeyWithFreq

LeetCode/347-top-k-frequent-elements.cpp:3

ClassAncestralTree

AlgoExpert/youngest-common-ancestor.cpp:4

AlgoExpert/bst-traversal.cpp:4

AlgoExpert/validate-bst.cpp:1

AlgoExpert/find-closest-in-bst.cpp:7

ClassBalanceHeight

LeetCode/110-balanced-binary-tree.cpp:3

ClassBinaryTree

AlgoExpert/max-path-sum-in-binary-tree.cpp:4

ClassBinaryTree

AlgoExpert/invert-binary-tree.cpp:4

ClassBinaryTree

This is the class of the input root. Do not edit it.

AlgoExpert/branch-sums.cpp:4

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

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

ClassContinuousMedianHandler

Do not edit the class below except for the insert method. Feel free to add new properties and methods to the class.

AlgoExpert/contiunous-median.cpp:8

ClassHitCounter

LeetCode/362-design-hit-counter.cpp:2

AlgoExpert/lowest-common-manager.cpp:17

ClassLinkedList

AlgoExpert/remove-kth-node-from-end.cpp:4

ClassLinkedList

AlgoExpert/find-loop.cpp:4

ClassLinkedList

AlgoExpert/reverse-linked-list.cpp:3

LeetCode/359-logger-rate-limiter.cpp:3

Do not edit the class below except for the buildHeap, siftDown, siftUp, peek, remove, and insert methods. Feel free to add new properties and methods

AlgoExpert/min-heap-construction.cpp:7

Do not edit the class below except for the breadthFirstSearch method. Feel free to add new properties and methods to the class.

AlgoExpert/breadth-first-search.cpp:9

Do not edit the class below except for the depthFirstSearch method. Feel free to add new properties and methods to the class.

AlgoExpert/depth-first-search.cpp:9

Pramp/interview-5/sales-path.cpp:6

LeetCode/308-range-sum-query-2d-mutable.cpp:1

AlgoExpert/lowest-common-manager.cpp:4

LeetCode/939-minimum-area-rectangle.cpp:7

AlgoExpert/rectangle-mania.cpp:5

ClassSerializationTraits<Star>

EPI/10-4-k-closest-stars.cpp:47

LeetCode/42-trapping-rain-water.cpp:1

LeetCode/91-decode-ways.cpp:1

LeetCode/841-keys-and-rooms.cpp:2

LeetCode/681-next-closest-time.cpp:1

LeetCode/5-longest-palindromic-substring.cpp:4

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

LeetCode/141-linked-list-cycle.cpp:9

Easy to read solution

LeetCode/7-reverse-integer.cpp:2

Hashset method O(n) time | O(n) space

LeetCode/136-single-number.cpp:3

LeetCode/238-product-of-array-except-self.cpp:1

LeetCode/994-rotting-oranges.cpp:4

LeetCode/268-missing-number.cpp:1

LeetCode/1135-connecting-cities-with-minimum-cost.cpp:1

Faster Solution as we don't clear the hashmap each time

LeetCode/159-longest-substring-with-two-distinct-chars.cpp:2

LeetCode/54-spiral-matrix.cpp:2

LeetCode/118-pascals-triangle.cpp:1

LeetCode/1102-path-with-maximum-minimum-value.cpp:6

LeetCode/323-components-in-undirected-graph.cpp:4

LeetCode/19-remove-nth-node-from-end-of-list.cpp:10

LeetCode/121-best-time-to-buy-and-sell-stock.cpp:1

LeetCode/14-longest-common-prefix.cpp:1

Iterative solution

LeetCode/33-search-in-rotated-sorted-array.cpp:2

LeetCode/59-spiral-matrix-ii.cpp:1

* // This is the interface that allows for creating nested lists. * // You should not implement it, or speculate about its implementation * class

LeetCode/364-nested-list-weight-sum-ii.cpp:30

LeetCode/49-group-anagrams.cpp:1

LeetCode/200-number-of-islands.cpp:6

LeetCode/561-array-partition-i.cpp:3

LeetCode/939-minimum-area-rectangle.cpp:5

LeetCode/322-coin-change.cpp:1

LeetCode/88-merge-sorted-array.cpp:1

LeetCode/917-reverse-only-letters.cpp:5

LeetCode/104-maximum-depth-of-binary-tree.cpp:1

LeetCode/48-rotate-image.cpp:1

LeetCode/661-image-smoother.cpp:1

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

LeetCode/105-construct-binary-tree-from-preorder-and-inorder-traversal.cpp:10

LeetCode/253-meeting-rooms-ii.cpp:4

LeetCode/617-merge-two-binary-trees.cpp:1

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

LeetCode/2-add-two-numbers.cpp:9

LeetCode/983-minimum-cost-for-tickets.cpp:1

LeetCode/572-subtree-of-another-tree.cpp:1

LeetCode/23-merge-k-sorted-lists.cpp:12

LeetCode/904-fruit-into-baskets.cpp:1

LeetCode/11-container-with-most-water.cpp:1

Time: O(N), Space: O(1)

LeetCode/299-bulls-and-cows.cpp:2

LeetCode/20-valid-parentheses.cpp:2

LeetCode/323-number-of-connected-components-in-undirected-graph.cpp:1

LeetCode/207-course-schedule.cpp:4

LeetCode/277-find-the-celebrity.cpp:5

Dynamic Programming: Time O(mn), Space: O(mn)

LeetCode/221-maximal-square.cpp:2

LeetCode/46-permutations.cpp:1

Recursive DFS (Fast)

LeetCode/79-word-search.cpp:2

Time: O(N), Space: O(N)

LeetCode/746-min-cost-climbing-stairs.cpp:2

LeetCode/1055-shortest-way-to-form-string.cpp:1

LeetCode/692-top-k-frequent-words.cpp:4

LeetCode/531-lonely-pixel-i.cpp:1

LeetCode/937-reorder-data-in-log-files.cpp:4

LeetCode/283-move-zeroes.cpp:3

LeetCode/81-search-in-rotated-sorted-array-ii.cpp:1

LeetCode/3-longest-substring-without-repeating-characters.cpp:3

LeetCode/70-climbing-stairs.cpp:1

LeetCode/286-walls-and-gates.cpp:1

LeetCode/289-game-of-life.cpp:1

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

LeetCode/100-same-tree.cpp:10

LeetCode/867-transpose-matrix.cpp:1

LeetCode/399-evaluate-division.cpp:1

LeetCode/953-verifying-an-alien-dictionary.cpp:3

LeetCode/929-unique-email-addresses.cpp:1

LeetCode/101-symmetric-tree.cpp:1

LeetCode/15-3sum.cpp:2

LeetCode/743-network-delay-time.cpp:4

LeetCode/229-majority-element-ii.cpp:5

LeetCode/132-palindrome-partitioning.cpp:1

next →1–100 of 134, ranked by callers