Functions — github.com/ByteByteGoHq/coding-interview-patterns

CodeHub MCPcopy Create free account

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

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

⨍ Functions 1,014◇ Types & classes 253

↓ 1 callersFunctionpreorderSerialize

Helper function to perform serialization through preorder traversal.

kotlin/Trees/SerializeAndDeserializeABinaryTree.kt:25

↓ 1 callersFunctionpreorderSerialize

Helper function to perform serialization through preorder traversal.

cpp/Trees/serialize_and_deserialize_a_binary_tree.cpp:26

↓ 1 callersMethodpreorderSerialize

(TreeNode node, StringBuilder serializedList)

java/Trees/SerializeAndDeserializeABinaryTree.java:30

↓ 1 callersFunctionpreorder_serialize

(node, serialized_list)

python3/Trees/serialize_and_deserialize_a_binary_tree.py:24

↓ 1 callersFunctionquickselect

kotlin/Sort and Search/KthLargestIntegerQuickselect.kt:5

↓ 1 callersFunctionquickselect

cpp/Sort and Search/kth_largest_integer_quickselect.cpp:10

↓ 1 callersFunctionquickselect

(nums: List[int], left: int, right: int, k: int)

python3/Sort and Search/kth_largest_integer_quickselect.py:8

↓ 1 callersMethodquickselect

(int[] nums, int left, int right, int k)

java/Sort and Search/KthLargestIntegerQuickselect.java:6

↓ 1 callersFunctionquicksort

kotlin/Sort and Search/SortArrayQuicksort.kt:6

↓ 1 callersFunctionquicksort

cpp/Sort and Search/sort_array_quicksort.cpp:9

↓ 1 callersFunctionquicksort

(nums: List[int], left: int, right: int)

python3/Sort and Search/sort_array_quicksort.py:8

↓ 1 callersMethodquicksort

(int[] nums, int left, int right)

java/Sort and Search/SortArrayQuicksort.java:7

↓ 1 callersFunctionquicksortOptimized

kotlin/Sort and Search/SortArrayQuicksortOptimized.kt:6

↓ 1 callersFunctionquicksortOptimized

cpp/Sort and Search/sort_array_quicksort_optimized.cpp:12

↓ 1 callersMethodquicksortOptimized

(int[] nums, int left, int right)

java/Sort and Search/SortArrayQuicksortOptimized.java:7

↓ 1 callersFunctionquicksort_optimized

(nums: List[int], left: int, right: int)

python3/Sort and Search/sort_array_quicksort_optimized.py:9

↓ 1 callersFunctionreverseList

From the 'Reverse Linked List' problem.

kotlin/Linked Lists/PalindromicLinkedList.kt:28

↓ 1 callersFunctionreverseList

(head: ListNode | null)

typescript/Linked Lists/palindromic_linked_list.ts:30

↓ 1 callersMethodreverseList

(ListNode head)

java/Linked Lists/PalindromicLinkedList.java:38

↓ 1 callersFunctionreverse_list

(head: ListNode)

python3/Linked Lists/palindromic_linked_list.py:27

↓ 1 callersMethodsearchHelper

(int wordIndex, String word, TrieNode node)

java/Tries/InsertAndSearchWordsWithWildcards.java:34

↓ 1 callersMethodsearch_helper

(self, word_index: int, word: str, node: TrieNode)

python3/Tries/insert_and_search_words_with_wildcards.py:22

↓ 1 callersFunctionsplitList

kotlin/Sort and Search/SortLinkedList.kt:24

↓ 1 callersFunctionsplitList

cpp/Sort and Search/sort_linked_list.cpp:29

↓ 1 callersMethodsplitList

(ListNode head)

java/Sort and Search/SortLinkedList.java:32

↓ 1 callersFunctionsplit_list

(head: ListNode)

python3/Sort and Search/sort_linked_list.py:26

↓ 1 callersFunctiontopDownDp

kotlin/Dynamic Programming/MinCoinCombinationTopDown.kt:7

↓ 1 callersFunctiontopDownDp

cpp/Dynamic Programming/min_coin_combination_top_down.cpp:11

↓ 1 callersMethodtopDownDp

(int[] coins, int target, Map<Integer, Integer> memo)

java/Dynamic Programming/MinCoinCombinationTopDown.java:10

