MCPcopy Create free account

hub / github.com/das-jishu/algoexpert-data-structures-algorithms / functions

Functions521 in github.com/das-jishu/algoexpert-data-structures-algorithms

⨍ Functions 521◇ Types & classes 63
↓ 9 callersMethodadd
(self, word)
Hard/boggle-board.py:90
↓ 6 callersMethodswap
(self, i, j, array)
Medium/min-heap-construction.py:49
↓ 6 callersMethodswap
(self, i, j, array)
Hard/sort-k-sorted-array.py:83
↓ 5 callersFunctionbinarySearch
(array, target, left, right, positions)
Hard/search-for-range.py:11
↓ 5 callersFunctioncoordToString
(coord)
Very Hard/rectangle-mania.py:64
↓ 5 callersMethodpeek
(self)
Hard/continuous-median.py:81
↓ 4 callersFunctioncheckIfDescendant
(currentNode, targetNode)
Hard/validate-three-nodes.py:23
↓ 4 callersMethodinsert
(self, value)
Medium/min-height-BST.py:27
↓ 4 callersMethodinsert
(self, value)
Hard/continuous-median.py:91
↓ 4 callersFunctionisValidPart
(string)
Medium/valid-ip-addresses.py:24
↓ 4 callersFunctionmarkAllBorderBlacks
(matrix, i, j)
Medium/remove-islands.py:29
↓ 4 callersFunctionreverseLinkedList
(head)
Hard/inverted-bisection.py:38
↓ 4 callersMethodsiftDown
(self, start, array)
Medium/min-heap-construction.py:23
↓ 4 callersMethodsiftDown
(self, start, array)
Hard/sort-k-sorted-array.py:57
↓ 4 callersFunctionswap
(array, one, two)
Hard/quick-sort.py:37
↓ 3 callersFunctionaddSubtreeNodesAtDistanceK
(node, distance, k, nodesDistanceK)
Hard/find-nodes-distance-k.py:99
↓ 3 callersFunctioncalculateMaxPathSum
(node)
Hard/max-path-sum-binary-trees.py:10
↓ 3 callersFunctionconvertPointToString
(x, y)
Very Hard/minimum-area-rectangle.py:75
↓ 3 callersFunctionfactorial
(n)
Medium/number-of-ways-to-traverse-graph.py:34
↓ 3 callersFunctiongetCoordsTable
(coords)
Very Hard/rectangle-mania.py:10
↓ 3 callersFunctiongetRectangleCount
(coords, coordsTable)
Very Hard/rectangle-mania.py:37
↓ 3 callersFunctionisSquareOfZeroes
(matrix, r1, c1, r2, c2)
Very Hard/square-of-zeroes.py:19
↓ 3 callersMethodremove
(self, node)
Medium/linked-list-construction.py:93
↓ 3 callersMethodswap
(self, i, j, heap)
Very Hard/A-star-algorithm.py:167
↓ 3 callersMethodswap
(self, i, j, heap)
Very Hard/merge-sorted-arrays.py:97
↓ 3 callersMethodswap
(self, i, j, heap)
Hard/laptop-rentals.py:88
↓ 3 callersMethodswap
(self, i, j, array)
Hard/dijkstra-algorithm.py:142
↓ 3 callersMethodswap
(self, i, j, array)
Hard/continuous-median.py:96
↓ 3 callersFunctionupdateResult
(largestNumbers, num, index)
Easy/find-three-largest-numbers.py:45
↓ 2 callersMethodaddNode
(self, job)
Hard/topological-sort.py:53
↓ 2 callersFunctionareInterwoven
(one, two, three, i, j)
Hard/interweaving-strings.py:35
↓ 2 callersMethodbuildHeap
(self, array)
Medium/min-heap-construction.py:14
↓ 2 callersMethodbuildHeap
(self, array)
Hard/sort-k-sorted-array.py:49
↓ 2 callersFunctionbuildSequence
(array, sequences, start)
Very Hard/longest-increasing-subsequence.py:21
↓ 2 callersFunctionbuildSequence
(maxHeights, disks)
Hard/disk-stacking.py:38
↓ 2 callersFunctioncalculateManhattanDistance
(currentNode, endNode)
Very Hard/A-star-algorithm.py:68
↓ 2 callersFunctionclockwiseCountRectangles
(coord, coordsTable, direction, origin)
Very Hard/rectangle-mania.py:43
↓ 2 callersFunctionconnectLeafNodes
(currentNode, head=None, previousNode=None)
Very Hard/compare-leaf-traversal.py:28
↓ 2 callersFunctionconnectNodes
(left, right)
Very Hard/flatten-binary-tree.py:97
↓ 2 callersFunctiondistanceBetween
(a, b)
Very Hard/apartment-hunting.py:66
↓ 2 callersFunctionfindDegrees
(friendsLists, person, degrees, visited, level)
Medium/degrees-of-separation.py:31
↓ 2 callersFunctionfindMinDistance
(distances, visited)
Hard/dijkstra-algorithm.py:29
↓ 2 callersFunctionfindMinSpaces
(pi, index, number, spaceCount)
Hard/numbers-pi.py:13
↓ 2 callersFunctionfindNextCharacter
(pattern, index)
Hard/glob-matching.py:44
↓ 2 callersFunctiongetIdxOfFirstBiggerOrEqual
(array, startingIdx, maxVal)
Hard/same-bsts.py:54
↓ 2 callersFunctiongetIdxOfFirstSmaller
(array, startingIdx, minVal)
Hard/same-bsts.py:47
↓ 2 callersFunctiongetLongestBalancedInDirection
(string, leftToRight)
Very Hard/longest-balanced-substring.py:67
↓ 2 callersFunctiongetLongestPalindrome
(string, i, j)
Medium/longest-palindromic-substring.py:20
↓ 2 callersMethodgetNode
(self, job)
Hard/topological-sort.py:57
↓ 2 callersFunctiongetUnconnectedPeople
(friendsLists, degrees)
Medium/degrees-of-separation.py:47
↓ 2 callersFunctionincreaseCharCount
(char, charCounts)
Very Hard/smallest-substring-containing.py:56
↓ 2 callersMethodinsert
(self, node)
Very Hard/A-star-algorithm.py:162
↓ 2 callersMethodinsert
(self, value, idx, numSmallerAtInsertTime=0)
Very Hard/right-smaller-than.py:48
↓ 2 callersMethodinsert
(self, value)
Hard/sort-k-sorted-array.py:104
↓ 2 callersMethodinsertBefore
(self, node, nodeToInsert)
Medium/linked-list-construction.py:36
↓ 2 callersMethodisEmpty
(self)
Very Hard/A-star-algorithm.py:117
↓ 2 callersMethodisEmpty
(self)
Hard/sort-k-sorted-array.py:45
↓ 2 callersFunctionmaxSubsetSumNoAdjacent
(array, i=0)
Medium/max-subset-sum-no-adjacent.py:5
↓ 2 callersFunctionmergeTwoArrays
(array1, array2)
Very Hard/merge-sort.py:16
↓ 2 callersFunctionminNumberOfCoinsForChangeHelper
(n, denoms, known)
Medium/min-number-of-coins-for-change.py:9
↓ 2 callersFunctionminutesToTime
(minutes)
Very Hard/calendar-matching.py:67
↓ 2 callersFunctionpreComputeNumOfZeroes
(matrix)
Very Hard/square-of-zeroes.py:64
↓ 2 callersFunctionquickSortHelper
(array, low, high)
Hard/quick-sort.py:20
↓ 2 callersFunctionrelaxEdgesAndUpdateDistances
(graph, distances)
Very Hard/detect-arbitrage.py:23
↓ 2 callersMethodremove
(self)
Hard/sort-k-sorted-array.py:92
↓ 2 callersMethodremove
(self)
Hard/continuous-median.py:84
↓ 2 callersMethodremoveTail
(self)
Very Hard/LRU-cache.py:79
↓ 2 callersFunctionreverseListRange
(list, start, end)
Medium/reverse-words-in-string.py:36
↓ 2 callersFunctionsiftDown
(currentIdx, endIdx, heap)
Hard/heap-sort.py:18
↓ 2 callersMethodsiftDown
(self, currentIdx, endIdx, heap)
Very Hard/A-star-algorithm.py:126
↓ 2 callersMethodsiftDown
(self, currentIdx, endIdx, heap)
Very Hard/merge-sorted-arrays.py:65
↓ 2 callersMethodsiftDown
(self, currentIdx, endIdx, heap)
Hard/laptop-rentals.py:53
↓ 2 callersMethodsiftDown
(self, start, endIdx, heap)
Hard/dijkstra-algorithm.py:117
↓ 2 callersMethodsiftDown
(self, currentIdx, endIdx, heap)
Hard/continuous-median.py:53
↓ 2 callersMethodsiftUp
(self, start, array)
Medium/min-heap-construction.py:40
↓ 2 callersMethodsiftUp
(self, currentIdx, heap)
Very Hard/A-star-algorithm.py:145
↓ 2 callersMethodsiftUp
(self, start, array)
Hard/sort-k-sorted-array.py:74
↓ 2 callersFunctionsolvePartialSudoku
(row, col, board)
Hard/solve-sudoku.py:10
↓ 2 callersFunctionswap
(array, i, j)
Medium/permutations.py:39
↓ 2 callersFunctionswap
(one, two, array)
Hard/quickselect.py:33
↓ 2 callersFunctionswap
(i, j, array)
Hard/heap-sort.py:36
↓ 2 callersFunctiontimeToMinutes
(time)
Very Hard/calendar-matching.py:63
↓ 2 callersMethodupdate
(self, vertex, value)
Hard/dijkstra-algorithm.py:156
↓ 2 callersFunctionupdateCalendar
(calendar, dailyBounds)
Very Hard/calendar-matching.py:13
↓ 2 callersMethodupdateMostRecent
(self, node)
Very Hard/LRU-cache.py:47
↓ 1 callersFunctionaddNodeCounts
(node, nodeCounts)
Very Hard/all-kinds-of-node-depths.py:86
↓ 1 callersFunctionaddNodeDepths
(node, nodeDepths, nodeCounts)
Very Hard/all-kinds-of-node-depths.py:77
↓ 1 callersMethodaddPrereq
(self, job, prereq)
Hard/topological-sort.py:48
↓ 1 callersFunctionareAllVerticesVisited
(arrivalTimes)
Very Hard/two-edge-connected-graph.py:18
↓ 1 callersFunctionareSameBsts
(arrayOne, arrayTwo, rootIdxOne, rootIdxTwo, minVal, maxVal)
Hard/same-bsts.py:29
↓ 1 callersFunctionareValidDimensions
(o, c)
Hard/disk-stacking.py:69
↓ 1 callersFunctionbinarySearch
(startIdx, endIdx, indices, array, num)
Very Hard/longest-increasing-subsequence.py:41
↓ 1 callersFunctionbinarySearch
(array, target, left, right)
Hard/shifted-binary-search.py:9
↓ 1 callersFunctionbinaryTreeHelper
(tree, longestDiameter)
Medium/binary-tree-diameter.py:18
↓ 1 callersFunctionbreadthFirstSearchForNodesDistanceK
(targetNode, nodesToParents, k)
Hard/find-nodes-distance-k.py:20
↓ 1 callersFunctionbuildHeap
(array)
Hard/heap-sort.py:13
↓ 1 callersMethodbuildHeap
(self, array)
Very Hard/A-star-algorithm.py:120
↓ 1 callersMethodbuildHeap
(self, array)
Very Hard/merge-sorted-arrays.py:59
↓ 1 callersMethodbuildHeap
(self, array)
Hard/laptop-rentals.py:47
↓ 1 callersMethodbuildHeap
(self, array)
Hard/dijkstra-algorithm.py:108
next →1–100 of 521, ranked by callers