Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/Amanhacker/Aman-Barnwal-Leetcode-Solutions
/ functions
Functions
931 in github.com/Amanhacker/Aman-Barnwal-Leetcode-Solutions
⨍
Functions
931
◇
Types & classes
605
Method
findMinMax
1026-maximum-difference-between-node-and-ancestor/1026-maximum-difference-between-node-and-ancestor.cpp:15
Method
findMode
501-find-mode-in-binary-search-tree/501-find-mode-in-binary-search-tree.cpp:31
Method
findNearestRightNode
1602-find-nearest-right-node-in-binary-tree/1602-find-nearest-right-node-in-binary-tree.cpp:60
Method
findNoOfAttempts
1884-egg-drop-with-2-eggs-and-n-floors/1884-egg-drop-with-2-eggs-and-n-floors.cpp:6
Method
findNumber
1022-sum-of-root-to-leaf-binary-numbers/1022-sum-of-root-to-leaf-binary-numbers.cpp:15
Method
findOrder
210-course-schedule-ii/210-course-schedule-ii.cpp:60
Method
findPeakGrid
1901-find-a-peak-element-ii/1901-find-a-peak-element-ii.cpp:4
Method
findPoisonedDuration
495-teemo-attacking/495-teemo-attacking.cpp:4
Method
findPower
To find the power of a^m
1134-armstrong-number/1134-armstrong-number.cpp:5
Method
findRedundantConnection
684-redundant-connection/684-redundant-connection.cpp:26
Method
findRelativeRanks
506-relative-ranks/506-relative-ranks.cpp:4
Method
findRequired
1736-latest-time-by-replacing-hidden-digits/1736-latest-time-by-replacing-hidden-digits.cpp:4
Method
findSecondMinimumValue
671-second-minimum-node-in-a-binary-tree/671-second-minimum-node-in-a-binary-tree.cpp:27
Method
findSmallestSetOfVertices
1557-minimum-number-of-vertices-to-reach-all-nodes/1557-minimum-number-of-vertices-to-reach-all-nodes.cpp:4
Method
findString
412-fizz-buzz/412-fizz-buzz.cpp:4
Method
findSubtreeSum
0508-most-frequent-subtree-sum/0508-most-frequent-subtree-sum.cpp:15
Method
findTarget
653-two-sum-iv-input-is-a-bst/653-two-sum-iv-input-is-a-bst.cpp:27
Method
findTheCity
1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance.cpp:52
Method
findTilt
563-binary-tree-tilt/563-binary-tree-tilt.cpp:50
Method
findWords
500-keyboard-row/500-keyboard-row.cpp:4
Method
firstPalindrome
2108-find-first-palindromic-string-in-the-array/2108-find-first-palindromic-string-in-the-array.cpp:21
Method
firstUniqChar
387-first-unique-character-in-a-string/387-first-unique-character-in-a-string.cpp:4
Method
fixedPoint
1064-fixed-point/1064-fixed-point.cpp:4
Method
fizzBuzz
412-fizz-buzz/412-fizz-buzz.cpp:12
Method
flatten
114-flatten-binary-tree-to-linked-list/114-flatten-binary-tree-to-linked-list.cpp:17
Method
flipEquiv
951-flip-equivalent-binary-trees/951-flip-equivalent-binary-trees.cpp:15
Method
flipEquiv
0951-flip-equivalent-binary-trees/0951-flip-equivalent-binary-trees.cpp:15
Method
floodFill
733-flood-fill/733-flood-fill.cpp:49
Method
fourSum
4sum/4sum.cpp:4
Method
frequencySort
451-sort-characters-by-frequency/451-sort-characters-by-frequency.cpp:4
Method
furthestBuilding
(int[] heights, int bricks, int ladders)
1642-furthest-building-you-can-reach/1642-furthest-building-you-can-reach.java:3
Method
furthestBuilding
1642-furthest-building-you-can-reach/1642-furthest-building-you-can-reach.cpp:6
Method
gcd
Here, we assume that a > b
1979-find-greatest-common-divisor-of-array/1979-find-greatest-common-divisor-of-array.cpp:5
Method
gcdOfStrings
1071-greatest-common-divisor-of-strings/1071-greatest-common-divisor-of-strings.cpp:4
Method
generate
118-pascals-triangle/118-pascals-triangle.cpp:4
Method
generateHelper
22-generate-parentheses/22-generate-parentheses.cpp:6
Method
generateParenthesis
22-generate-parentheses/22-generate-parentheses.cpp:28
Method
generateTreeHelper
0095-unique-binary-search-trees-ii/0095-unique-binary-search-trees-ii.cpp:15
Method
generateTrees
0095-unique-binary-search-trees-ii/0095-unique-binary-search-trees-ii.cpp:58
Method
get
706-design-hashmap/706-design-hashmap.cpp:16
Method
getAncestors
2192-all-ancestors-of-a-node-in-a-directed-acyclic-graph/2192-all-ancestors-of-a-node-in-a-directed-acyclic-graph.cpp:19
Method
getAverageTime
1396-design-underground-system/1396-design-underground-system.cpp:32
Method
getConcatenation
1929-concatenation-of-array/1929-concatenation-of-array.cpp:4
Method
getDecimalValue
1290-convert-binary-number-in-a-linked-list-to-integer/1290-convert-binary-number-in-a-linked-list-to-integer.cpp:14
Method
getHappyString
1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n/1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n.cpp:30
Method
getIntersectionNode
160-intersection-of-two-linked-lists/160-intersection-of-two-linked-lists.cpp:12
Method
getLonelyNodes
1469-find-all-the-lonely-nodes/1469-find-all-the-lonely-nodes.cpp:31
Method
getLucky
1945-sum-of-digits-of-string-after-convert/1945-sum-of-digits-of-string-after-convert.cpp:4
Method
getMaxLen
1567-maximum-length-of-subarray-with-positive-product/1567-maximum-length-of-subarray-with-positive-product.cpp:4
Method
getMin
155-min-stack/155-min-stack.cpp:30
Method
getMinSwaps
1850-minimum-adjacent-swaps-to-reach-the-kth-smallest-number/1850-minimum-adjacent-swaps-to-reach-the-kth-smallest-number.cpp:25
Method
getNoZeroIntegers
1317-convert-integer-to-the-sum-of-two-no-zero-integers/1317-convert-integer-to-the-sum-of-two-no-zero-integers.cpp:18
Method
getProduct
1352-product-of-the-last-k-numbers/1352-product-of-the-last-k-numbers.cpp:21
Method
getRandom
382-linked-list-random-node/382-linked-list-random-node.cpp:27
Method
getTargetCopy
find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree.cpp:38
Method
goodNodes
1448-count-good-nodes-in-binary-tree/1448-count-good-nodes-in-binary-tree.cpp:46
Method
groupAnagrams
49-group-anagrams/49-group-anagrams.cpp:4
Method
groupStrings
249-group-shifted-strings/249-group-shifted-strings.cpp:4
Method
guessNumber
374-guess-number-higher-or-lower/374-guess-number-higher-or-lower.cpp:13
Method
hammingDistance
461-hamming-distance/461-hamming-distance.cpp:4
Method
hammingWeight
191-number-of-1-bits/191-number-of-1-bits.cpp:4
Method
hasAlternatingBits
693-binary-number-with-alternating-bits/693-binary-number-with-alternating-bits.cpp:4
Method
hasCycle
141-linked-list-cycle/141-linked-list-cycle.cpp:12
Method
hasNext
173-binary-search-tree-iterator/173-binary-search-tree-iterator.cpp:48
Method
hasNext
604-design-compressed-string-iterator/604-design-compressed-string-iterator.cpp:36
Method
hasNext
1286-iterator-for-combination/1286-iterator-for-combination.cpp:46
Method
hasPathSum
112-path-sum/112-path-sum.cpp:34
Method
height
104-maximum-depth-of-binary-tree/104-maximum-depth-of-binary-tree.cpp:15
Method
height
637-average-of-levels-in-binary-tree/637-average-of-levels-in-binary-tree.cpp:15
Method
height
110-balanced-binary-tree/110-balanced-binary-tree.cpp:15
Method
height
111-minimum-depth-of-binary-tree/111-minimum-depth-of-binary-tree.cpp:15
Method
helpCopyRandom
1485-clone-binary-tree-with-random-pointer/1485-clone-binary-tree-with-random-pointer.cpp:19
Method
helper
1530-number-of-good-leaf-nodes-pairs/1530-number-of-good-leaf-nodes-pairs.cpp:16
Method
helper
Boolean Parenthesization - GFG/boolean-parenthesization.cpp:15
Method
helperFindLeaves
366-find-leaves-of-binary-tree/366-find-leaves-of-binary-tree.cpp:15
Method
helperMaxSum
1043-partition-array-for-maximum-sum/1043-partition-array-for-maximum-sum.cpp:4
Method
helperWordBreak
140-word-break-ii/140-word-break-ii.cpp:4
Method
highFive
1086-high-five/1086-high-five.cpp:5
Method
increasingBST
897-increasing-order-search-tree/897-increasing-order-search-tree.cpp:48
Method
increasingBST
increasing-order-search-tree/increasing-order-search-tree.cpp:26
Method
increment
1381-design-a-stack-with-increment-operation/1381-design-a-stack-with-increment-operation.cpp:30
Method
indexPairs
1065-index-pairs-of-a-string/1065-index-pairs-of-a-string.cpp:4
Method
inorder
783-minimum-distance-between-bst-nodes/783-minimum-distance-between-bst-nodes.cpp:15
Method
inorder
742-closest-leaf-in-a-binary-tree/742-closest-leaf-in-a-binary-tree.cpp:24
Method
inorder
173-binary-search-tree-iterator/173-binary-search-tree-iterator.cpp:18
Method
inorder
minimum-distance-between-bst-nodes/minimum-distance-between-bst-nodes.cpp:15
Method
inorder
94-binary-tree-inorder-traversal/94-binary-tree-inorder-traversal.cpp:15
Method
inorder
426-convert-binary-search-tree-to-sorted-doubly-linked-list/426-convert-binary-search-tree-to-sorted-doubly-linked-list.cpp:28
Method
inorder
897-increasing-order-search-tree/897-increasing-order-search-tree.cpp:15
Method
inorder
270-closest-binary-search-tree-value/270-closest-binary-search-tree-value.cpp:17
Method
inorder
find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree.cpp:22
Method
inorder
938-range-sum-of-bst/938-range-sum-of-bst.cpp:15
Method
inorder
increasing-order-search-tree/increasing-order-search-tree.cpp:15
Method
inorder
653-two-sum-iv-input-is-a-bst/653-two-sum-iv-input-is-a-bst.cpp:15
Method
inorder
230-kth-smallest-element-in-a-bst/230-kth-smallest-element-in-a-bst.cpp:15
Method
inorder
balance-a-binary-search-tree/balance-a-binary-search-tree.cpp:15
Method
inorder
0099-recover-binary-search-tree/0099-recover-binary-search-tree.cpp:16
Method
inorder
1644-lowest-common-ancestor-of-a-binary-tree-ii/1644-lowest-common-ancestor-of-a-binary-tree-ii.cpp:30
Method
inorder
98-validate-binary-search-tree/98-validate-binary-search-tree.cpp:15
Method
inorder
872-leaf-similar-trees/872-leaf-similar-trees.cpp:15
← previous
next →
401–500 of 931, ranked by callers