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
MethodmaxProfit
(int[] prices)
122. Best Time to Buy and Sell Stock II/Solution.java:2
MethodmaxProfit
(int[] prices)
121. Best Time to Buy and Sell Stock/Solution.java:2
MethodmaxSlidingWindow
(int[] n, int k)
239. Sliding Window Maximum/Solution.java:2
MethodmaxSubArrayLen
(int[] nums, int k)
325. Maximum Size Subarray Sum Equals k/Solution.java:2
MethodmaxXing
(int[][] nums)
crossRoad/Solution.java:2
Methodmerge
(int[] nums1, int m, int[] nums2, int n)
88. Merge Sorted Array/Solution.java:2
Methodmerge
(List<Interval> intervals)
56. Merge Intervals/Solution.java:14
MethodmergeKLists
(ListNode[] lists)
23. Merge k Sorted Lists/MergekSortedLists.java:10
MethodmergeTwoLists
(ListNode l1, ListNode l2)
21. Merge Two Sorted Lists/Solution.java:2
MethodminMeetingRooms
(Interval[] intervals)
253. Meeting Rooms II/Solution.java:2
MethodminSubArrayLen
(int s, int[] nums)
209. Minimum Size Subarray Sum/Solution.java:2
MethodminSubArrayLen
(int[] nums, int s)
209. Minimum Size Subarray Sum/Solution.java:16
MethodminWindow
(String s, String t)
76. Minimum Window Substring/Solution.java:2
MethodmoveZeroes
(int[] nums)
283. Move Zeroes/Solution.java:2
Methodmultiply
(String num1, String num2)
43. Multiply Strings/Solution.java:2
Methodnext
@return the next smallest number
173. Binary Search Tree Iterator/BSTIterator.java:15
MethodnextPermutation
(int[] nums)
31. Next Permutation/Solution.java:24
MethodnumDecodings
(String s)
91. Decode Ways/Solution.java:2
MethodnumIslands
(char[][] grid)
200. Number of Islands/Solution.java:2
MethodnumberToWords
(int num)
273. Integer to English Words/Solution.java:5
Methodpermute
(int[] nums)
46. Permutations/permutations.java:22
MethodpermuteUnique
(int[] nums)
47. Permutations II/permutationsII.java:16
MethodplusOne
(int[] digits)
66. Plus One/Solution.java:2
MethodpostorderTraversal
(TreeNode root)
145. Binary Tree Postorder Traversal/Solution.java:8
Methodread
@param buf Destination buffer @param n Maximum number of characters to read @return The number of characters read
157. Read N Characters Given Read4/Solution.java:7
Methodread
@param buf Destination buffer @param n Maximum number of characters to read @return The number of characters read
158. Read N Characters Given Read4 II - Call multiple times/Solution.java:11
MethodreverseWords
(String s)
151. Reverse Words in a String/Solution.java:4
Methodsearch
(String word)
208. Implement Trie (Prefix Tree)/Solution.java:33
Methodsearch
(int[] n, int target)
33. Search in Rotated Sorted Array/Solution.java:2
Methodsearch
(int[] n, int target)
81. Search in Rotated Sorted Array II/Solution.java:2
Methodsearch
(String word)
211. Add and Search Word - Data structure design/WordDictionary.java:22
MethodsortColors
(int[] nums)
75. Sort Colors/sortColor.java:2
MethodsortKCategory
(int[] nums, int k)
75. Sort Colors/sortK.java:1
MethodsortTransformedArray
(int[] nums, int a, int b, int c)
360. Sort Transformed Array/Solution.java:2
MethodsortedArrayToBST
(int[] nums)
108. Convert Sorted Array to Binary Search Tree/Solution.java:2
MethodstartsWith
(String prefix)
208. Implement Trie (Prefix Tree)/Solution.java:39
MethodstrStr
(String haystack, String needle)
28. Implement strStr()/Solution.java:7
MethodstrStr
(String haystack, String needle)
28. Implement strStr()/Solution.java:20
Methodsubsets
(int[] nums)
78. Subsets/Solution.java:2
MethodsubsetsWithDup
(int[] n)
90. Subsets II/Solution.java:3
MethodthreeSum
(int[] n)
15. 3Sum/Solution.java:2
Methodtop
()
155. Min Stack/Solution.java:21
MethodtopKFrequent
(int[] nums, int k)
getfriends/Solution.java:2
MethoduniquePaths
(int m, int n)
62. Unique Paths/Solution.java:2
MethoduniquePathsWithObstacles
(int[][] obstacleGrid)
63. Unique Paths II/Solution.java:2
MethodverticalOrder
(TreeNode root)
314. Binary Tree Vertical Order Traversal/Solution.java:2
← previous201–246 of 246, ranked by callers