MCPcopy Create free account

hub / github.com/akankshakumari393/leetcode / functions

Functions210 in github.com/akankshakumari393/leetcode

⨍ Functions 210◇ Types & classes 8
↓ 4 callersFunctiondfs
(board [][]byte , r int, c int)
130-surrounded-regions/130-surrounded-regions.go:43
↓ 4 callersMethodpop
()
20-valid-parentheses/20-valid-parentheses.go:9
↓ 3 callersFunctionMin
(x, y int)
153-find-minimum-in-rotated-sorted-array/153-find-minimum-in-rotated-sorted-array.go:28
↓ 3 callersFunctionbinarySearch
(arr []int, target int)
74-search-a-2d-matrix/74-search-a-2d-matrix.go:15
↓ 2 callersFunctionCountSort
(mat [][]int, row, col, m, n int)
1329-sort-the-matrix-diagonally/1329-sort-the-matrix-diagonally.go:37
↓ 2 callersMethodGetPrev
(k int)
2296-design-a-text-editor/2296-design-a-text-editor.go:56
↓ 2 callersFunctionisDigit
(c byte)
8-string-to-integer-atoi/8-string-to-integer-atoi.go:57
↓ 2 callersFunctionisDigitOrSign
(c byte)
8-string-to-integer-atoi/8-string-to-integer-atoi.go:65
↓ 2 callersFunctionisPalindrome
(s string, l, r int)
680-valid-palindrome-ii/680-valid-palindrome-ii.go:16
↓ 2 callersFunctionkey
(row, column int)
200-number-of-islands/200-number-of-islands.go:36
↓ 2 callersMethodpush
(b byte)
20-valid-parentheses/20-valid-parentheses.go:5
↓ 1 callersFunctionCategory
(num int)
12-integer-to-roman/12-integer-to-roman.go:12
↓ 1 callersFunctionDynamic
(m int, n int, N int, startRow int, startColumn int)
576-out-of-boundary-paths/576-out-of-boundary-paths.go:18
↓ 1 callersFunctionGetMorse
(word string)
804-unique-morse-code-words/804-unique-morse-code-words.go:11
↓ 1 callersFunctionHelper
(start int, end int , root **Event)
729-my-calendar-i/729-my-calendar-i.go:27
↓ 1 callersFunctionIsSafe
(x int, y int, R int, C int)
289-game-of-life/289-game-of-life.go:42
↓ 1 callersFunctionIsSymmetricTree
For two trees to be mirror images, the following three conditions must be true 1.) Their root node's key must be same 2.) left subtree of left tree an
101-symmetric-tree/101-symmetric-tree.go:22
↓ 1 callersFunctionRecursiveSolution
Start from top right element
240-search-a-2d-matrix-ii/240-search-a-2d-matrix-ii.go:8
↓ 1 callersMethodRemove
(key int)
705-design-hashset/705-design-hashset.go:20
↓ 1 callersFunctionaddNodetolevel
(root *TreeNode, level int, ans *[][]int)
102-binary-tree-level-order-traversal/102-binary-tree-level-order-traversal.go:15
↓ 1 callersFunctionbacktrack
(res *[]string, path string, open int, cl int)
22-generate-parentheses/22-generate-parentheses.go:8
↓ 1 callersFunctionbacktrack
(pos int, entry string, candidates string, res *[]string)
17-letter-combinations-of-a-phone-number/17-letter-combinations-of-a-phone-number.go:23
↓ 1 callersFunctionbacktrack
backtrack --- answer at every node
40-combination-sum-ii/40-combination-sum-ii.go:42
↓ 1 callersFunctionbacktrack
(start int, nums []int, entry *[]int, res *[][]int)
78-subsets/78-subsets.go:28
↓ 1 callersFunctionbacktrack
(pos int, candidates []int, entry []int, res *[][]int)
90-subsets-ii/90-subsets-ii.go:10
↓ 1 callersFunctionbacktrack
backtrack --- answer at every node
216-combination-sum-iii/216-combination-sum-iii.go:15
↓ 1 callersFunctionbacktrack
backtrack --- answer at every node
39-combination-sum/39-combination-sum.go:42
↓ 1 callersFunctionbacktrack
(pos int, s string, current *[]string, result *[][]string)
131-palindrome-partitioning/131-palindrome-partitioning.go:8
↓ 1 callersFunctioncheck
(word string, pattern string)
890-find-and-replace-pattern/890-find-and-replace-pattern.go:14
↓ 1 callersFunctioncheckIsland
(visitedElement map[string]bool, grid [][]byte, row, column int)
200-number-of-islands/200-number-of-islands.go:13
↓ 1 callersFunctionclone
(node *Node, hm map[int]*Node)
133-clone-graph/133-clone-graph.go:15
↓ 1 callersFunctionfindCombination
T: O(n!) S: O(n!)
77-combinations/77-combinations.go:13
↓ 1 callersFunctionfindMaxSum
(weights []int)
410-split-array-largest-sum/410-split-array-largest-sum.go:1
↓ 1 callersFunctionfindMaxSum
(weights []int)
1011-capacity-to-ship-packages-within-d-days/1011-capacity-to-ship-packages-within-d-days.go:31
↓ 1 callersFunctionfindMinMax
(bloomDay []int)
1482-minimum-number-of-days-to-make-m-bouquets/1482-minimum-number-of-days-to-make-m-bouquets.go:44
↓ 1 callersFunctionfindPermutation
T: O(n!) S: O(n!)
46-permutations/46-permutations.go:9
↓ 1 callersFunctiongetCurPosGretThanPrev
(prev_pos int, arr []int)
792-number-of-matching-subsequences/792-number-of-matching-subsequences.go:33
↓ 1 callersFunctiongetPossibleBookies
This method is to find the number of bouquets that can be formed on a given day.
1482-minimum-number-of-days-to-make-m-bouquets/1482-minimum-number-of-days-to-make-m-bouquets.go:24
↓ 1 callersFunctionheightOfTree
(root *TreeNode, max *float64)
543-diameter-of-binary-tree/543-diameter-of-binary-tree.go:16
↓ 1 callersFunctioninorder
(root *TreeNode, ans *[]int)
94-binary-tree-inorder-traversal/94-binary-tree-inorder-traversal.go:15
↓ 1 callersFunctionisDigitOrSignOrWhitespace
(c byte)
8-string-to-integer-atoi/8-string-to-integer-atoi.go:73
↓ 1 callersFunctionisPalindrome
(str string)
131-palindrome-partitioning/131-palindrome-partitioning.go:26
↓ 1 callersFunctionisValid
(root *TreeNode, min int, max int)
98-validate-binary-search-tree/98-validate-binary-search-tree.go:13
↓ 1 callersFunctionlevelOrder
(current *TreeNode, result *[]int, level int)
199-binary-tree-right-side-view/199-binary-tree-right-side-view.go:15
↓ 1 callersFunctionmax
(a, b int)
121-best-time-to-buy-and-sell-stock/121-best-time-to-buy-and-sell-stock.go:72
↓ 1 callersFunctionmaximum
(x, y int)
695-max-area-of-island/695-max-area-of-island.go:28
↓ 1 callersFunctionmin
(a, b int)
121-best-time-to-buy-and-sell-stock/121-best-time-to-buy-and-sell-stock.go:65
↓ 1 callersFunctionrecurse
** * Definition for a binary tree node. * type TreeNode struct { * Val int * Left *TreeNode * Right *TreeNode * } */
1448-count-good-nodes-in-binary-tree/1448-count-good-nodes-in-binary-tree.go:9
↓ 1 callersFunctionsearch
(val int, inorder []int)
105-construct-binary-tree-from-preorder-and-inorder-traversal/105-construct-binary-tree-from-preorder-and-inorder-traversal.go:24
↓ 1 callersFunctionsearchElement
(val int, inorder []int)
106-construct-binary-tree-from-inorder-and-postorder-traversal/106-construct-binary-tree-from-inorder-and-postorder-traversal.go:31
↓ 1 callersFunctionsort
(arr []int)
88-merge-sorted-array/88-merge-sorted-array.go:18
↓ 1 callersFunctiontraverse
(root *TreeNode, ans *[]int)
144-binary-tree-preorder-traversal/144-binary-tree-preorder-traversal.go:10
↓ 1 callersFunctiontraverse
(i, j, R, C int, grid [][]int)
695-max-area-of-island/695-max-area-of-island.go:16
↓ 1 callersFunctiontraverse
(root *TreeNode, ans *[]int)
145-binary-tree-postorder-traversal/145-binary-tree-postorder-traversal.go:19
↓ 1 callersFunctionuniquePathsCombinations
mathematical calculatiosns - combinatiosns
62-unique-paths/62-unique-paths.go:43
↓ 1 callersFunctionusingTwoPointer
(nums1 []int, nums2 []int)
4-median-of-two-sorted-arrays/4-median-of-two-sorted-arrays.go:5
MethodAdd
(point []int)
2013-detect-squares/2013-detect-squares.go:13
MethodAdd
(key int)
705-design-hashset/705-design-hashset.go:14
MethodAddCar
(carType int)
1603-design-parking-system/1603-design-parking-system.go:17
MethodAddText
(text string)
2296-design-a-text-editor/2296-design-a-text-editor.go:17
MethodBook
(start int, end int)
729-my-calendar-i/729-my-calendar-i.go:19
FunctionBruteForceFindPaths
Time complexity 4^n - size of recursion tree Space complexity - depth of recursion tree - o(n)
576-out-of-boundary-paths/576-out-of-boundary-paths.go:8
FunctionConstructor
()
2013-detect-squares/2013-detect-squares.go:6
FunctionConstructor
()
2296-design-a-text-editor/2296-design-a-text-editor.go:7
FunctionConstructor
(big int, medium int, small int)
1603-design-parking-system/1603-design-parking-system.go:8
FunctionConstructor
()
729-my-calendar-i/729-my-calendar-i.go:12
FunctionConstructor
()
705-design-hashset/705-design-hashset.go:7
FunctionConstructor
()
895-maximum-frequency-stack/895-maximum-frequency-stack.go:11
MethodContains
(key int)
705-design-hashset/705-design-hashset.go:29
MethodCount
(point []int)
2013-detect-squares/2013-detect-squares.go:19
MethodCursorLeft
(k int)
2296-design-a-text-editor/2296-design-a-text-editor.go:37
MethodCursorRight
(k int)
2296-design-a-text-editor/2296-design-a-text-editor.go:47
MethodDeleteText
(k int)
2296-design-a-text-editor/2296-design-a-text-editor.go:25
MethodPop
()
895-maximum-frequency-stack/895-maximum-frequency-stack.go:45
MethodPush
* push 5 5 5 5 5 3 3 3 2 2 2 1 group = 5:[5] 4: [5] 3: [5,3,2] 2:[5,3,2] 1 : [5,3,21] maxfreq=5 1st pop 5:[] 4: [5] 3: [5,3,2] 2:[5,3,2] 1 : [5,3,21]
895-maximum-frequency-stack/895-maximum-frequency-stack.go:28
FunctionSort
(mat [][]int, row, col, m, n int)
1329-sort-the-matrix-diagonally/1329-sort-the-matrix-diagonally.go:16
FunctionaddTwoNumbers
** * Definition for singly-linked list. * type ListNode struct { * Val int * Next *ListNode * } */
2-add-two-numbers/2-add-two-numbers.go:8
FunctionaverageOfLevels
** * Definition for a binary tree node. * type TreeNode struct { * Val int * Left *TreeNode * Right *TreeNode * } */
637-average-of-levels-in-binary-tree/637-average-of-levels-in-binary-tree.go:9
FunctionbuildTree
** * Definition for a binary tree node. * type TreeNode struct { * Val int * Left *TreeNode * Right *TreeNode * } */ ** * Example -
106-construct-binary-tree-from-inorder-and-postorder-traversal/106-construct-binary-tree-from-inorder-and-postorder-traversal.go:18
FunctionbuildTree
** * Definition for a binary tree node. * type TreeNode struct { * Val int * Left *TreeNode * Right *TreeNode * } */
105-construct-binary-tree-from-preorder-and-inorder-traversal/105-construct-binary-tree-from-preorder-and-inorder-traversal.go:9
FunctioncanFinish
(numCourses int, prerequisites [][]int)
207-course-schedule/207-course-schedule.go:1
FunctionclimbStairs
(n int)
70-climbing-stairs/70-climbing-stairs.go:1
FunctioncloneGraph
** * Definition for a Node. * type Node struct { * Val int * Neighbors []*Node * } */
133-clone-graph/133-clone-graph.go:9
FunctioncombinationSum
recursion ---- you would get the answer at the end
39-combination-sum/39-combination-sum.go:2
FunctioncombinationSum2
(candidates []int, target int)
40-combination-sum-ii/40-combination-sum-ii.go:1
FunctioncombinationSum3
(k int, n int)
216-combination-sum-iii/216-combination-sum-iii.go:1
Functioncombine
(n int, k int)
77-combinations/77-combinations.go:1
FunctioncontainsDuplicate
(nums []int)
217-contains-duplicate/217-contains-duplicate.go:1
FunctioncontainsNearbyDuplicate
(nums []int, k int)
219-contains-duplicate-ii/219-contains-duplicate-ii.go:1
FunctioncopyRandomList
** * Definition for a Node. * type Node struct { * Val int * Next *Node * Random *Node * } */
138-copy-list-with-random-pointer/138-copy-list-with-random-pointer.go:10
FunctioncountPaths
recursive approach
62-unique-paths/62-unique-paths.go:8
FunctiondeleteDuplicates
** * Definition for singly-linked list. * type ListNode struct { * Val int * Next *ListNode * } */
83-remove-duplicates-from-sorted-list/83-remove-duplicates-from-sorted-list.go:8
FunctiondeleteMiddle
** * Definition for singly-linked list. * type ListNode struct { * Val int * Next *ListNode * } */
2095-delete-the-middle-node-of-a-linked-list/2095-delete-the-middle-node-of-a-linked-list.go:8
FunctiondetectCapitalUse
(word string)
520-detect-capital/520-detect-capital.go:1
FunctiondetectCycle
** * Definition for singly-linked list. * type ListNode struct { * Val int * Next *ListNode * } */
142-linked-list-cycle-ii/142-linked-list-cycle-ii.go:8
FunctiondiagonalSort
(mat [][]int)
1329-sort-the-matrix-diagonally/1329-sort-the-matrix-diagonally.go:1
FunctiondiameterOfBinaryTree
** * Definition for a binary tree node. * type TreeNode struct { * Val int * Left *TreeNode * Right *TreeNode * } */
543-diameter-of-binary-tree/543-diameter-of-binary-tree.go:9
FunctionfindAndReplacePattern
Encoding Decoding, Two map Problem
890-find-and-replace-pattern/890-find-and-replace-pattern.go:2
FunctionfindCenter
(edges [][]int)
1791-find-center-of-star-graph/1791-find-center-of-star-graph.go:1
FunctionfindCombinations
to solve this using recursion we have to maintain that the solution 2d doesn't contain same list
40-combination-sum-ii/40-combination-sum-ii.go:11
next →1–100 of 210, ranked by callers