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
MethodTrie
()
208. Implement Trie (Prefix Tree)/Solution.java:15
MethodTrieNode
()
208. Implement Trie (Prefix Tree)/Solution.java:6
MethodaddNum
(int num)
295. Find Median from Data Stream/MedianFinder.java:5
MethodaddWord
(String word)
211. Add and Search Word - Data structure design/WordDictionary.java:9
MethodamazingNumber
(int[] nums)
amazing number/soluion.java:2
MethodbinaryTreePaths
(TreeNode root)
257. Binary Tree Paths/Solution.java:2
MethodcanAttendMeetings
(Interval[] intervals)
252. Meeting Rooms/Solution.java:13
MethodcloneGraph
(UndirectedGraphNode node)
133. Clone Graph/Solution.java:2
MethodcombinationSum
(int[] n, int target)
39. Combination Sum/Solution.java:2
MethodcombinationSum4
(int[] nums, int target)
377. Combination Sum IV/Solution.java:3
Methodcompare
(ListNode o1, ListNode o2)
23. Merge k Sorted Lists/MergekSortedLists.java:14
Methodcompare
(Interval i1, Interval i2)
56. Merge Intervals/Solution.java:20
Methodcompare
(List<Integer> o1, List<Integer> o2)
merge k sorted array/Solution.java:20
Methodcompare
(Interval i1, Interval i2)
252. Meeting Rooms/Solution.java:15
Methodconnect
(TreeLinkNode root)
116. Populating Next Right Pointers in Each Node/Solution.java:2
Methodconnect
(TreeLinkNode root)
117. Populating Next Right Pointers in Each Node II/Solution.java:2
MethodcopyRandomList
(RandomListNode head)
138. Copy List with Random Pointer/Solution.java:2
MethodcountAndSay
(int n)
38. Count and Say/Solution.java:2
Methodcovert
(TreeNode root)
Convert Binary Tree to Double LinkedList/Solution.java:4
MethoddecodeString
(String s)
394. Decode String/Solution.java:2
Methoddeserialize
(String data)
297. Serialize and Deserialize Binary Tree/myCode.java:36
Methoddeserialize
(TreeNode head)
297. Serialize and Deserialize Binary Tree/LinkedList.java:56
Methoddivide
(int a, int b)
29. Divide Two Integers/Solution.java:2
MethodfindCelebrity
(int n)
277. Find the Celebrity/Solution.java:2
MethodfindCommonFriend
(int id)
getfriends/findCommonFriends.java:1
MethodfindKthLargest
(int[] nums, int k)
215. Kth Largest Element in an Array/Solution.java:2
MethodfindMedian
()
295. Find Median from Data Stream/MedianFinder.java:14
MethodfindOrder
(int numCourses, int[][] p)
210. Course Schedule II/Solution.java:2
MethodfirstBadVersion
(int n)
278. First Bad Version/Solution.java:2
Methodflatten
(TreeNode root)
114. Flatten Binary Tree to Linked List/Solution.java:4
Methodflatten
(TreeNode root)
114. Flatten Binary Tree to Linked List/Solution.java:18
MethodfullJustify
(String[] words, int max)
68. Text Justification/Solution.java:2
MethodgenerateCycle
(ListNode root)
Convert Binary Tree to Double LinkedList/Solution.java:16
MethodgetMin
()
155. Min Stack/Solution.java:25
MethodgetRandom
Get a random element from the set.
380. Insert Delete GetRandom O(1)/InsertDeleteGetRandomO1.java:34
MethodgroupAnagrams
(String[] strs)
49. Group Anagrams/Solution.java:2
MethodhasNext
@return whether we have a next smallest number
173. Binary Search Tree Iterator/BSTIterator.java:10
MethodhasPathSum
(TreeNode root, int sum)
112. Path Sum/Solution.java:2
MethodincreasingTriplet
(int[] nums)
334. Increasing Triplet Subsequence/Solution.java:2
MethodinorderTraversal
(TreeNode root)
94. Binary Tree Inorder Traversal/Solution.java:2
MethodinorderTraversal
(TreeNode root)
94. Binary Tree Inorder Traversal/Solution.java:26
Methodinsert
(String word)
208. Implement Trie (Prefix Tree)/Solution.java:20
Methodinsert
Inserts a value to the set. Returns true if the set did not already contain the specified element.
380. Insert Delete GetRandom O(1)/InsertDeleteGetRandomO1.java:12
MethodintToRoman
(int num)
12. Integer to Roman/Solution.java:2
Methodintersection
(int[] nums1, int[] nums2)
349. Intersection of Two Arrays/Solution.java:2
MethodisMatch
(String s, String p)
10. Regular Expression Matching/Solution.java:2
MethodisOneEditDistance
(String s, String t)
161. One Edit Distance/Solution.java:2
MethodisPalindrome
(String s)
125. Valid Palindrome/Solution.java:2
MethodisPerfectSquare
(int num)
367. Valid Perfect Square/Solution.java:4
MethodisPowerOfThree
(int n)
Power of x/Solution.java:2
MethodisValid
(String s)
20. Valid Parentheses/Solution.java:2
MethodisValidBST
(TreeNode root)
98. Validate Binary Search Tree/Solution.java:2
MethodkthSmallest
(TreeNode root, int k)
230. Kth Smallest Element in a BST/Solution.java:2
MethodladderLength
(String beginWord, String endWord, Set<String> wordList)
127. Word Ladder/wordladder.java:5
MethodlengthOfLIS
(int[] n)
300. Longest Increasing Subsequence/Solution.java:2
MethodlengthOfLongestSubstringKDistinct
(String s, int k)
340. Longest Substring with At Most K Distinct Characters/Solution.java:2
MethodletterCombinations
(String digits)
17. Letter Combinations of a Phone Number/Solution.java:2
MethodlevelOrder
(TreeNode root)
102. Binary Tree Level Order Traversal/Solution.java:2
MethodlongestConsecutive
(int[] nums)
128. Longest Consecutive Sequence/Solution.java:2
MethodlongestPalindrome
(String s)
5. Longest Palindromic Substring/Solution.java:2
Methodmain
(String[] args)
Convert Binary Tree to Double LinkedList/BTtoDLL.java:3
Methodmain
(String[] args)
print all path of a char board/myCode.java:5
Methodmain
(String[] args)
340. Longest Substring with At Most K Distinct Characters/myCode.java:2
Methodmain
(String[] args)
subarry equals k/myCode.java:3
Methodmain
(String[] args)
Longest Arithmetic /myCode.java:3
Methodmain
(String[] args)
29. Divide Two Integers/myCode.java:2
Methodmain
(String[] args)
Fibonacci/Fibonacci.java:7
Methodmain
(String[] args)
Fibonacci/Solution.java:2
Methodmain
(String[] args)
Cycle Sort/myCode.java:2
Methodmain
(String[] args)
139. Word Break/myCode.java:2
Methodmain
(String[] args)
Print elements of a linked list in reverse order/myCode.java:2
Methodmain
(String[] args)
125. Valid Palindrome/Solution.java:29
Methodmain
(String[] args)
200. Number of Islands/myCode.java:7
Methodmain
(String[] args)
Randomly return the index of maximal elements/myCode.java:2
Methodmain
(String[] args)
253. Meeting Rooms II/myCode.java:7
Methodmain
(String[] args)
double int array/myCode.java:2
Methodmain
(String[] args)
161. One Edit Distance/myCode.java:5
Methodmain
(String[] args)
15. 3Sum/myCode.java:4
Methodmain
(String[] args)
merge k sorted array/Solution.java:6
Methodmain
(String[] args)
78. Subsets/myCode.java:3
Methodmain
(String[] args)
75. Sort Colors/Solution.java:2
Methodmain
(String[] args)
getfriends/myCode.java:4
Methodmain
(String[] args)
remove island of area k/remove.java:2
Methodmain
(String[] args)
360. Sort Transformed Array/myCode.java:2
Methodmain
(String[] args)
31. Next Permutation/myCode.java:4
Methodmain
(String[] args)
257. Binary Tree Paths/myCode.java:2
Methodmain
(String[] args)
find first different node by preorder traversal/myCode.java:4
Methodmain
(String[] args)
Run Length Encoding/myCode.java:2
Methodmain
(String[] args)
Task Schedule/myCode.java:2
Methodmain
(String[] args)
297. Serialize and Deserialize Binary Tree/myCode.java:5
Methodmain
(String[] args)
297. Serialize and Deserialize Binary Tree/LinkedList.java:10
Methodmain
(String[] args)
Find the number of Palindrome/myCode.java:7
Methodmain
(String[] args)
Task Schedule II/myCode.java:2
Methodmain
(String[] args)
67. Add Binary/myCode.java:4
Methodmain
(String[] args)
nonEmptyCellsRandomly/myCode.java:4
Methodmain
(String[] args)
powmod/myCode.java:2
Methodmain
(String[] args)
301. Remove Invalid Parentheses/Solution.java:59
Methodmain
(String[] args)
282. Expression Add Operators/myCode.java:5
Methodmain
(String[] args)
Dot Product/myCode.java:2
MethodmaxDepth
(TreeNode root)
104. Maximum Depth of Binary Tree/Solution.java:2
← previousnext →101–200 of 246, ranked by callers