MCPcopy Create free account

hub / github.com/neetcode-gh/leetcode / functions

Functions3,416 in github.com/neetcode-gh/leetcode

↓ 1 callersFunctiondfs
(root, level, rightSide)
javascript/0199-binary-tree-right-side-view.js:49
↓ 1 callersFunctiondfs
(node, sortedArr)
javascript/0783-minimum-distance-between-bst-nodes.js:27
↓ 1 callersFunctiondfs
(start, end)
javascript/0106-construct-binary-tree-from-inorder-and-postorder-traversal.js:20
↓ 1 callersFunctiondfs
(node)
javascript/2331-evaluate-boolean-binary-tree.js:20
↓ 1 callersFunctiondfs
(start, end)
javascript/0095-unique-binary-search-trees-ii.js:17
↓ 1 callersFunctiondfs
(node1, node2)
javascript/0951-flip-equivalent-binary-trees.js:18
↓ 1 callersFunctiondfs
(root, val)
javascript/0701-insert-into-a-binary-search-tree.js:20
↓ 1 callersFunctiondfs
(graph, source, target, seen)
javascript/0684-redundant-connection.js:30
↓ 1 callersFunctiondfs
(grid, row, rows, col, cols, seen, area = 0)
javascript/0695-max-area-of-island.js:41
↓ 1 callersFunctiondfs
(n)
javascript/0096-unique-binary-search-trees.js:11
↓ 1 callersFunctiondfs
(root, max)
javascript/0543-diameter-of-binary-tree.js:20
↓ 1 callersFunctiondfs
(node, seen)
javascript/0133-clone-graph.js:16
↓ 1 callersFunctiondfs
(curr)
javascript/0206-reverse-linked-list.js:14
↓ 1 callersFunctiondfs
(grid, row, rows, col, cols)
javascript/0200-number-of-islands.js:24
↓ 1 callersFunctiondfs
(node, hashSet)
javascript/1457-pseudo-palindromic-paths-in-a-binary-tree.js:39
↓ 1 callersFunctiondfs
(str, index, memo)
javascript/0091-decode-ways.js:21
↓ 1 callersFunctiondfs
* * @param {string} word * @returns {boolean}
javascript/0472-concatenated-words.js:22
↓ 1 callersFunctiondfs
(root)
javascript/0337-house-robber-iii.js:16
↓ 1 callersFunctiondfs
(node, level)
javascript/0513-find-bottom-left-tree-value.js:20
↓ 1 callersFunctiondfs
(node, max)
javascript/0538-convert-bst-to-greater-tree.js:16
↓ 1 callersFunctiondfs
(rooms, row, col)
javascript/0286-walls-and-gates.js:20
↓ 1 callersFunctiondfs
(node)
javascript/0652-find-duplicate-subtrees.js:30
↓ 1 callersFunctiondfs
(l1, l2, tail, sentinel, carry)
javascript/0002-add-two-numbers.js:32
↓ 1 callersFunctiondfs
(n)
javascript/0894-all-possible-full-binary-trees.js:20
↓ 1 callersFunctiondfs
(root, level, levels)
javascript/0102-binary-tree-level-order-traversal.js:53
↓ 1 callersFunctiondfs
(node, pre)
javascript/0144-binary-tree-preorder-traversal.js:17
↓ 1 callersFunctiondfs
(curr, pre, graph, hasApple)
javascript/1443-minimum-time-to-collect-all-apples-in-a-tree.js:16
↓ 1 callersFunctiondfs
(node, maxValue)
javascript/0124-binary-tree-maximum-path-sum.js:20
↓ 1 callersFunctiondfs
(node)
javascript/0789-minimum-distance-between-two-bst-nodes.js:16
↓ 1 callersFunctiondfs
(tickets, graph, city = 'JFK', path = ['JFK'])
javascript/0332-reconstruct-itinerary.js:14
↓ 1 callersFunctiondfs
(r, c)
javascript/1905-count-sub-islands.js:6
↓ 1 callersFunctiondfs
(root, max, total)
javascript/1448-count-good-nodes-in-binary-tree.js:20
↓ 1 callersFunctiondfs
(board, row, col, word, index)
javascript/0079-word-search.js:18
↓ 1 callersFunctiondfs
(node, totalTime)
javascript/1376-time-needed-to-inform-all-employees.js:27
↓ 1 callersFunctiondfs
(node, strArr)
javascript/0606-construct-string-from-binary-tree.js:20
↓ 1 callersFunctiondfs
(i)
javascript/1361-validate-binary-tree-nodes.js:28
↓ 1 callersFunctiondfs
(p, q)
javascript/0100-same-tree.js:36
↓ 1 callersFunctiondfs
(root, min, max)
javascript/0098-validate-binary-search-tree.js:17
↓ 1 callersFunctiondfs
(node, num)
javascript/0129-sum-root-to-leaf-numbers.js:18
↓ 1 callersFunctiondfs
(node)
javascript/0938-range-sum-of-bst.js:22
↓ 1 callersFunctiondfs
(node)
javascript/1325-delete-leaves-with-a-given-value.js:18
↓ 1 callersFunctiondfs
(root, max, total)
javascript/1448-Count-Good-Nodes-in-Binary-Tree.js:20
↓ 1 callersFunctiondfs
(nums, left, right, memo, result = 0)
javascript/0312-burst-balloons.js:42
↓ 1 callersFunctiondfs
(root)
javascript/0226-invert-binary-tree.js:14
↓ 1 callersFunctiondfs
(i, j)
javascript/0463-island-perimeter.js:4
↓ 1 callersFunctiondfs
(node, graph, visited)
javascript/0261-graph-valid-tree.js:35
↓ 1 callersFunctiondfs
(node, pot)
javascript/0145-binary-tree-postorder-traversal.js:17
↓ 1 callersFunctiondfs
(root, k, inOrder)
javascript/0230-kth-smallest-element-in-a-bst.js:14
↓ 1 callersFunctiondfs
(root)
javascript/0104-maximum-depth-of-binary-tree.js:14
↓ 1 callersFunctiondfs
(node, str)
javascript/0988-smallest-string-starting-from-leaf.js:21
↓ 1 callersFunctiondfs
(s, t, i, j, memo)
javascript/0115-distinct-subsequences.js:35
↓ 1 callersFunctiondfs
(i, j int)
go/0097-interleaving-string.go:17
↓ 1 callersFunctiondfs
(node *TreeNode, curSum int, res *[]int)
go/0129-sum-root-to-leaf-numbers.go:19
↓ 1 callersFunctiondfs
(root *TreeNode)
go/0110-balanced-binary-tree.go:18
↓ 1 callersFunctiondfs
(t *TreeNode, maxLength *int)
go/0543-diameter-of-binary-tree.go:15
↓ 1 callersMethoddfs
(self, t: TreeNode, res: list)
python/0606-construct-string-from-binary-tree.py:8
↓ 1 callersMethoddfs
(node, word, words)
javascript/1268-search-suggestions-system.js:144
↓ 1 callersMethoddfs
(int node, int parent, int seats)
java/2477-minimum-fuel-cost-to-report-to-the-capital.java:17
↓ 1 callersMethoddfs
(int[] arr, int k, int i, Integer[] cache)
java/1043-partition-array-for-maximum-sum.java:7
↓ 1 callersMethoddfs
(int i, int steps, int n)
java/1269-number-of-ways-to-stay-in-the-same-place-after-some-steps.java:13
↓ 1 callersMethoddfs
(TreeNode root)
java/0337-house-robber-iii.java:2
↓ 1 callersMethoddfs
(TreeNode curr)
java/1457-pseudo-palindromic-paths-in-a-binary-tree.java:9
↓ 1 callersMethoddfs
(int i, int d, int cur_max, int[] jobDiff)
java/1335-minimum-difficulty-of-a-job-schedule.java:11
↓ 1 callersMethoddfs
(int row, int column, int n)
java/0427-construct-quad-tree.java:10
↓ 1 callersMethoddfs
(int i, int remain, int[] cost, int[] time)
java/2742-painting-the-walls.java:8
↓ 1 callersMethoddfs
( int[][] matrix, int[][] dp, int m, int n, int i, int j,
java/0329-longest-increasing-path-in-a-matrix.java:22
↓ 1 callersMethoddfs
(int[][] grid, int i, int j, int m, int n, int[][] dp)
java/0063-unique-paths-ii.java:16
↓ 1 callersMethoddfs
(TreeNode root, Integer min, Integer max)
java/0098-validate-binary-search-tree.java:23
↓ 1 callersMethoddfs
( int r, int c, Trie node, String word, HashSet<String> res, H
java/0212-word-search-ii.java:26
↓ 1 callersMethoddfs
(int[][] graph, int src, HashMap<Integer, Boolean> safe)
java/0802-find-eventual-safe-states.java:12
↓ 1 callersMethoddfs
( List<List<Integer>> ans, int[][] graph, List<Integer> list, int i )
java/0797-all-paths-from-source-to-target.java:11
↓ 1 callersMethoddfs
(HashMap<Integer, List<Integer>> hm, int s, int target, boolean[] visited)
java/1462-course-schedule-iv.java:17
↓ 1 callersMethoddfs
(char[][] grid, int i, int j)
java/0200-number-of-islands.java:16
↓ 1 callersMethoddfs
(List<NestedInteger> nestedList)
java/0341-flatten-nested-list-iterator.java:19
↓ 1 callersMethoddfs
(int[] piles, int alice, int i, int M, Integer[][][] dp)
java/1140-stone-game-ii.java:7
↓ 1 callersMethoddfs
(int src, int[] time, Map<Integer, List<Integer>> adj, Map<Integer, Integer> maxTime)
java/2050-parallel-courses-iii.java:20
↓ 1 callersMethoddfs
(TreeNode p, TreeNode q)
java/0100-same-tree.java:24
↓ 1 callersMethoddfs
( int[][] grid, long[][] dp, int i, int j, int m, int n,
java/2328-number-of-increasing-paths-in-a-grid.java:26
↓ 1 callersMethoddfs
(int src, Map<Integer, List<Integer>> adj, Set<Integer> visit, Set<Integer> secrets)
java/2092-find-all-people-with-secret.java:27
↓ 1 callersMethoddfs
(TreeNode root, StringBuilder res)
java/0606-construct-string-from-binary-tree.java:21
↓ 1 callersMethoddfs
(TreeNode a, TreeNode b)
java/0101-symmetric-tree.java:5
↓ 1 callersMethoddfs
(int n, List<List<String>> result, List<String> cur, Set<Integer> leftSet, Set<Integer> rightSet,
java/0051-n-queens.java:82
↓ 1 callersMethoddfs
(TreeNode root)
java/0110-balanced-binary-tree.java:5
↓ 1 callersMethoddfs
(boolean[][] cache, String s, String p, int i, int j)
java/0010-regular-expression-matching.java:9
↓ 1 callersMethoddfs
( int[] prices, Map<String, Integer> cache, int index, boolean buying )
java/0309-best-time-to-buy-and-sell-stock-with-cooldown.java:8
↓ 1 callersMethoddfs
(int[][] grid, int r, int c, Set<String> visited)
java/1568-minimum-number-of-days-to-disconnect-island.java:26
↓ 1 callersMethoddfs
(TreeNode current)
java/0543-diameter-of-binary-tree.java:10
↓ 1 callersMethoddfs
(int curr, int parent, HashSet<Integer> visited)
java/1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero.java:19
↓ 1 callersMethoddfs
(TreeNode root, int targetSum, int currSum)
java/0112-path-sum.java:18
↓ 1 callersMethoddfs
(int node, int parent, int[] values)
java/2925-maximum-score-after-applying-operations-on-a-tree.java:21
↓ 1 callersMethoddfs
(int r, int c, int moves, Map<String, Integer> cache)
java/0576-out-of-boundary-paths.java:10
↓ 1 callersMethoddfs
(int n, Map<Integer, Integer> dp)
java/1553-minimum-number-of-days-to-eat-n-oranges.java:9
↓ 1 callersMethoddfs
(TreeNode node)
java/0783-minimum-distance-between-bst-nodes.java:10
↓ 1 callersMethoddfs
(Map<Integer, List<Integer>> g, int node, int[] res, Set<Integer> visited, int i)
java/1743-restore-the-array-from-adjacent-pairs.java:21
↓ 1 callersMethoddfs
(int i)
java/1235-maximum-profit-in-job-scheduling.java:19
↓ 1 callersFunctiondfsDeserialize
(val, data)
javascript/0297-serialize-and-deserialize-binary-tree.js:78
↓ 1 callersFunctiondfsSerialize
(node, result)
javascript/0297-serialize-and-deserialize-binary-tree.js:21
↓ 1 callersFunctiondfsSerializeIterative
(stack, result = [])
javascript/0297-serialize-and-deserialize-binary-tree.js:41
↓ 1 callersMethoddijkstra
(int start, int end, List<double[]>[] graph)
java/1514-path-with-maximum-probability.java:37
↓ 1 callersFunctiondirections
(row, col)
javascript/0079-word-search.js:39
← previousnext →601–700 of 3,416, ranked by callers