↓ 1 callersFunctiontop_down_dp

(coins: List[int], target: int, memo: Dict[int, int])

python3/Dynamic Programming/min_coin_combination_top_down.py:8

↓ 1 callersMethodunion

kotlin/Graphs/ConnectTheDots.kt:5

↓ 1 callersMethodunion

kotlin/Graphs/MergingCommunities.kt:7

↓ 1 callersMethodunion

python3/Graphs/connect_the_dots.py:9

↓ 1 callersMethodunion

(self, x: int, y: int)

python3/Graphs/merging_communities.py:6

↓ 1 callersMethodunion

java/Graphs/ConnectTheDots.java:19

↓ 1 callersMethodunion

java/Graphs/MergingCommunities.java:16

↓ 1 callersMethodunionSets

cpp/Graphs/connect_the_dots.cpp:18

↓ 1 callersMethodunionSets

cpp/Graphs/merging_communities.cpp:15

↓ 1 callersFunctionupperBoundBinarySearch

kotlin/Binary Search/FirstAndLastOccurrencesOfANumber.kt:21

↓ 1 callersMethodupperBoundBinarySearch

(int[] nums, int target)

java/Binary Search/FirstAndLastOccurrencesOfANumber.java:25

↓ 1 callersFunctionupper_bound_binary_search

(nums: List[int], target: int)

python3/Binary Search/first_and_last_occurrences_of_a_number.py:21

MethodCombinationsOfSumK

(int[] nums, int target)

csharp/Backtracking/CombinationsOfSumK.cs:3

MethodCombineSortedLinkedLists

(ListNode[] lists)

csharp/Heaps/CombineSortedLinkedLists.cs:28

MethodCompareTo

Since this is a min-heap comparator, we can use the same comparator as the one used in the max-heap, but reversing the inequality signs to invert the

csharp/Heaps/KMostFrequentStringsMinHeap.cs:15

MethodCuttingWood

(int[] heights, int k)

csharp/Binary Search/CuttingWood.cs:3

MethodDesignATrie

java/Tries/DesignATrie.java:16

MethodDoublyLinkedListNode

cpp/Linked Lists/lru_cache.cpp:9

MethodDoublyLinkedListNode

(int key, int val)

csharp/Linked Lists/LRUCache.cs:5

MethodDoublyLinkedListNode

(int key, int val)

java/Linked Lists/LRUCache.java:8

MethodEvaluateExpression

csharp/Stacks/EvaluateExpression.cs:3

MethodFindAllPermutations

csharp/Backtracking/FindAllPermutations.cs:3

MethodFindAllSubsets

csharp/Backtracking/FindAllSubsets.cs:3

MethodFindTheInsertionIndex

(int[] nums, int target)

csharp/Binary Search/FindTheInsertionIndex.cs:3

MethodFindTheMedianFromTwoSortedArrays

(int[] nums1, int[] nums2)

csharp/Binary Search/FindTheMedianFromTwoSortedArrays.cs:3

MethodFindTheTargetInARotatedSortedArray

(int[] nums, int target)

csharp/Binary Search/FindTheTargetInARotatedSortedArray.cs:3

MethodFirstAndLastOccurrencesOfANumber

(int[] nums, int target)

csharp/Binary Search/FirstAndLastOccurrencesOfANumber.cs:3

MethodFlattenMultiLevelList

(MultiLevelListNode head)

csharp/Linked Lists/FlattenMultiLevelList.cs:25

MethodGeometricSequenceTriplets

(int[] nums, int r)

csharp/Hash Maps and Sets/GeometricSequenceTriplets.cs:3

csharp/Linked Lists/LRUCache.cs:44

MethodGetMedian

csharp/Heaps/MedianOfAnIntegerStream.cs:42

MethodHappyNumber

csharp/Fast and Slow Pointers/HappyNumber.cs:3

MethodIdentifyAllIntervalOverlaps

(Interval[] intervals1, Interval[] intervals2)

csharp/Intervals/IdentifyAllIntervalOverlaps.cs:21

MethodImplementAQueueUsingAStack

java/Stacks/ImplementAQueueUsingAStack.java:7

MethodInsertAndSearchWordsWithWildcards

cpp/Tries/insert_and_search_words_with_wildcards.cpp:18

