MCPcopy Create free account

hub / github.com/danielblanco96/algoritmos-estructuras-datos-entrevistas-udemy / functions

Functions286 in github.com/danielblanco96/algoritmos-estructuras-datos-entrevistas-udemy

⨍ Functions 286◇ Types & classes 180
↓ 24 callersMethodadd
(int value)
05-StacksQueues/src/main/java/com/danielblanco/algoritmosestructuras/_00_stackqueue/MyQueue.java:7
↓ 17 callersMethodaddEdge
(String start, String end)
07-Graphs/src/main/java/com/danielblanco/algoritmosestructuras/graphs/_00_graph_search/Graph.java:21
↓ 15 callersMethodprint
()
04-LinkedLists/src/main/java/com/danielblanco/algoritmosestructuras/_00_linkedlist/SingleLinkedList.java:38
↓ 13 callersMethodgetOrCreateNode
(String name)
07-Graphs/src/main/java/com/danielblanco/algoritmosestructuras/graphs/_00_graph_search/Graph.java:12
↓ 13 callersMethodsearch
(String prefix)
09-Tries/src/main/java/com/danielblanco/algoritmosestructuras/tries/_00_trie/Trie.java:26
↓ 10 callersMethodisEmpty
()
05-StacksQueues/src/main/java/com/danielblanco/algoritmosestructuras/_00_stackqueue/MyQueue.java:43
↓ 9 callersMethodclear
(Graph graph)
07-Graphs/src/test/java/com/danielblanco/algoritmosestructuras/graphs/_01_route_between_nodes/RouteBetweenNodesTest.java:67
↓ 9 callersMethodisRouteBetween
(Graph g, GraphNode start, GraphNode end)
07-Graphs/src/main/java/com/danielblanco/algoritmosestructuras/graphs/_01_route_between_nodes/RouteBetweenNodes.java:26
↓ 9 callersMethodpop
()
05-StacksQueues/src/main/java/com/danielblanco/algoritmosestructuras/_00_stackqueue/MyStack.java:12
↓ 9 callersMethodpush
(int value)
05-StacksQueues/src/main/java/com/danielblanco/algoritmosestructuras/_00_stackqueue/MyStack.java:6
↓ 9 callersMethodsize
()
05-StacksQueues/src/main/java/com/danielblanco/algoritmosestructuras/_01_queue_with_stacks/QueueWithStacks.java:37
↓ 8 callersMethodbinarySearch
(int[] array, int target)
11-Searching/src/main/java/com/danielblanco/algoritmosestructuras/searching/_00_binary_search/BinarySearchIterative.java:5
↓ 8 callersMethodbinarySearch
(int[] array, int target)
11-Searching/src/main/java/com/danielblanco/algoritmosestructuras/searching/_00_binary_search/BinarySearch.java:5
↓ 8 callersMethodmax
(int a, int b)
00-CodeSamples/00-CodeSamples/src/main/java/com/danielblanco/algoritmosestructuras/codesamples/CodeSamples.java:84
↓ 7 callersMethodextractMin
()
08-Heaps/src/main/java/com/danielblanco/algoritmosestructuras/heaps/_00_min_heap/MinHeap.java:49
↓ 7 callersMethodinsert
(int element)
08-Heaps/src/main/java/com/danielblanco/algoritmosestructuras/heaps/_00_min_heap/MinHeap.java:35
↓ 7 callersMethodleftChildIndex
(int i)
08-Heaps/src/main/java/com/danielblanco/algoritmosestructuras/heaps/_00_min_heap/MinHeap.java:20
↓ 7 callersMethodrightChildIndex
(int i)
08-Heaps/src/main/java/com/danielblanco/algoritmosestructuras/heaps/_00_min_heap/MinHeap.java:24
↓ 6 callersMethodadd
(int val)
08-Heaps/src/main/java/com/danielblanco/algoritmosestructuras/heaps/_01_kth_largest_element/KthLargest.java:25
↓ 6 callersMethodinsert
(String word)
09-Tries/src/main/java/com/danielblanco/algoritmosestructuras/tries/_00_trie/Trie.java:10
↓ 6 callersMethodsearchTest
(Graph graph, String target)
07-Graphs/src/test/java/com/danielblanco/algoritmosestructuras/graphs/_00_graph_search/SearchTest.java:27
↓ 5 callersMethodappendToTail
(int value)
04-LinkedLists/src/main/java/com/danielblanco/algoritmosestructuras/_00_linkedlist/SingleLinkedList.java:6
↓ 5 callersMethodgetSum
(int a, int b)
13-BitManipulation/src/main/java/com/danielblanco/algoritmosestructuras/bitmanipulation/_04_sum_integers/SumIntegers.java:14
↓ 5 callersMethodnthNodeToLast
(Node head, int n)
04-LinkedLists/src/main/java/com/danielblanco/algoritmosestructuras/_03_nth_node_to_last/NthNodeToLast.java:14
↓ 5 callersMethodpeek
()
05-StacksQueues/src/main/java/com/danielblanco/algoritmosestructuras/_00_stackqueue/MyQueue.java:35
↓ 4 callersMethodadd
(Integer value)
05-StacksQueues/src/main/java/com/danielblanco/algoritmosestructuras/_01_queue_with_stacks/QueueWithStacks.java:21
↓ 4 callersMethodequals
(Object obj)
07-Graphs/src/main/java/com/danielblanco/algoritmosestructuras/graphs/_00_graph_search/GraphNode.java:35
↓ 4 callersMethodmin
()
05-StacksQueues/src/main/java/com/danielblanco/algoritmosestructuras/_04_stack_min/StackMin.java:17
↓ 4 callersMethodpush
(Integer data)
05-StacksQueues/src/main/java/com/danielblanco/algoritmosestructuras/_04_stack_min/StackMin.java:9
↓ 4 callersMethodremove
()
05-StacksQueues/src/main/java/com/danielblanco/algoritmosestructuras/_01_queue_with_stacks/QueueWithStacks.java:29
↓ 4 callersMethodsort
(Deque<Integer> stack)
05-StacksQueues/src/main/java/com/danielblanco/algoritmosestructuras/_03_sort_stack/SortStack.java:16
↓ 4 callersMethodswap
(int[] array, int i, int j)
10-Sorting/src/main/java/com/danielblanco/algoritmosestructuras/sorting/_00_sorting/SearchUtils.java:4
↓ 3 callersMethodcontainsAll
(List<List<String>> anagrams, List<String> group)
03-ArraysStringsHashTables/src/test/java/com/danielblanco/algoritmosestructuras/arraysstringshashtables/_03_group_anagrams/GroupAnagramsTest.java:25
↓ 3 callersMethoddeleteNode
(int value)
04-LinkedLists/src/main/java/com/danielblanco/algoritmosestructuras/_00_linkedlist/SingleLinkedList.java:19
↓ 3 callersMethodfirstCommonAncestor
(Node root, Node firstNode, Node secondNode)
06-Trees/src/main/java/com/danielblanco/algoritmosestructuras/trees/_06_first_common_ancestor/FirstCommonAncestor.java:22
↓ 3 callersMethodisUnique
(String s)
03-ArraysStringsHashTables/src/main/java/com/danielblanco/algoritmosestructuras/arraysstringshashtables/_01_is_unique/IsUnique.java:11
↓ 3 callersMethodlengthOfLongestSubstring
(String s)
14-ExtraProblems/src/main/java/com/danielblanco/algoritmosestructuras/extra/_04_longest_unique_substring/LongestUniqueSubstring.java:17
↓ 3 callersMethodnumberOfBitsToFlipToConvert
(int a, int b)
13-BitManipulation/src/main/java/com/danielblanco/algoritmosestructuras/bitmanipulation/_03_number_conversion/NumberConversion.java:16
↓ 3 callersMethodnumberOfOneBits
(int n)
13-BitManipulation/src/main/java/com/danielblanco/algoritmosestructuras/bitmanipulation/_01_number_of_one_bits/NumberOfOneBits.java:16
↓ 3 callersMethodparentIndex
(int i)
08-Heaps/src/main/java/com/danielblanco/algoritmosestructuras/heaps/_00_min_heap/MinHeap.java:16
↓ 3 callersMethodprintHeap
()
08-Heaps/src/main/java/com/danielblanco/algoritmosestructuras/heaps/_00_min_heap/MinHeap.java:81
↓ 3 callersMethodremove
()
05-StacksQueues/src/main/java/com/danielblanco/algoritmosestructuras/_00_stackqueue/MyQueue.java:20
↓ 3 callersMethodreverse
(ListNode head, int k)
14-ExtraProblems/src/main/java/com/danielblanco/algoritmosestructuras/extra/_03_reverse_nodes_kgroup/ReverseNodesKGroupSolution.java:56
↓ 3 callersMethodswap
(int x, int y)
08-Heaps/src/main/java/com/danielblanco/algoritmosestructuras/heaps/_00_min_heap/MinHeap.java:85
↓ 2 callersMethodaddTwoNumbers
(Node list1, Node list2)
04-LinkedLists/src/main/java/com/danielblanco/algoritmosestructuras/_04_add_two_numbers/AddTwoNumbers.java:16
↓ 2 callersMethodappendList
(Node current, Node listToAppend)
04-LinkedLists/src/main/java/com/danielblanco/algoritmosestructuras/_02_merge__two_sorted_lists/MergeTwoSortedListsSolution.java:42
↓ 2 callersMethodappendList
(Node current, Node listToAppend)
14-ExtraProblems/src/main/java/com/danielblanco/algoritmosestructuras/extra/_01_merge_k_sorted_lists/MergeKSortedListsSolution.java:73
↓ 2 callersMethodbuildOrder
(String[] projects, String[][] dependencies)
07-Graphs/src/main/java/com/danielblanco/algoritmosestructuras/graphs/_03_build_order/BuildOrder.java:27
↓ 2 callersMethodcoinChange
(int[] coins, int amount)
14-ExtraProblems/src/main/java/com/danielblanco/algoritmosestructuras/extra/_06_coin_change/CoinChange.java:23
↓ 2 callersMethoddepthFirstSearch
(Graph graph, String target)
07-Graphs/src/main/java/com/danielblanco/algoritmosestructuras/graphs/_00_graph_search/DepthFirstSearch.java:4
↓ 2 callersMethodfibonacciBottomUp
(int n)
00-CodeSamples/00-CodeSamples/src/main/java/com/danielblanco/algoritmosestructuras/codesamples/CodeSamples.java:190
↓ 2 callersMethodfibonacciMemo
(int n)
00-CodeSamples/00-CodeSamples/src/main/java/com/danielblanco/algoritmosestructuras/codesamples/CodeSamples.java:176
↓ 2 callersMethodfindRedundantConnection
(int[][] edges)
07-Graphs/src/main/java/com/danielblanco/algoritmosestructuras/graphs/_05_redundant_connection/RedundantConnection.java:19
↓ 2 callersMethodgetBit
(int number, int i)
13-BitManipulation/src/main/java/com/danielblanco/algoritmosestructuras/bitmanipulation/_04_sum_integers/SumIntegersSolution.java:35
↓ 2 callersMethodgetBit
(int n, int i)
13-BitManipulation/src/main/java/com/danielblanco/algoritmosestructuras/bitmanipulation/_02_reverse_int/ReverseIntSolution.java:28
↓ 2 callersMethodgetPath
(boolean[][] grid)
12-DynamicProgramming/src/main/java/com/danielblanco/algoritmosestructuras/dp/_01_robot_in_grid/RobotInGridSolution.java:37
↓ 2 callersMethodgroupAnagrams
(String[] words)
03-ArraysStringsHashTables/src/main/java/com/danielblanco/algoritmosestructuras/arraysstringshashtables/_03_group_anagrams/GroupAnagrams.java:15
↓ 2 callersMethodisEmpty
()
05-StacksQueues/src/main/java/com/danielblanco/algoritmosestructuras/_01_queue_with_stacks/QueueWithStacksSolution.java:43
↓ 2 callersMethodisEmpty
()
05-StacksQueues/src/main/java/com/danielblanco/algoritmosestructuras/_01_queue_with_stacks/QueueWithStacks.java:33
↓ 2 callersMethodisSubtree
(Node first, Node second)
06-Trees/src/main/java/com/danielblanco/algoritmosestructuras/trees/_05_is_subtree/IsSubTree.java:40
↓ 2 callersMethodisValid
(String s)
05-StacksQueues/src/main/java/com/danielblanco/algoritmosestructuras/_02_valid_parenthesis/ValidParenthesis.java:17
↓ 2 callersMethodisValidBST
(Node root)
06-Trees/src/main/java/com/danielblanco/algoritmosestructuras/trees/_04_validate_bst/ValidateBST.java:30
↓ 2 callersMethodmaxDepth
(Node root)
06-Trees/src/main/java/com/danielblanco/algoritmosestructuras/trees/_03_maximum_depth/MaximumDepth.java:19
↓ 2 callersMethodmaxPathSum
(TreeNode root)
12-DynamicProgramming/src/main/java/com/danielblanco/algoritmosestructuras/dp/_05_binary_tree_max_path_sum/BinaryTreeMaxPathSum.java:43
↓ 2 callersMethodmaxSubArray
(int[] nums)
12-DynamicProgramming/src/main/java/com/danielblanco/algoritmosestructuras/dp/_04_maximum_subarray/MaximumSubarray.java:21
↓ 2 callersMethodnumberOfProvinces
(int[][] isConnected)
07-Graphs/src/main/java/com/danielblanco/algoritmosestructuras/graphs/_04_number_of_provinces/NumberOfProvinces.java:20
↓ 2 callersMethodpop
()
05-StacksQueues/src/main/java/com/danielblanco/algoritmosestructuras/_04_stack_min/StackMin.java:13
↓ 2 callersMethodpreOrder
(Node node, StringBuilder stb)
06-Trees/src/main/java/com/danielblanco/algoritmosestructuras/trees/_05_is_subtree/IsSubTreeSolution.java:50
↓ 2 callersMethodresetNodes
(Graph graph)
07-Graphs/src/test/java/com/danielblanco/algoritmosestructuras/graphs/_00_graph_search/SearchTest.java:35
↓ 2 callersMethodreverseBits
(int n)
13-BitManipulation/src/main/java/com/danielblanco/algoritmosestructuras/bitmanipulation/_02_reverse_int/ReverseInt.java:16
↓ 2 callersMethodrob
(int[] nums)
14-ExtraProblems/src/main/java/com/danielblanco/algoritmosestructuras/extra/_05_house_robber/HouseRobberSolution.java:18
↓ 2 callersMethodsetColToZero
(int[][] matrix, int col)
03-ArraysStringsHashTables/src/main/java/com/danielblanco/algoritmosestructuras/arraysstringshashtables/_04_zero_matrix/ZeroMatrixSolution.java:95
↓ 2 callersMethodsetRowToZero
(int[][] matrix, int row)
03-ArraysStringsHashTables/src/main/java/com/danielblanco/algoritmosestructuras/arraysstringshashtables/_04_zero_matrix/ZeroMatrixSolution.java:81
↓ 2 callersMethodshiftStacks
()
05-StacksQueues/src/main/java/com/danielblanco/algoritmosestructuras/_01_queue_with_stacks/QueueWithStacksSolution.java:25
↓ 2 callersMethodtitleSuggestions
(String[] books, String[] prefixes, boolean ignoreCase)
09-Tries/src/main/java/com/danielblanco/algoritmosestructuras/tries/_01_title_suggestions/TitleSuggestions.java:29
↓ 2 callersMethodtopKFrequent
(int[] nums, int k)
08-Heaps/src/main/java/com/danielblanco/algoritmosestructuras/heaps/_02_top_k_frequent_elements/TopKFrequent.java:24
↓ 2 callersMethodtwoSum
(int[] nums, int target)
03-ArraysStringsHashTables/src/main/java/com/danielblanco/algoritmosestructuras/arraysstringshashtables/_02_two_sum/TwoSum.java:20
↓ 2 callersMethodupdateBit
(int n, int i, int bit)
13-BitManipulation/src/main/java/com/danielblanco/algoritmosestructuras/bitmanipulation/_02_reverse_int/ReverseIntSolution.java:32
↓ 2 callersMethodwordBreak
(String s, List<String> wordDict)
14-ExtraProblems/src/main/java/com/danielblanco/algoritmosestructuras/extra/_02_word_break/WordBreak.java:25
↓ 2 callersMethodzeroMatrix
(int[][] matrix)
03-ArraysStringsHashTables/src/main/java/com/danielblanco/algoritmosestructuras/arraysstringshashtables/_04_zero_matrix/ZeroMatrix.java:21
↓ 1 callersMethodadd
(int val)
08-Heaps/src/main/java/com/danielblanco/algoritmosestructuras/heaps/_01_kth_largest_element/KthLargestSolution.java:48
↓ 1 callersMethodaddNeighbor
(GraphNode node)
07-Graphs/src/main/java/com/danielblanco/algoritmosestructuras/graphs/_00_graph_search/GraphNode.java:21
↓ 1 callersMethodappendToNew
(int[] array, int val)
00-CodeSamples/00-CodeSamples/src/main/java/com/danielblanco/algoritmosestructuras/codesamples/CodeSamples.java:144
↓ 1 callersMethodbuildAnagramMap
(String[] strs)
03-ArraysStringsHashTables/src/main/java/com/danielblanco/algoritmosestructuras/arraysstringshashtables/_03_group_anagrams/GroupAnagramsSolution.java:27
↓ 1 callersMethodbuildDependencyGraph
(String[] projects, String[][] dependencies)
07-Graphs/src/main/java/com/danielblanco/algoritmosestructuras/graphs/_03_build_order/BuildOrderSolution.java:57
↓ 1 callersMethodbuildTrie
(String[] words, int maxLen)
09-Tries/src/main/java/com/danielblanco/algoritmosestructuras/tries/_02_word_search/WordSearchSolution.java:82
↓ 1 callersMethodcheckForZeroes
(int[][] matrix)
03-ArraysStringsHashTables/src/main/java/com/danielblanco/algoritmosestructuras/arraysstringshashtables/_04_zero_matrix/ZeroMatrixSolution.java:62
↓ 1 callersMethodclone
(Node node, Map<Integer, Node> map)
07-Graphs/src/main/java/com/danielblanco/algoritmosestructuras/graphs/_02_clone_graph/CloneGraphSolution.java:27
↓ 1 callersMethodcloneGraph
(Node node)
07-Graphs/src/main/java/com/danielblanco/algoritmosestructuras/graphs/_02_clone_graph/CloneGraph.java:20
↓ 1 callersMethoddepthSearchFirst
(GraphNode node, List<String> orderedProjects)
07-Graphs/src/main/java/com/danielblanco/algoritmosestructuras/graphs/_03_build_order/BuildOrderSolution.java:43
↓ 1 callersMethoddfs
(char[][] board, TrieNode current, int row, int col, List<String> result)
09-Tries/src/main/java/com/danielblanco/algoritmosestructuras/tries/_02_word_search/WordSearchSolution.java:54
↓ 1 callersMethoddfs
(int first, int second, int previous, List<Set<Integer>> adjList)
07-Graphs/src/main/java/com/danielblanco/algoritmosestructuras/graphs/_05_redundant_connection/RedundantConnectionSolution.java:42
↓ 1 callersMethoddfs
(int[][] isConnected, boolean[] visited, int city)
07-Graphs/src/main/java/com/danielblanco/algoritmosestructuras/graphs/_04_number_of_provinces/NumberOfProvincesSolution.java:30
↓ 1 callersMethodduplicateSubsetsAddingElement
(Integer element, List<List<Integer>> subsets)
12-DynamicProgramming/src/main/java/com/danielblanco/algoritmosestructuras/dp/_02_set_subsets/SetSubsetsSolution.java:36
↓ 1 callersMethodfibonacci
(int n)
00-CodeSamples/00-CodeSamples/src/main/java/com/danielblanco/algoritmosestructuras/codesamples/CodeSamples.java:171
↓ 1 callersMethodfindMinimumElementIndex
(int[] array, int start)
10-Sorting/src/main/java/com/danielblanco/algoritmosestructuras/sorting/_00_sorting/SelectionSort.java:14
↓ 1 callersMethodfindRelativeRanks
(int[] score)
08-Heaps/src/main/java/com/danielblanco/algoritmosestructuras/heaps/_03_relative_ranks/RelativeRanks.java:20
↓ 1 callersMethodfindWords
(char[][] board, String[] words)
09-Tries/src/main/java/com/danielblanco/algoritmosestructuras/tries/_02_word_search/WordSearch.java:26
↓ 1 callersMethodgenerateParenthesis
(int n)
12-DynamicProgramming/src/main/java/com/danielblanco/algoritmosestructuras/dp/_03_generate_parenthesis/GenerateParenthesis.java:24
↓ 1 callersMethodgetAnagramHash
(String s)
03-ArraysStringsHashTables/src/main/java/com/danielblanco/algoritmosestructuras/arraysstringshashtables/_03_group_anagrams/GroupAnagramsSolution.java:41
next →1–100 of 286, ranked by callers