MCPcopy Create free account

hub / github.com/adnanaziz/epicode / functions

Functions3,944 in github.com/adnanaziz/epicode

↓ 5 callersMethodonlineMedian
(Iterator<Integer> sequence)
java/src/main/java/com/epi/OnlineMedian.java:18
↓ 5 callersMethodrangeLookupInBST
(BSTNode<Integer> tree, Interval interval)
java/src/main/java/com/epi/RangeLookupBST.java:21
↓ 5 callersMethodreconstructPreorder
( List<Integer> preorder)
java/src/main/java/com/epi/ReconstructPreorderWithNull.java:17
↓ 5 callersMethodremoveDuplicates
(ListNode<Integer> L)
java/src/main/java/com/epi/RemoveDuplicatesSortedList.java:27
↓ 5 callersMethodreverseLinkedList
(ListNode<Integer> head)
java/src/main/java/com/epi/ReverseLinkedListIterative.java:17
↓ 5 callersFunctionsearch_insert_position
@include From man page: ForwardIterator lower_bound (ForwardIterator first, ForwardIterator last, const T& val); Returns an iterator pointing to the f
cpp/search-insert-position-sorted-array.cc:24
↓ 5 callersFunctiontail
@include
cpp/Tail.cc:18
↓ 5 callersMethodtail
(String fileName, int N)
java/src/main/java/com/epi/Tail.java:15
↓ 4 callersFunctionAppendNode
cpp/Merge_two_BSTs.cc:128
↓ 4 callersFunctionBinaryTreeFromPreorderInorder
@include
cpp/Reconstruct_binary_tree_pre_in_orders.cc:29
↓ 4 callersFunctionCalculateBonus
@include
cpp/bonus.cc:42
↓ 4 callersFunctionCalculateBonus
@include
cpp/bonus-improved.cc:38
↓ 4 callersFunctionCalculateTrappingWater
@include
cpp/trapping-rain-water.cc:25
↓ 4 callersFunctionChangeMaking
@include
cpp/coin_change.cc:9
↓ 4 callersFunctionCheckAns
cpp/Closest_to_median.cc:61
↓ 4 callersFunctionCollatzCheck
Checks an individual number
cpp/collatz.cc:50
↓ 4 callersMethodCollatzCheck
(BigInteger aNum, Set<BigInteger> visited)
java/src/main/java/com/epi/Collatz.java:34
↓ 4 callersFunctionCyclicallyRightShiftList
@include
cpp/cyclic-right-shift.cc:15
↓ 4 callersFunctionEvenOddMerge
@include
cpp/Even_odd_merge_linked_list.cc:50
↓ 4 callersMethodFactoryMethod
@include This factory method is a template method for creating MazeGame objects. MazeGameCreator's subclasses implement MakeRoom() as appropriate for
cpp/maze_game.h:37
↓ 4 callersFunctionFindDuplicateMissing
cpp/Find_missing_and_duplicate_XOR.cc:23
↓ 4 callersFunctionFindFirstGreaterThanK
@include
cpp/Search_BST_first_larger_k.cc:11
↓ 4 callersFunctionFindKClosestToMedian
cpp/Closest_to_median.cc:39
↓ 4 callersFunctionFindLCA
@include Input nodes are not nonempty and the key at s is less than or equal to that at b.
cpp/BST_lowest_common_ancestor.cc:14
↓ 4 callersFunctionFindMedianSortedCircularLinkedList
@include
cpp/Median_sorted_circular_linked_list.cc:21
↓ 4 callersFunctionFindMinMax
cpp/Finding_min_max.cc:27
↓ 4 callersFunctionFindMinimumVisits
cpp/points_covering_intervals_sorting.cc:30
↓ 4 callersFunctionGenerateFirstKABSqrt2
cpp/generating-a-b-sqrt2.h:26
↓ 4 callersFunctionGetMaxTrappedWater
@include
cpp/container-with-most-water.cc:21
↓ 4 callersMethodGetStream
cpp/test_toolkit/test-options.h:142
↓ 4 callersFunctionIntersectRectangle
cpp/Intersect_rectangle.cc:33
↓ 4 callersFunctionIntersectTwoSortedArrays
@include
cpp/Intersect_sorted_arrays1.h:13
↓ 4 callersFunctionIsGraphFaultTolerant
cpp/2-for-all.cc:37
↓ 4 callersFunctionIsPalindromeNumber
@include
cpp/palindrome-number.cc:20
↓ 4 callersFunctionIsValidPart
cpp/valid-IP-address.cc:45
↓ 4 callersFunctionKLargestInBinaryHeap
@include
cpp/k-largest-elements-binary-heap.cc:18
↓ 4 callersFunctionLCA
@include
cpp/Lowest_common_ancestor_hash.cc:19
↓ 4 callersMethodLCA
(BinaryTree<Integer> node0, BinaryTree<Integer> node1)
java/src/main/java/com/epi/LowestCommonAncestorHash.java:10
↓ 4 callersFunctionMarkBoundaryRegion
cpp/surrounded-regions.cc:70
↓ 4 callersMethodMax
cpp/AddingCredits.cc:45
↓ 4 callersFunctionMaxKPairsProfits
@include
cpp/Max_difference_k_pairs.cc:21
↓ 4 callersFunctionMaximumRevenue
@include
cpp/Picking_up_coins.cc:22
↓ 4 callersFunctionNQueens
@include
cpp/n-queens.cc:26
↓ 4 callersFunctionNumberOfWays
@include
cpp/Number_ways.cc:19
↓ 4 callersFunctionNumberOfWaysToTop
@include
cpp/number-steps.cc:21
↓ 4 callersFunctionPower
@include
cpp/power-x-y.cc:29
↓ 4 callersMethodPush
cpp/Stack_with_max_improved.cc:46
↓ 4 callersFunctionRandVector
cpp/0-1_knapsack.cc:20
↓ 4 callersFunctionRangeQueryOnBST
@include
cpp/Nearest_restaurant.cc:34
↓ 4 callersFunctionReverse
@include
cpp/reverse-integer.cc:22
↓ 4 callersFunctionReverseBits
@include
cpp/Reverse_bits.cc:34
↓ 4 callersFunctionReverseX
cpp/Reverse_bits.cc:20
↓ 4 callersFunctionSearchList
@include
cpp/search_list.cc:12
↓ 4 callersFunctionSearchMinFirstBST
@include
cpp/Search_min_first_BST.cc:12
↓ 4 callersFunctionSearchStudent
cpp/student_search.cc:29
↓ 4 callersFunctionSimpleTestArray
cpp/k-th_largest_element_large_n.cc:43
↓ 4 callersFunctionSimpleTestCase
cpp/Smallest_subarray_covering_set.cc:62
↓ 4 callersFunctionSort
@include
cpp/Stack_sorting.cc:22
↓ 4 callersFunctionSortKIncreasingDecreasingArray
@include
cpp/sort_k-increasing-decreasing_array.cc:21
↓ 4 callersFunctionSwapBits
@include
cpp/swap_bits.h:7
↓ 4 callersFunctionTestAllOrders
cpp/order_statistic.cc:221
↓ 4 callersFunctionTestMultipleK
cpp/Closest_to_median.cc:96
↓ 4 callersFunctionUnitTest
cpptest/AnagramsTest.cc:12
↓ 4 callersMethodadvanceListByK
(int k, ListNode<Integer> L)
java/src/main/java/com/epi/OverlappingListsNoCycle.java:25
↓ 4 callersMethodbinaryTreeFromPreorderInorder
( List<Integer> preorder, List<Integer> inorder)
java/src/main/java/com/epi/ReconstructBinaryTreePreInorders.java:18
↓ 4 callersMethodcalculateBonus
(List<Integer> productivity)
java/src/main/java/com/epi/Bonus.java:42
↓ 4 callersMethodcalculateBonus
(List<Integer> productivity)
java/src/main/java/com/epi/BonusImproved.java:28
↓ 4 callersMethodchangeMaking
(int cents)
java/src/main/java/com/epi/CoinChange.java:5
↓ 4 callersMethodcheck
(List<List<Boolean>> input, int i, int j, List<List<Boolean>> golden,
java/src/main/java/com/epi/PaintingIterative.java:46
↓ 4 callersMethodcheckAns
(List<Integer> A, List<Integer> res, int k)
java/src/main/java/com/epi/ClosestToMedian.java:53
↓ 4 callersMethodclosestInDictionary
(String w)
java/src/main/java/com/epi/S1Alternative.java:102
↓ 4 callersMethodcyclicallyRightShiftList
(ListNode<Integer> L, int k)
java/src/main/java/com/epi/CyclicRightShift.java:5
↓ 4 callersFunctiondelete_binary_tree
cpp/Binary_tree_utils.h:50
↓ 4 callersMethodempty
()
java/src/main/java/com/epi/UpdateBST.java:19
↓ 4 callersMethodencodeIntoResponse
(String[] s)
java/src/main/java/com/epi/S1Alternative.java:98
↓ 4 callersMethodevenOddMerge
(ListNode<Integer> L)
java/src/main/java/com/epi/EvenOddMergeLinkedList.java:40
↓ 4 callersMethodextractWordToCheckFromRequest
()
java/src/main/java/com/epi/S1Alternative.java:92
↓ 4 callersMethodfindDuplicateMissing
(List<Integer> A)
java/src/main/java/com/epi/FindMissingAndDuplicateXOR.java:20
↓ 4 callersMethodfindKClosestToMedian
(List<Integer> A, int k)
java/src/main/java/com/epi/ClosestToMedian.java:16
↓ 4 callersMethodfindLCA
(BSTNode<Integer> tree, BSTNode<Integer> s,
java/src/main/java/com/epi/BSTLowestCommonAncestor.java:9
↓ 4 callersMethodfindMinMax
(List<Integer> A)
java/src/main/java/com/epi/FindingMinMax.java:25
↓ 4 callersMethodfindMinimumVisits
(List<Interval> intervals)
java/src/main/java/com/epi/PointsCoveringIntervalsSorting.java:24
↓ 4 callersMethodfindSet
(List<Integer> set, int x)
java/src/main/java/com/epi/OfflineMinimum.java:40
↓ 4 callersFunctionfind_set
cpp/Offline_minimum.cc:53
↓ 4 callersFunctiongenerate_inorder
cpp/Binary_tree_utils.h:104
↓ 4 callersMethodgetMaxTrappedWater
(List<Integer> heights)
java/src/main/java/com/epi/ContainerWithMostWater.java:10
↓ 4 callersMethodgetMillis
()
java/src/main/java/com/epi/utils/StopWatch.java:17
↓ 4 callersMethodgetNorm
()
java/src/main/java/com/epi/GaussianPrimes.java:26
↓ 4 callersMethodgetOrderedUrlsInWindow
(int K)
java/src/main/java/com/epi/LogFileAnalysis.java:228
↓ 4 callersMethodgetUrl
()
java/src/main/java/com/epi/LogFileAnalysis.java:34
↓ 4 callersMethodget_balance
cpp/lock_ordering_bug.cc:23
↓ 4 callersMethodintersectRectangle
(Rectangle R1, Rectangle R2)
java/src/main/java/com/epi/IntersectRectangle.java:24
↓ 4 callersMethodisGraphFaultTolerant
(List<GraphVertex> G)
java/src/main/java/com/epi/TwoForAll.java:27
↓ 4 callersMethodisPalindrome
(long x)
java/src/main/java/com/epi/ClosestPalindrome.java:62
↓ 4 callersMethodisPalindromeNumber
(int x)
java/src/main/java/com/epi/PalindromeNumber.java:25
↓ 4 callersMethodisUnit
(Complex z)
java/src/main/java/com/epi/GaussianPrimes.java:106
↓ 4 callersMethodisValidPart
(String s)
java/src/main/java/com/epi/ValidIPAddress.java:31
↓ 4 callersFunctionis_palindrome
cpp/Closest_palindrome.cc:63
↓ 4 callersFunctionis_unit
cpp/Gaussian_primes.cc:73
↓ 4 callersMethodlevenshteinDistanceRecursive
(String A, String B)
java/src/main/java/com/epi/LevenshteinDistance.java:150
← previousnext →401–500 of 3,944, ranked by callers