MethodInsertAndSearchWordsWithWildcards

java/Tries/InsertAndSearchWordsWithWildcards.java:16

MethodIsPalindromeValid

csharp/Two Pointers/IsPalindromeValid.cs:3

MethodKMostFrequentStringsMaxHeap

(string[] strs, int k)

csharp/Heaps/KMostFrequentStringsMaxHeap.cs:25

MethodKMostFrequentStringsMinHeap

(string[] strs, int k)

csharp/Heaps/KMostFrequentStringsMinHeap.cs:26

MethodKSumSubArrays

(int[] nums, int k)

csharp/Prefix Sums/KSumSubArrays.cs:3

MethodKSumSubArraysOptimized

(int[] nums, int k)

csharp/Prefix Sums/KSumSubArraysOptimized.cs:3

cpp/Linked Lists/lru_cache.cpp:22

csharp/Linked Lists/LRUCache.cs:29

java/Linked Lists/LRUCache.java:20

MethodLargestContainer

(int[] heights)

csharp/Two Pointers/LargestContainer.cs:3

MethodLargestContainerBruteForce

(int[] heights)

csharp/Two Pointers/LargestContainerBruteForce.cs:3

MethodLargestOverlapOfIntervals

(Interval[] intervals)

csharp/Intervals/LargestOverlapOfIntervals.cs:21

MethodLinkedListIntersection

(ListNode headA, ListNode headB)

csharp/Linked Lists/LinkedListIntersection.cs:21

MethodLinkedListLoop

(ListNode head)

csharp/Fast and Slow Pointers/LinkedListLoop.cs:21

MethodLinkedListLoopNaive

(ListNode head)

csharp/Fast and Slow Pointers/LinkedListLoopNaive.cs:21

MethodLinkedListMidPoint

(ListNode head)

csharp/Fast and Slow Pointers/LinkedListMidPoint.cs:21

MethodLinkedListReversal

(ListNode head)

csharp/Linked Lists/LinkedListReversal.cs:21

MethodLinkedListReversalRecursive

(ListNode head)

csharp/Linked Lists/LinkedListReversalRecursive.cs:21

MethodLocalMaximaInArray

csharp/Binary Search/LocalMaximaInArray.cs:3

MethodLongestChainOfConsecutiveNumbers

csharp/Hash Maps and Sets/LongestChainOfConsecutiveNumbers.cs:3

MethodLongestChainOfConsecutiveNumbersBruteForce

csharp/Hash Maps and Sets/LongestChainOfConsecutiveNumbersBruteForce.cs:3

MethodLongestSubstringWithUniqueChars

csharp/Sliding Windows/LongestSubstringWithUniqueChars.cs:3

MethodLongestSubstringWithUniqueCharsOptimized

csharp/Sliding Windows/LongestSubstringWithUniqueCharsOptimized.cs:3

MethodLongestUniformSubstringAfterReplacements

(string s, int k)

csharp/Sliding Windows/LongestUniformSubstringAfterReplacements.cs:3

MethodMatrixSearch

(int[][] matrix, int target)

csharp/Binary Search/MatrixSearch.cs:3

MethodMaximumsOfSlidingWindow

(int[] nums, int k)

csharp/Stacks/MaximumsOfSlidingWindow.cs:3

MethodMedianOfAnIntegerStream

cpp/Heaps/median_of_an_integer_stream.cpp:6

MethodMedianOfAnIntegerStream

csharp/Heaps/MedianOfAnIntegerStream.cs:6

MethodMedianOfAnIntegerStream

java/Heaps/MedianOfAnIntegerStream.java:9

MethodMergeOverlappingIntervals

(Interval[] intervals)

csharp/Intervals/MergeOverlappingIntervals.cs:21

MethodMergingCommunities

cpp/Graphs/merging_communities.cpp:49

MethodMergingCommunities

java/Graphs/MergingCommunities.java:51

csharp/Backtracking/NQueens.cs:5

MethodNextLargestNumberToTheRight

csharp/Stacks/NextLargestNumberToTheRight.cs:3

MethodNextLexicographicalSequence

csharp/Two Pointers/NextLexicographicalSequence.cs:3

(string str, int freq)

csharp/Heaps/KMostFrequentStringsMaxHeap.cs:6

← previous next →201–300 of 1,014, ranked by callers