MCPcopy Create free account

hub / github.com/adnanaziz/epicode / functions

Functions3,944 in github.com/adnanaziz/epicode

↓ 8 callersMethodLCA
(BinaryTree<Integer> node0, BinaryTree<Integer> node1)
java/src/main/java/com/epi/LowestCommonAncestor.java:7
↓ 8 callersFunctionLongestValidParentheses
@include
cpp/longest_valid_parentheses_const_space.cc:26
↓ 8 callersMethodPop
cpp/Stack_with_max_improved.cc:29
↓ 8 callersMethodPush
cpp/Stack_queue_using_heap.cc:23
↓ 8 callersFunctionSquareRoot
@include
cpp/Square_root.cc:22
↓ 8 callersFunctionUnitTest
cpptest/Spreadsheet_encodingTest.cc:7
↓ 8 callersMethodcheck
(List<Integer> A, int t)
java/src/main/java/com/epi/ThreeSum.java:37
↓ 8 callersMethodcheck
(List<Integer> A)
java/src/main/java/com/epi/BiggestProductNMinus1.java:51
↓ 8 callersMethodcheck
(int expected, List<Event> events)
java/src/main/java/com/epi/RenderingCalendar.java:72
↓ 8 callersMethodcheckAns
(String s, List<String> ans)
java/src/main/java/com/epi/WordBreaking.java:68
↓ 8 callersMethodcheckMaxSum
(List<Integer> A, int maxSum)
java/src/main/java/com/epi/MaxSumSubarray.java:34
↓ 8 callersMethodclosestIntSameBitCount
(long x)
java/src/main/java/com/epi/ClosestIntSameBitsAlternative.java:7
↓ 8 callersMethodclosestIntSameBitCount
(long x)
java/src/main/java/com/epi/ClosestIntSameBits.java:7
↓ 8 callersFunctioncomp
cpp/largearray.c:13
↓ 8 callersMethodcompareKthLargestHeap
(List<Integer> maxHeap, int k, int x)
java/src/main/java/com/epi/CompareKthLargestInHeap.java:16
↓ 8 callersMethoddequeue
cpp/Queue_using_two_integers.cc:26
↓ 8 callersMethoderase
(Integer key)
java/src/main/java/com/epi/UpdateBST.java:50
↓ 8 callersMethodfindMaximumSubarray
(List<Integer> A)
java/src/main/java/com/epi/MaxSumSubarray.java:10
↓ 8 callersMethodgetRight
()
java/src/main/java/com/epi/BinaryTreeLock.java:49
↓ 8 callersMethodgetRootVal
()
java/src/main/java/com/epi/UpdateBST.java:119
↓ 8 callersMethodhandle
(JsonObjectBuilder builder, String name, Object o)
java/src/main/java/com/epi/utils/JsonUniversalObjectWriter.java:29
↓ 8 callersMethodisSymmetric
(BinaryTreeNode<Integer> tree)
java/src/main/java/com/epi/SymmetricBinaryTree.java:7
↓ 8 callersMethodisWellFormed
(String s)
java/src/main/java/com/epi/ValidParentheses.java:8
↓ 8 callersMethodlongestValidParentheses
(String s)
java/src/main/java/com/epi/LongestValidParenthesesConstSpace.java:9
↓ 8 callersMethodmultiply
(List<Integer> num1, List<Integer> num2)
java/src/main/java/com/epi/BigNumberMultiplication.java:14
↓ 8 callersMethodparity
(long x)
java/src/main/java/com/epi/Parity3.java:14
↓ 8 callersMethodpop
()
java/src/main/java/com/epi/StackWithMaxImproved.java:31
↓ 8 callersMethodpush
(Integer x)
java/src/main/java/com/epi/StackQueueUsingHeap.java:35
↓ 8 callersMethodread
(int i, Wrapper<ValueType> v)
java/src/main/java/com/epi/LazyInit.java:17
↓ 8 callersMethodreverseBits
(long x, int n)
java/src/main/java/com/epi/ReverseBits.java:8
↓ 8 callersMethodsquareRoot
(double x)
java/src/main/java/com/epi/SquareRoot.java:7
↓ 8 callersMethodunitTest
(AbstractTestOptions options, String description, String input, int expected)
java/src/main/java/com/epi/SpreadsheetEncodingTest.java:16
↓ 8 callersMethodvalidPlacementExists
(Team A, Team B)
java/src/main/java/com/epi/TeamPhoto1.java:31
↓ 8 callersMethodvalue
()
java/src/main/java/com/epi/ViewFromAbove.java:63
↓ 7 callersFunctionConvertBase
@include
cpp/Convert_base.cc:19
↓ 7 callersFunctionCreateOutputList
cpp/Exterior_binary_tree.cc:78
↓ 7 callersFunctionExteriorBinaryTree
@include
cpp/Exterior_binary_tree.cc:24
↓ 7 callersFunctionFindFirstEqualK
@include
cpp/Search_BST_for_first_occurrence_recursive.cc:11
↓ 7 callersFunctionGenerateAllBinaryTrees
@include
cpp/unique-binary-trees-all.cc:23
↓ 7 callersMethodGetInputWriter
cpp/test_toolkit/test-options.h:226
↓ 7 callersMethodInsert
cpp/AddingCredits.cc:17
↓ 7 callersMethodInsert
cpp/Update_BST.cc:21
↓ 7 callersFunctionListPivoting
@include
cpp/list-pivoting.cc:16
↓ 7 callersFunctionLongestValidParentheses
@include
cpp/longest-valid-parentheses.cc:18
↓ 7 callersFunctionMergeTwoSortedLists
Merges two sorted doubly linked lists, returns the head of merged list.
cpp/Merge_two_BSTs.cc:109
↓ 7 callersFunctionMultiply
@include
cpp/Bignumber_multiplication.cc:26
↓ 7 callersFunctionOverlappingLists
@include
cpp/Overlapping_lists.cc:19
↓ 7 callersMethodPeek
cpp/Stack_queue_using_heap.cc:34
↓ 7 callersFunctionReverseSublist
@include
cpp/reverse_linked_list_from_s_to_f.cc:15
↓ 7 callersFunctionSSDecodeColID
@include
cpp/Spreadsheet_encoding.cc:26
↓ 7 callersFunctionSearchEntryEqualToItsIndex
@include
cpp/Binary_search_Ai=i.cc:19
↓ 7 callersFunctionSearchSmallest
@include
cpp/Binary_search_circular_array.cc:19
↓ 7 callersFunctionUnitTest
cpptest/snake-stringTest.cc:7
↓ 7 callersFunctionUnitTest
cpptest/intersect_sorted_arrays3Test.cc:12
↓ 7 callersFunctionUnitTest
cpptest/Number_waysTest.cc:7
↓ 7 callersMethodValue
cpp/View_from_above.cc:33
↓ 7 callersMethodassertDequeue
(Queue q, int t)
java/src/main/java/com/epi/QueueUsingTwoIntegers.java:34
↓ 7 callersMethodcalculateLargestRectangle
(List<Integer> heights)
java/src/main/java/com/epi/LargestRectangleUnderSkyline.java:48
↓ 7 callersMethodcheck
(ListNode L, ListNode expectedValue)
java/src/main/java/com/epi/CheckingCycle.java:40
↓ 7 callersMethodcompareTo
(Star rhs)
java/src/main/java/com/epi/ClosestStars.java:39
↓ 7 callersMethodcreateOutputList
( List<BinaryTreeNode<Integer>> L)
java/src/main/java/com/epi/ExteriorBinaryTree.java:60
↓ 7 callersMethodexteriorBinaryTree
( BinaryTreeNode<Integer> tree)
java/src/main/java/com/epi/ExteriorBinaryTree.java:12
↓ 7 callersMethodfindFirstEqualK
(BSTNode<Integer> tree, int k)
java/src/main/java/com/epi/SearchBSTForFirstOccurrenceRecursive.java:7
↓ 7 callersMethodgenerateAllBinaryTrees
( int numNodes)
java/src/main/java/com/epi/UniqueBinaryTreesAll.java:11
↓ 7 callersMethodinsert
(Integer key)
java/src/main/java/com/epi/UpdateBST.java:23
↓ 7 callersMethodinsert
(String clientID, int c)
java/src/main/java/com/epi/AddingCredits.java:18
↓ 7 callersFunctionlength_of_last_word
@include
cpp/length-of-last-word.cc:17
↓ 7 callersMethodlistPivoting
(ListNode<Integer> L, int x)
java/src/main/java/com/epi/ListPivoting.java:7
↓ 7 callersMethodlongestValidParentheses
(String s)
java/src/main/java/com/epi/LongestValidParentheses.java:8
↓ 7 callersMethodoverlappingLists
(ListNode<Integer> L1, ListNode<Integer> L2)
java/src/main/java/com/epi/OverlappingLists.java:11
↓ 7 callersMethodsearchEntryEqualToItsIndex
(List<Integer> A)
java/src/main/java/com/epi/BinarySearchAiEqI.java:15
↓ 7 callersMethodsearchSmallest
(List<Integer> A)
java/src/main/java/com/epi/BinarySearchCircularArray.java:13
↓ 7 callersMethodsimplePrint
(boolean[] array)
java/src/main/java/com/epi/utils/Utils.java:105
↓ 7 callersMethodssDecodeColID
(final String col)
java/src/main/java/com/epi/SpreadsheetEncoding.java:35
↓ 7 callersMethodunitTest
(AbstractTestOptions options, String description, List<Integer> a, List<Integer
java/src/main/java/com/epi/IntersectSortedArrays3Test.java:20
↓ 7 callersMethodunitTest
(AbstractTestOptions options, String description, String input, String expected
java/src/main/java/com/epi/SnakeStringTest.java:15
↓ 7 callersMethodunitTest
(AbstractTestOptions options, String description, int n, int m)
java/src/main/java/com/epi/NumberWaysTest.java:36
↓ 6 callersFunctionAddTwoNumbers
@include
cpp/add-two-number-list.cc:18
↓ 6 callersFunctionBinarySearchUnknownLength
@include
cpp/Binary_search_unknown_length.cc:19
↓ 6 callersFunctionCanReachEnd
@include
cpp/jump-game.cc:20
↓ 6 callersFunctionCheckAnswer
O(n^2) checking
cpp/Nearest_repetition.cc:51
↓ 6 callersFunctionCheckAnswer
O(n^2) check answer.
cpp/2-exists.cc:67
↓ 6 callersFunctionCountCombinations
cpp/Score_combination_alternative.cc:15
↓ 6 callersMethodEmpty
cpp/Stack_with_max.h:18
↓ 6 callersFunctionEqualVector
cpp/Bignumber_multiplication.cc:71
↓ 6 callersFunctionFibonacci
@include
cpp/fibonacci-iterative.cc:16
↓ 6 callersFunctionFibonacci
cpp/fibonacci.cc:18
↓ 6 callersFunctionFindFirstEqualK
@include
cpp/Search_BST_for_first_occurrence_iterative.cc:12
↓ 6 callersFunctionFindKthInTwoSortedArrays
template <typename T> T FindKthInTwoSortedArrays( const vector<T> &A, const vector<T> &B, int k) { // Not enough elements in A and B if (k > A.s
cpp/Find_kth_element_in_two_sorted_arrays.cc:59
↓ 6 callersFunctionFindNearestRepetition
@include
cpp/Nearest_repetition.cc:35
↓ 6 callersFunctionFindSuccessor
@include
cpp/Successor.cc:15
↓ 6 callersMethodGCD
(long x, long y)
java/src/main/java/com/epi/GCD1.java:7
↓ 6 callersMethodInsert
cpp/Tournament_tree.cc:21
↓ 6 callersFunctionIsBinaryTreeBST
@include
cpp/is_binary_tree_a_BST.cc:20
↓ 6 callersFunctionIsBinaryTreeBST
cpp/is_binary_tree_a_BST_BFS.cc:25
↓ 6 callersFunctionIsBinaryTreeBST
@include
cpp/is_binary_tree_a_BST_const_space.cc:18
↓ 6 callersFunctionIsInterleavingString
@include
cpp/interleaving-string.cc:22
↓ 6 callersFunctionLCA
cpp/Lowest_common_ancestor_no_parent.cc:25
↓ 6 callersMethodLCA
(BinaryTreeNode<Integer> tree, BinaryTreeNode<Integer> node0,
java/src/main/java/com/epi/LowestCommonAncestorNoParent.java:17
↓ 6 callersMethodPush
cpp/Stack_with_max.h:36
← previousnext →201–300 of 3,944, ranked by callers