MCPcopy Create free account

hub / github.com/ByteByteGoHq/coding-interview-patterns / functions

Functions1,014 in github.com/ByteByteGoHq/coding-interview-patterns

↓ 1 callersFunctiondfs
kotlin/Tries/FindAllWordsOnABoard.kt:33
↓ 1 callersFunctiondfs
kotlin/Trees/LowestCommonAncestor.kt:19
↓ 1 callersFunctiondfs
cpp/Graphs/graph_deep_copy.cpp:27
↓ 1 callersFunctiondfs
cpp/Graphs/bipartite_graph_validation.cpp:14
↓ 1 callersFunctiondfs
cpp/Graphs/longest_increasing_path.cpp:23
↓ 1 callersFunctiondfs
cpp/Backtracking/combinations_of_sum_k.cpp:10
↓ 1 callersFunctiondfs
cpp/Backtracking/n_queens.cpp:12
↓ 1 callersFunctiondfs
cpp/Tries/find_all_words_on_a_board.cpp:47
↓ 1 callersFunctiondfs
cpp/Trees/lowest_common_ancestor.cpp:21
↓ 1 callersFunctiondfs
(r: int, c: int, matrix: List[List[int]])
python3/Graphs/count_islands.py:17
↓ 1 callersFunctiondfs
(node: GraphNode, clone_map = {})
python3/Graphs/graph_deep_copy.py:17
↓ 1 callersFunctiondfs
(node: int, color: int, graph: List[List[int]], colors: List[int])
python3/Graphs/bipartite_graph_validation.py:12
↓ 1 callersFunctiondfs
(r: int, c: int, matrix: List[List[int]], memo: List[List[int]])
python3/Graphs/longest_increasing_path.py:18
↓ 1 callersFunctiondfs
(r: int, diagonals_set: Set[int], anti_diagonals_set: Set[int], cols_set: Set[int], n: int)
python3/Backtracking/n_queens.py:9
↓ 1 callersFunctiondfs
(combination: List[int], start_index: int, nums: List[int], target: int, res: List[List[int]])
python3/Backtracking/combinations_of_sum_k.py:9
↓ 1 callersFunctiondfs
(board: List[List[str]], r: int, c: int, node: TrieNode, res: List[str])
python3/Tries/find_all_words_on_a_board.py:28
↓ 1 callersFunctiondfs
(node: TreeNode, p: TreeNode, q: TreeNode)
python3/Trees/lowest_common_ancestor.py:17
↓ 1 callersMethoddfs
(GraphNode node, Map<GraphNode, GraphNode> cloneMap)
java/Graphs/GraphDeepCopy.java:27
↓ 1 callersMethoddfs
(int node, int color, int[][] graph, int[] colors)
java/Graphs/BipartiteGraphValidation.java:13
↓ 1 callersMethoddfs
(int r, int c, int[][] matrix)
java/Graphs/CountIslands.java:20
↓ 1 callersMethoddfs
(int r, int c, int[][] matrix, int[][] memo)
java/Graphs/LongestIncreasingPath.java:21
↓ 1 callersMethoddfs
(List<Integer> combination, int startIndex, int[] nums, int target, List<List<Integer>> res)
java/Backtracking/CombinationsOfSumK.java:11
↓ 1 callersMethoddfs
(int r, Set<Integer> diagonalsSet, Set<Integer> antiDiagonalsSet, Set<Integer> colsSet, int n)
java/Backtracking/NQueens.java:12
↓ 1 callersMethoddfs
(char[][] board, int r, int c, TrieNode node, List<String> res)
java/Tries/FindAllWordsOnABoard.java:41
↓ 1 callersMethoddfs
(TreeNode node, TreeNode p, TreeNode q)
java/Trees/LowestCommonAncestor.java:23
↓ 1 callersMethodexistInArray
(int[] nums, int target)
java/Hash Maps and Sets/LongestChainOfConsecutiveNumbersBruteForce.java:21
↓ 1 callersFunctionfindMiddle
From the 'Linked List Midpoint' problem.
kotlin/Linked Lists/PalindromicLinkedList.kt:41
↓ 1 callersFunctionfindMiddle
(head: ListNode | null)
typescript/Linked Lists/palindromic_linked_list.ts:43
↓ 1 callersMethodfindMiddle
(ListNode head)
java/Linked Lists/PalindromicLinkedList.java:51
↓ 1 callersFunctionfind_middle
(head: ListNode)
python3/Linked Lists/palindromic_linked_list.py:37
↓ 1 callersMethodget
kotlin/Linked Lists/LRUCache.kt:25
↓ 1 callersMethodget
(key: number)
typescript/Linked Lists/lru_cache.ts:31
↓ 1 callersFunctiongetHeightImbalance
kotlin/Trees/BalancedBinaryTreeValidation.kt:17
↓ 1 callersFunctiongetHeightImbalance
cpp/Trees/balanced_binary_tree_validation.cpp:19
↓ 1 callersMethodgetHeightImbalance
(TreeNode node)
java/Trees/BalancedBinaryTreeValidation.java:20
↓ 1 callersMethodgetSize
kotlin/Graphs/MergingCommunities.kt:33
↓ 1 callersMethodgetSize
cpp/Graphs/merging_communities.cpp:41
↓ 1 callersMethodgetSize
(int x)
java/Graphs/MergingCommunities.java:43
↓ 1 callersFunctiongetSlope
kotlin/Math and Geometry/MaximumCollinearPoints.kt:33
↓ 1 callersFunctiongetSlope
cpp/Math and Geometry/maximum_collinear_points.cpp:37
↓ 1 callersFunctionget_height_imbalance
(node: TreeNode)
python3/Trees/balanced_binary_tree_validation.py:16
↓ 1 callersMethodget_size
(self, x: int)
python3/Graphs/merging_communities.py:26
↓ 1 callersFunctionget_slope
(p1: List[int], p2: List[int])
python3/Math and Geometry/maximum_collinear_points.py:31
↓ 1 callersFunctioninorder
Inorder traversal function to attain a sorted list of nodes from the BST.
kotlin/Trees/KthSmallestNumberInBSTRecursive.kt:19
↓ 1 callersFunctioninorder
Inorder traversal function to attain a sorted list of nodes from the BST.
cpp/Trees/kth_smallest_number_in_BST_recursive.cpp:22
↓ 1 callersFunctioninorder
(node: TreeNode)
python3/Trees/kth_smallest_number_in_BST_recursive.py:19
↓ 1 callersMethodinorder
(TreeNode node, List<Integer> sortedList)
java/Trees/KthSmallestNumberInBSTRecursive.java:26
↓ 1 callersFunctionisWithinBounds
kotlin/Graphs/CountIslands.kt:35
↓ 1 callersFunctionisWithinBounds
kotlin/Graphs/LongestIncreasingPath.kt:38
↓ 1 callersFunctionisWithinBounds
kotlin/Graphs/MatrixInfection.kt:47
↓ 1 callersFunctionisWithinBounds
kotlin/Tries/FindAllWordsOnABoard.kt:58
↓ 1 callersFunctionisWithinBounds
kotlin/Trees/BinarySearchTreeValidation.kt:20
↓ 1 callersFunctionisWithinBounds
cpp/Graphs/matrix_infection.cpp:46
↓ 1 callersFunctionisWithinBounds
cpp/Graphs/count_islands.cpp:37
↓ 1 callersFunctionisWithinBounds
cpp/Graphs/longest_increasing_path.cpp:42
↓ 1 callersFunctionisWithinBounds
cpp/Tries/find_all_words_on_a_board.cpp:73
↓ 1 callersFunctionisWithinBounds
cpp/Trees/binary_search_tree_validation.cpp:23
↓ 1 callersMethodisWithinBounds
(int r, int c, int[][] matrix)
java/Graphs/CountIslands.java:36
↓ 1 callersMethodisWithinBounds
(int r, int c, int[][] matrix)
java/Graphs/MatrixInfection.java:50
↓ 1 callersMethodisWithinBounds
(int r, int c, int[][] matrix)
java/Graphs/LongestIncreasingPath.java:40
↓ 1 callersMethodisWithinBounds
(int r, int c, char[][] board)
java/Tries/FindAllWordsOnABoard.java:66
↓ 1 callersMethodisWithinBounds
(TreeNode node, Integer lowerBound, Integer upperBound)
java/Trees/BinarySearchTreeValidation.java:22
↓ 1 callersFunctionis_within_bounds
(r: int, c: int, matrix: List[List[int]])
python3/Graphs/count_islands.py:29
↓ 1 callersFunctionis_within_bounds
(r: int, c: int, matrix: List[List[int]])
python3/Graphs/matrix_infection.py:37
↓ 1 callersFunctionis_within_bounds
(r: int, c: int, matrix: List[List[int]])
python3/Graphs/longest_increasing_path.py:32
↓ 1 callersFunctionis_within_bounds
(r: int, c: int, board: List[str])
python3/Tries/find_all_words_on_a_board.py:48
↓ 1 callersFunctionis_within_bounds
(node: TreeNode, lower_bound: int, upper_bound: int)
python3/Trees/binary_search_tree_validation.py:19
↓ 1 callersFunctionlowerBoundBinarySearch
kotlin/Binary Search/FirstAndLastOccurrencesOfANumber.kt:7
↓ 1 callersMethodlowerBoundBinarySearch
(int[] nums, int target)
java/Binary Search/FirstAndLastOccurrencesOfANumber.java:8
↓ 1 callersFunctionlower_bound_binary_search
(nums: List[int], target: int)
python3/Binary Search/first_and_last_occurrences_of_a_number.py:9
↓ 1 callersFunctionmaxPathSumHelper
kotlin/Trees/MaximumPathSum.kt:21
↓ 1 callersFunctionmaxPathSumHelper
cpp/Trees/maximum_path_sum.cpp:23
↓ 1 callersMethodmaxPathSumHelper
(TreeNode node)
java/Trees/MaximumPathSum.java:23
↓ 1 callersFunctionmaxPointsFromFocalPoint
kotlin/Math and Geometry/MaximumCollinearPoints.kt:14
↓ 1 callersFunctionmaxPointsFromFocalPoint
cpp/Math and Geometry/maximum_collinear_points.cpp:18
↓ 1 callersFunctionmax_path_sum_helper
(node: TreeNode)
python3/Trees/maximum_path_sum.py:20
↓ 1 callersFunctionmax_points_from_focal_point
(focal_point_index: int, points: List[List[int]])
python3/Math and Geometry/maximum_collinear_points.py:15
↓ 1 callersFunctionmerge
kotlin/Sort and Search/SortLinkedList.kt:36
↓ 1 callersFunctionmerge
cpp/Sort and Search/sort_linked_list.cpp:41
↓ 1 callersFunctionmerge
(l1: ListNode, l2: ListNode)
python3/Sort and Search/sort_linked_list.py:35
↓ 1 callersMethodmerge
(ListNode l1, ListNode l2)
java/Sort and Search/SortLinkedList.java:45
↓ 1 callersFunctionpairSumSortedAllPairs
kotlin/Two Pointers/TripletSum.kt:24
↓ 1 callersFunctionpairSumSortedAllPairs
cpp/Two Pointers/triplet_sum.cpp:30
↓ 1 callersFunctionpairSumSortedAllPairs
(nums: number[], start: number, target: number)
typescript/Two Pointers/triplet_sum.ts:22
↓ 1 callersFunctionpairSumSortedAllPairs
(nums []int, start int, target int)
go/Two Pointers/triplet_sum.go:29
↓ 1 callersMethodpairSumSortedAllPairs
(int[] nums, int start, int target)
java/Two Pointers/TripletSum.java:28
↓ 1 callersFunctionpair_sum_sorted_all_pairs
(nums: &Vec<i32>, start: usize, target: i32)
rust/Two Pointers/triplet_sum.rs:29
↓ 1 callersFunctionpair_sum_sorted_all_pairs
(nums: List[int], start: int, target: int)
python3/Two Pointers/triplet_sum.py:23
↓ 1 callersFunctionpartition
kotlin/Sort and Search/KthLargestIntegerQuickselect.kt:29
↓ 1 callersFunctionpartition
kotlin/Sort and Search/SortArrayQuicksortOptimized.kt:20
↓ 1 callersFunctionpartition
kotlin/Sort and Search/SortArrayQuicksort.kt:20
↓ 1 callersFunctionpartition
cpp/Sort and Search/kth_largest_integer_quickselect.cpp:36
↓ 1 callersFunctionpartition
cpp/Sort and Search/sort_array_quicksort.cpp:23
↓ 1 callersFunctionpartition
cpp/Sort and Search/sort_array_quicksort_optimized.cpp:26
↓ 1 callersFunctionpartition
(nums: List[int], left: int, right: int)
python3/Sort and Search/sort_array_quicksort.py:20
↓ 1 callersFunctionpartition
(nums: List[int], left: int, right: int)
python3/Sort and Search/sort_array_quicksort_optimized.py:21
↓ 1 callersFunctionpartition
(nums: List[int], left: int, right: int)
python3/Sort and Search/kth_largest_integer_quickselect.py:29
↓ 1 callersMethodpartition
(int[] nums, int left, int right)
java/Sort and Search/SortArrayQuicksortOptimized.java:21
↓ 1 callersMethodpartition
(int[] nums, int left, int right)
java/Sort and Search/SortArrayQuicksort.java:19
↓ 1 callersMethodpartition
(int[] nums, int left, int right)
java/Sort and Search/KthLargestIntegerQuickselect.java:24
← previousnext →101–200 of 1,014, ranked by callers