MCPcopy Create free account

hub / github.com/bingyuhu02/FaceBook-Intern-Leetcode / functions

Functions246 in github.com/bingyuhu02/FaceBook-Intern-Leetcode

⨍ Functions 246◇ Types & classes 136
↓ 85 callersMethodlength
(String s, int start, int end)
Find the number of Palindrome/myCode.java:66
↓ 28 callersMethodprint
(TreeNode node, StringBuilder sb, List<String> res)
257. Binary Tree Paths/Solution.java:8
↓ 15 callersMethodpush
(int x)
155. Min Stack/Solution.java:6
↓ 9 callersMethodpop
()
155. Min Stack/Solution.java:14
↓ 9 callersMethodremove
(int[][] n, int row, int col, int x, int y)
remove island of area k/remove.java:64
↓ 4 callersMethodhelper
(List<List<Integer>> res, List<Integer> temp, int[] nums, int remain, int pos)
39. Combination Sum/Solution.java:8
↓ 4 callersMethodswap
(int[] nums, int a , int b)
75. Sort Colors/sortColor.java:16
↓ 3 callersMethodconvert
(TreeNode root)
Convert Binary Tree to Double LinkedList/BTtoDLL.java:22
↓ 3 callersMethodlength
(String s, int start, int end)
5. Longest Palindromic Substring/Solution.java:16
↓ 3 callersMethodnext
(List<List<Integer>> subset)
78. Subsets/myCode.java:41
↓ 2 callersMethodcalculate
(int x, int a , int b , int c)
360. Sort Transformed Array/Solution.java:31
↓ 2 callersMethodfindMax
(int[] arr)
Randomly return the index of maximal elements/myCode.java:7
↓ 2 callersMethodhelper
(String beginWord, String endWord, Set<String> wordList)
127. Word Ladder/wordladder.java:11
↓ 2 callersMethodhelper
( int left, int right, String s, StringBuilder sb)
Find the number of Palindrome/myCode.java:41
↓ 2 callersMethodhelper
(int nums[], List<Integer> list, List<List<Integer>> result)
46. Permutations/permutations.java:59
↓ 2 callersMethodisMatch
(TrieNode node, String word, int i, boolean searchPrefix)
208. Implement Trie (Prefix Tree)/Solution.java:43
↓ 2 callersMethodisValid
(int i , int j , int x , int y , int row , int col)
200. Number of Islands/Solution.java:29
↓ 2 callersMethodisValid
(int i , int j , int x , int y , int row , int col)
remove island of area k/remove.java:75
↓ 2 callersMethodisValid
(String s)
301. Remove Invalid Parentheses/Solution.java:44
↓ 2 callersMethodreplace
(String str, int i , char c )
127. Word Ladder/wordladder.java:46
↓ 2 callersMethodreverse
(List<Integer> a,int i)
31. Next Permutation/myCode.java:42
↓ 2 callersMethodswap
(int[] a, int i, int j)
47. Permutations II/permutationsII.java:40
↓ 2 callersMethodswap
(int[] n, int i , int j)
215. Kth Largest Element in an Array/Solution.java:43
↓ 2 callersMethodswap
(int[] a, int i, int j)
46. Permutations/permutations.java:108
↓ 1 callersMethodaddBinary
(String a, String b)
67. Add Binary/myCode.java:11
↓ 1 callersMethodaddOperators
(String n, int target)
282. Expression Add Operators/myCode.java:12
↓ 1 callersMethodbfs
(char[][] grid, int m, int n, int x, int y)
200. Number of Islands/Solution.java:54
↓ 1 callersMethodbinaryTreePaths
(TreeNode root)
257. Binary Tree Paths/myCode.java:13
↓ 1 callersMethodbuildString
(TreeNode root, StringBuilder sb)
297. Serialize and Deserialize Binary Tree/myCode.java:26
↓ 1 callersMethodbuildTree
(Deque<String> deque)
297. Serialize and Deserialize Binary Tree/myCode.java:41
↓ 1 callersMethodbuildTree
(Deque<Character> deque)
297. Serialize and Deserialize Binary Tree/LinkedList.java:64
↓ 1 callersMethodbuildtree
(int[] nums, int start, int end)
108. Convert Sorted Array to Binary Search Tree/Solution.java:6
↓ 1 callersMethodcalculate
(int x, int a , int b , int c)
360. Sort Transformed Array/myCode.java:17
↓ 1 callersMethodcheckMaxSize
(int[][] n)
200. Number of Islands/myCode.java:22
↓ 1 callersMethodcheckSize
(int[][] temp, int row, int col, int x, int y)
200. Number of Islands/myCode.java:53
↓ 1 callersMethodcheckSize
(int[][] temp, int row, int col, int x, int y)
remove island of area k/remove.java:52
↓ 1 callersMethodcount
(String s, int n)
38. Count and Say/Solution.java:5
↓ 1 callersMethodcountPaliWithDuplicate
(String s)
Find the number of Palindrome/myCode.java:53
↓ 1 callersMethodcountPaliWithoutDuplicate
(String s)
Find the number of Palindrome/myCode.java:19
↓ 1 callersMethodcycleSort
(int[] array)
Cycle Sort/myCode.java:10
↓ 1 callersMethoddfs
(char[][] b, List<String> res, StringBuilder sb, int x, int y)
print all path of a char board/myCode.java:24
↓ 1 callersMethoddfs
(StringBuilder sb, String digits, int pos , List<String> res)
17. Letter Combinations of a Phone Number/Solution.java:28
↓ 1 callersMethoddfs
(int[] n, int index, List<Integer> list, List<List<Integer>> res)
90. Subsets II/Solution.java:31
↓ 1 callersMethoddivide
(int a, int b)
29. Divide Two Integers/myCode.java:8
↓ 1 callersMethoddotProduct
(int[] a, int[] b)
Dot Product/myCode.java:9
↓ 1 callersMethoddoubleIntArray
(int[] arr)
double int array/myCode.java:10
↓ 1 callersMethodencode
(String s)
Run Length Encoding/myCode.java:12
↓ 1 callersMethodfib
(int n)
Fibonacci/Solution.java:9
↓ 1 callersMethodfibonacci
(int n)
Fibonacci/Fibonacci.java:2
↓ 1 callersMethodfindFirst
(TreeNode root1, TreeNode root2)
find first different node by preorder traversal/myCode.java:24
↓ 1 callersMethodfindLongest
(int[] arr)
Longest Arithmetic /myCode.java:9
↓ 1 callersMethodfindSame
(String a, String b)
getfriends/myCode.java:14
↓ 1 callersMethodgenerateCycle
(TreeNode root)
Convert Binary Tree to Double LinkedList/BTtoDLL.java:37
↓ 1 callersMethodhelper
(List<List<Integer>> res,List<Integer> list, int[] nums, int pos)
78. Subsets/Solution.java:8
↓ 1 callersMethodhelper
(int num)
273. Integer to English Words/Solution.java:18
↓ 1 callersMethodhelper
(List<List<Integer>> res,int[] nums, int pos)
47. Permutations II/permutationsII.java:22
↓ 1 callersMethodhelper
(List<String> res,StringBuilder sb, String n,int pos,int target,long sum)
282. Expression Add Operators/myCode.java:19
↓ 1 callersMethodinsert
(List<Interval> intervals, Interval newInterval)
57. Insert Interval/Solution.java:2
↓ 1 callersMethodisMatch
(char[] ch, int k , TrieNode node)
211. Add and Search Word - Data structure design/WordDictionary.java:25
↓ 1 callersMethodisValid
(char[] c)
125. Valid Palindrome/Solution.java:35
↓ 1 callersMethodisValid
(int i , int j , int x , int y , int row , int col)
200. Number of Islands/myCode.java:67
↓ 1 callersMethodlengthOfLongestSubstringKDistinct
(String s, int k)
340. Longest Substring with At Most K Distinct Characters/myCode.java:8
↓ 1 callersMethodmergeKSortedArray
(int[][] array)
merge k sorted array/Solution.java:14
↓ 1 callersMethodmostFrequentElement
(Interval[] intervals)
253. Meeting Rooms II/myCode.java:21
↓ 1 callersMethodoneEditDistance
(char[] s, char[] t)
161. One Edit Distance/myCode.java:10
↓ 1 callersMethodpowmode
(int a , int b , int c)
powmod/myCode.java:7
↓ 1 callersMethodpreviousPermutation
(List<Integer> n)
31. Next Permutation/myCode.java:17
↓ 1 callersMethodprintAllPath
(char[][] board)
print all path of a char board/myCode.java:15
↓ 1 callersMethodquickSelect
(int[] a, int l , int r , int k)
215. Kth Largest Element in an Array/Solution.java:29
↓ 1 callersMethodremove
Removes a value from the set. Returns true if the set contained the specified element.
380. Insert Delete GetRandom O(1)/InsertDeleteGetRandomO1.java:20
↓ 1 callersMethodremoveInvalidParentheses
(String s)
301. Remove Invalid Parentheses/Solution.java:9
↓ 1 callersMethodremoveIsland
(char[][] grid, int row, int col, int x ,int y)
200. Number of Islands/Solution.java:19
↓ 1 callersMethodreturnEmptyCell
(int slots , int[] emptyCell)
nonEmptyCellsRandomly/myCode.java:10
↓ 1 callersMethodreverse
(int[] a,int i)
31. Next Permutation/Solution.java:46
↓ 1 callersMethodreversePrint
(ListNode head)
Print elements of a linked list in reverse order/myCode.java:10
↓ 1 callersMethodserialize
(TreeNode root)
297. Serialize and Deserialize Binary Tree/myCode.java:20
↓ 1 callersMethodserialize
(TreeNode root)
297. Serialize and Deserialize Binary Tree/LinkedList.java:28
↓ 1 callersMethodsolve
(int[][] n, int k)
remove island of area k/remove.java:22
↓ 1 callersMethodsortColors
(int[] nums)
75. Sort Colors/Solution.java:10
↓ 1 callersMethodsortTransArray
(int[] nums, int a , int b, int c )
360. Sort Transformed Array/myCode.java:10
↓ 1 callersMethodsubArraySum
(int[] arr, int target)
subarry equals k/myCode.java:8
↓ 1 callersMethodsubsets
(int[] nums)
78. Subsets/myCode.java:28
↓ 1 callersMethodswap
(int[] a,int i)
31. Next Permutation/Solution.java:34
↓ 1 callersMethodswap
(List<Integer> a,int i)
31. Next Permutation/myCode.java:29
↓ 1 callersMethodtask
(int[] tasks, int k)
Task Schedule/myCode.java:7
↓ 1 callersMethodtask
(int[] tasks, int k)
Task Schedule II/myCode.java:7
↓ 1 callersMethodthreeSum
(int[] n)
15. 3Sum/myCode.java:15
↓ 1 callersMethodwordBreak
(String s, Set<String> wordDict)
139. Word Break/myCode.java:13
MethodBSTIterator
(TreeNode root)
173. Binary Search Tree Iterator/BSTIterator.java:5
MethodInterval
()
253. Meeting Rooms II/myCode.java:52
MethodListNode
(int x)
Convert Binary Tree to Double LinkedList/Solution.java:30
MethodListNode
(int x)
Print elements of a linked list in reverse order/myCode.java:20
MethodRandomListNode
(int x)
138. Copy List with Random Pointer/Solution.java:41
MethodRandomizedSet
Initialize your data structure here.
380. Insert Delete GetRandom O(1)/InsertDeleteGetRandomO1.java:6
MethodTreeNode
(int x)
Convert Binary Tree to Double LinkedList/BTtoDLL.java:54
MethodTreeNode
(int x)
Convert Binary Tree to Double LinkedList/Solution.java:37
MethodTreeNode
(int x)
257. Binary Tree Paths/myCode.java:42
MethodTreeNode
(int x)
find first different node by preorder traversal/myCode.java:43
MethodTreeNode
(int x)
297. Serialize and Deserialize Binary Tree/myCode.java:57
MethodTreeNode
(char x)
297. Serialize and Deserialize Binary Tree/LinkedList.java:80
next →1–100 of 246, ranked by callers