MCPcopy Create free account

hub / github.com/DestinationFAANG/Destination-FAANG-Java-Solution / functions

Functions291 in github.com/DestinationFAANG/Destination-FAANG-Java-Solution

↓ 91 callersMethodadd
(int[] point)
2013 Detect Squares/2013 Detect Squares.java:20
↓ 46 callersMethodisEmpty
()
622 Design Circular Queue/622 Design Circular Queue.java:54
↓ 38 callersMethodget
(int key)
146 LRU Cache/146 LRU Cache.java:39
↓ 38 callersMethodput
(int key, int value)
146 LRU Cache/146 LRU Cache.java:49
↓ 34 callersMethodcontainsKey
(char ch)
208 Implement Trie (Prefix Tree)/208 Implement Trie (Prefix Tree).java:21
↓ 27 callersMethodget
(char ch)
208 Implement Trie (Prefix Tree)/208 Implement Trie (Prefix Tree).java:24
↓ 17 callersMethodpeek
()
232 Implement Queue using Stacks/232 Implement Queue using Stacks.java:31
↓ 15 callersMethodput
(char ch, TrieNode node)
208 Implement Trie (Prefix Tree)/208 Implement Trie (Prefix Tree).java:27
↓ 14 callersMethodremove
(int val)
380 Insert Delete GetRandom O(1)/380 Insert Delete GetRandom O(1).java:32
↓ 9 callersMethodadd
(int val)
703 Kth Largest Element in a Stream/703 Kth Largest Element in a Stream.java:25
↓ 8 callersMethodcompare
(String a, String b)
179 Largest Number/179 Largest Number.java:19
↓ 7 callersMethodpop
()
155 Min Stack/155 Min Stack.java:26
↓ 7 callersMethodpush
(int val)
155 Min Stack/155 Min Stack.java:18
↓ 6 callersMethodremove
(Node node)
146 LRU Cache/146 LRU Cache.java:66
↓ 4 callersMethoddfs
(int row, int col, boolean[][] reachable, int[][] heights)
417 Pacific Atlantic Water Flow/417 Pacific Atlantic Water Flow.java:38
↓ 4 callersMethodpop
()
716 max stack/716 max stack.java:26
↓ 4 callersMethodpush
(int x)
232 Implement Queue using Stacks/232 Implement Queue using Stacks.java:20
↓ 3 callersMethodinsertAtHead
(Node node)
146 LRU Cache/146 LRU Cache.java:71
↓ 3 callersMethodpop
()
232 Implement Queue using Stacks/232 Implement Queue using Stacks.java:25
↓ 3 callersMethodpush
(int x)
716 max stack/716 max stack.java:20
↓ 2 callersMethodappendSpaces
(StringBuilder sb, int count)
68 Text Justification/68 Text Justification.java:58
↓ 2 callersMethodcheckPalindrome
(String s, int left, int right)
5 Longest Palindromic Substring/5 Longest Palindromic Substring.java:26
↓ 2 callersMethodcountSquares
(int x1, int y1, int x3, int y3, int y2, int countY2)
2013 Detect Squares/2013 Detect Squares.java:61
↓ 2 callersMethodfind
(int[] parent, int node)
684 Redundant Connection/684 Redundant Connection.java:40
↓ 2 callersMethodfindBound
(int[] nums, int target, boolean isFirst)
34 Find First and Last Position of Element in Sorted Array/34 Find First and Last Position of Element in Sorted Array.java:23
↓ 2 callersMethodget
(String key, int timestamp)
981 Time Based Key-Value Store/981 Time Based Key-Value Store.java:20
↓ 2 callersMethodgetHeight
(TreeNode node)
110 Balanced Binary Tree/110 Balanced Binary Tree.java:39
↓ 2 callersMethodmatches
(int[] s1Map, int[] s2Map)
567 Permutation in String/567 Permutation in String.java:38
↓ 2 callersMethodmoveIfNeeded
()
232 Implement Queue using Stacks/232 Implement Queue using Stacks.java:42
↓ 2 callersMethodreverse
(ListNode head)
234 Palindrome Linked List/234 Palindrome Linked List.java:43
↓ 2 callersMethodsearchPrefix
(String word)
208 Implement Trie (Prefix Tree)/208 Implement Trie (Prefix Tree).java:58
↓ 2 callersMethodswap
(int[] nums, int i, int j)
31 Next Permutation/31 Next Permutation.java:29
↓ 1 callersMethodapplyOperator
(String operator, int a, int b)
150 Evaluate Reverse Polish Notation/150 Evaluate Reverse Polish Notation.java:33
↓ 1 callersMethodbackTrack
(int target, List<List<Integer>> res, List<Integer> combination, int start, int[] c
39 Combination Sum/39 Combination Sum.java:12
↓ 1 callersMethodbacktrack
(List<List<Integer>> result, List<Integer> current, int[] nums, int start)
90 Subsets II/90 Subsets II.java:18
↓ 1 callersMethodbacktrack
(List<String> ans, StringBuilder cur, int open, int close, int max)
22 Generate Parentheses/22 Generate Parentheses.java:18
↓ 1 callersMethodbacktrack
(List<List<String>> result, List<String> current, String s, int start)
131 Palindrome Partitioning/131 Palindrome Partitioning.java:16
↓ 1 callersMethodbacktrack
(int row, int col, String word, int index)
79 Word Search/79 Word Search.java:29
↓ 1 callersMethodbacktrack
(List<List<Integer>> result, List<Integer> current, int[] candidates, int target, int start)
40 Combination Sum II/40 Combination Sum II.java:18
↓ 1 callersMethodbacktrack
(List<List<Integer>> result, List<Integer> current, int[] nums, boolean[] used)
46 permutations/46 Permutations.java:21
↓ 1 callersMethodbacktrack
(char[][] board, int col, List<List<String>> result)
51 N-Queens/51 N-Queens.java:22
↓ 1 callersMethodbacktracking
(int row, int col, TrieNode parent)
212 Word Search II/212 Word Search II.java:50
↓ 1 callersMethodcanFinish
(int[] piles, int speed, int h)
875 Koko Eating Bananas/875 Koko Eating Bananas.java:27
↓ 1 callersMethodconstruct
(char[][] board)
51 N-Queens/51 N-Queens.java:59
↓ 1 callersMethodcountGoodNodes
(TreeNode node, int maxSoFar)
1448 Count Good Nodes in Binary Tree/1448 Count Good Nodes in Binary Tree.java:29
↓ 1 callersMethodcountNums
(int[] nums)
169 Majority Element/Majority Element.java:9
↓ 1 callersMethodcourseSchedule
(int course, HashSet<Integer> visited, HashMap<Integer, List<Integer>> cou
207 Course Schedule/207 Course Schedule.java:28
↓ 1 callersMethoddfs
(int row, int col, char[][] grid)
200 Number of Islands/200 Number of Islands.java:21
↓ 1 callersMethoddfs
(int[][] grid, int i, int j)
695 Max Area of Island/695 Max Area of Island.java:24
↓ 1 callersMethoddfs
(int node)
210 Course Schedule II/210 Course Schedule II.java:32
↓ 1 callersMethoddfs
(List<Integer>[] adjList, int[] visited, int node)
323 Number of Connected Components in an Undirected Graph/323 Number of Connected Components in an Undirected Graph.java:27
↓ 1 callersMethoddfs
(char[][] board, int i, int j)
130 Surrounded Regions/130 Surrounded Regions.java:35
↓ 1 callersMethoddfs
(int[][] matrix, int i, int j, int[][] cache)
329 Longest Increasing Path in a Matrix/329 Longest Increasing Path in a Matrix.java:27
↓ 1 callersMethoddfs
(String airport, Map<String, List<String>> graph, LinkedList<String> itinerary)
332 Reconstruct Itinerary/332 Reconstruct Itinerary.java:30
↓ 1 callersMethoddfs
(Character c)
269 Alien Dictionary/269 Alien Dictionary.java:47
↓ 1 callersMethodfollow
(int id)
355 Design Twitter/355 Design Twitter.java:28
↓ 1 callersMethodgenerateSubsets
(int index, int[] nums, List<Integer> current, List<List<Integer>> result)
78 Subsets/78 Subsets.java:17
↓ 1 callersMethodgetHeight
(TreeNode node)
543 Diameter of Binary Tree/543 Diameter of Binary Tree.java:33
↓ 1 callersMethodgetMid
(ListNode head)
148 Sort List/148 Sort List.java:26
↓ 1 callersMethodgetSumOfSquares
(int n)
202 Happy Number/202 Happy Number.java:20
↓ 1 callersMethodinOrder
(TreeNode root)
98 Validate Binary Search Tree/98 Validate Binary Search Tree.java:16
↓ 1 callersMethodinit
(int numCourses)
210 Course Schedule II/210 Course Schedule II.java:20
↓ 1 callersMethodisCelebrity
(int i)
277 Find the Celebrity/277 Find the Celebrity.java:35
↓ 1 callersMethodisEnd
()
208 Implement Trie (Prefix Tree)/208 Implement Trie (Prefix Tree).java:33
↓ 1 callersMethodisFull
()
622 Design Circular Queue/622 Design Circular Queue.java:59
↓ 1 callersMethodisMirror
(TreeNode left, TreeNode right)
101 Symmetric Tree/101 Symmetric Tree.java:22
↓ 1 callersMethodisOperator
(String token)
150 Evaluate Reverse Polish Notation/150 Evaluate Reverse Polish Notation.java:29
↓ 1 callersMethodisPalindrome
(String s, int start, int end)
131 Palindrome Partitioning/131 Palindrome Partitioning.java:31
↓ 1 callersMethodisSame
(TreeNode s, TreeNode t)
572 Subtree of Another Tree/572 Subtree of Another Tree.java:6
↓ 1 callersMethodisValid
(char[][] board, int row, int col)
51 N-Queens/51 N-Queens.java:37
↓ 1 callersMethodmaxGain
(TreeNode node)
124 Binary Tree Maximum Path Sum/124 Binary Tree Maximum Path Sum.java:9
↓ 1 callersMethodmerge
(ListNode list1, ListNode list2)
148 Sort List/148 Sort List.java:38
↓ 1 callersMethodorder
(TreeNode node, int level)
102 Binary Tree Level Order Traversal/102 Binary Tree Level Order Traversal.java:9
↓ 1 callersMethodpeekMax
()
716 max stack/716 max stack.java:35
↓ 1 callersMethodpost
(int id)
355 Design Twitter/355 Design Twitter.java:38
↓ 1 callersMethodraceCar
(int target, int[] dp)
818 Race Car/818 Race Car.java:20
↓ 1 callersMethodrecdeserialize
(List<String> strs)
297 Serialize and Deserialize Binary Tree/297 Serialize and Deserialize Binary Tree.java:27
↓ 1 callersMethodrecserialize
(TreeNode root, String str)
297 Serialize and Deserialize Binary Tree/297 Serialize and Deserialize Binary Tree.java:7
↓ 1 callersMethodreverse
(int[] nums, int i)
31 Next Permutation/31 Next Permutation.java:35
↓ 1 callersMethodreverseLinkedList
(ListNode head, int k)
25 Reverse Nodes in k-Group/Reverse Nodes in k-Group.java:59
↓ 1 callersMethodsearchInNode
(String word, TrieNode node)
211 Design Add and Search Words Data Structure/211 Design Add and Search Words Data Structure.java:32
↓ 1 callersMethodset
(String key, String value, int timestamp)
981 Time Based Key-Value Store/981 Time Based Key-Value Store.java:16
↓ 1 callersMethodsetEnd
()
208 Implement Trie (Prefix Tree)/208 Implement Trie (Prefix Tree).java:30
↓ 1 callersMethodstartsWith
(String prefix)
208 Implement Trie (Prefix Tree)/208 Implement Trie (Prefix Tree).java:78
↓ 1 callersMethodtop
()
716 max stack/716 max stack.java:31
↓ 1 callersMethodtwoSum2
(int[] nums, int i, List<List<Integer>> result)
15 3sum/15 3-Sum.java:21
MethodDetectSquares
()
2013 Detect Squares/2013 Detect Squares.java:15
MethodFront
()
622 Design Circular Queue/622 Design Circular Queue.java:42
MethodInterval
(int start, int end)
759 Employee Free Time/759 Employee Free Time.java:18
MethodKthLargest
(int k, int[] nums)
703 Kth Largest Element in a Stream/703 Kth Largest Element in a Stream.java:15
MethodLRUCache
(int capacity)
146 LRU Cache/146 LRU Cache.java:30
MethodMaxStack
()
716 max stack/716 max stack.java:15
MethodMinStack
initialize your data structure here.
155 Min Stack/155 Min Stack.java:14
MethodMovingAverage
(int size)
346 Moving Average from Data Stream/346 Moving Average from Data Stream.java:13
MethodMyCircularQueue
(int k)
622 Design Circular Queue/622 Design Circular Queue.java:17
MethodMyQueue
()
232 Implement Queue using Stacks/232 Implement Queue using Stacks.java:14
MethodNode
(int val, int min, Node next)
155 Min Stack/155 Min Stack.java:43
MethodNode
(int key, int value)
146 LRU Cache/146 LRU Cache.java:19
MethodRandomizedSet
()
380 Insert Delete GetRandom O(1)/380 Insert Delete GetRandom O(1).java:17
MethodRear
()
622 Design Circular Queue/622 Design Circular Queue.java:47
next →1–100 of 291, ranked by callers