Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/ctfu/Leetcode
/ functions
Functions
771 in github.com/ctfu/Leetcode
⨍
Functions
771
◇
Types & classes
491
Method
combinationSum2
(int[] candidates, int target)
algorithm/combinationSumII.java:2
Method
combinationSum3
(int k, int n)
algorithm/combinationSumIII.java:2
Method
combinationSum4
(int[] nums, int target)
algorithm/combinationSumIV.java:6
Method
combine
(int n, int k)
algorithm/combination.java:3
Method
compare
(int[] p1, int[] p2)
algorithm/maximumLengthOfPairChain.java:12
Method
compare
(Map.Entry<Integer, Integer> entry1, Map.Entry<Integer, Integer> entry2)
algorithm/topKFrequentElements.java:12
Method
compare
(Interval a, Interval b)
algorithm/mergeInterval.java:17
Method
compare
(String str1, String str2)
algorithm/largestNumber.java:15
Method
compare
(ListNode a, ListNode b)
algorithm/mergeKLists.java:47
Method
compare
(Interval a, Interval b)
algorithm/meetingRooms.java:7
Method
compare
(int[] a, int[] b)
algorithm/queueConstructionByHeight.java:23
Method
compare
(Point p, Point q)
algorithm/erectTheFence.java:27
Method
compare
(ArrayContainer ac1, ArrayContainer ac2)
algorithm/smallestRange.java:8
Method
compare
(Cell a, Cell b)
algorithm/trappingWaterII.java:11
Method
compareVersion
(String version1, String version2)
algorithm/compareVersionNumber.java:2
Method
complexNumberMultiply
(String a, String b)
algorithm/complexNumberMultiplication.java:3
Method
computeArea
(int A, int B, int C, int D, int E, int F, int G, int H)
algorithm/rectangleArea.java:4
Method
connect
(TreeLinkNode root)
algorithm/polulatingNextRightPointer.java:18
Method
connect
(TreeLinkNode root)
algorithm/populatingNextRightPointerII.java:4
Method
containsDuplicate
(int[] nums)
algorithm/containsDuplicate.java:3
Method
containsNearbyAlmostDuplicate
(int[] nums, int k, int t)
algorithm/containsDuplicateIII.java:4
Method
containsNearbyDuplicate
(int[] nums, int k)
algorithm/containsDuplicateII.java:3
Method
convert
(String s, int numRows)
algorithm/zigZagConversion.java:3
Method
convertBST
(TreeNode root)
algorithm/convertBSTToGreaterTree.java:5
Method
convertToTitle
(int n)
algorithm/excelSheetColumnTitle.java:3
Method
copyRandomList
(RandomListNode head)
algorithm/copyListWithRandomNode.java:8
Method
countAndSay
(int n)
algorithm/countAndSay.java:3
Method
countBattleships
(char[][] board)
algorithm/battleshipInABoard.java:23
Method
countBits
(int num)
algorithm/countingBits.java:3
Method
countComponents
(int n, int[][] edges)
algorithm/numberOfConnectedComponent.java:3
Method
countNodes
(TreeNode root)
algorithm/countCompleteTreeNodes.java:10
Method
countNumbersWithUniqueDigits
(int n)
algorithm/countNumbersWithUniqueDigits.java:23
Method
countOfAtoms
(String formula)
algorithm/numberOfAtoms.java:3
Method
countPrimes
(int n)
algorithm/countPrimes.java:2
Method
countSubstrings
(String s)
algorithm/palindromSubstring.java:5
Method
countUnivalSubtrees
(TreeNode root)
algorithm/countUnivalueSubtrees.java:3
Method
decode
(String shortUrl)
algorithm/encodeAndDecodeTinyURL.java:21
Method
decode
(String s)
algorithm/encodeAndDecodeString.java:14
Method
decodeString
(String s)
algorithm/decodeString.java:6
Method
delNodes
(TreeNode root, int[] to_delete)
algorithm/deleteNodeAndReturnForest.java:13
Method
deleteDuplicates
(ListNode head)
algorithm/removeDuplicateFromSortedList.java:4
Method
deleteDuplicates
(ListNode root)
algorithm/removeDuplicateFromSortedListII.java:3
Method
deleteNode
(ListNode node)
algorithm/deleteNodeInALinkedList.java:14
Method
deleteNode
(TreeNode root, int key)
algorithm/deleteNodeInBST.java:6
Method
depthSum
(List<NestedInteger> nestedList)
algorithm/nestedListWeightSum.java:19
Method
depthSumInverse
(List<NestedInteger> nestedList)
algorithm/nestedListWeightSumII.java:4
Method
deserialize
(String data)
algorithm/serializeAndDeserializeBinaryTree.java:23
Method
deserialize
(String s)
algorithm/miniParser.java:31
Method
detectCapitalUse
(String word)
algorithm/detectCapital.java:3
Method
detectCaptialUse
(String word)
algorithm/detectCapital.java:10
Method
detectCycle
(ListNode head)
algorithm/linkedListCycleII.java:3
Method
diameterOfBinaryTree
(TreeNode root)
algorithm/diameterOfBinaryTree.java:4
Method
diffWaysToCompute
(String input)
algorithm/differentWaysToAddParenthesis.java:4
Method
distributeCandies
(int[] candies)
algorithm/distributeCandies.java:2
Method
empty
()
algorithm/implementStackUsingQueue.java:23
Method
encode
(String longUrl)
algorithm/encodeAndDecodeTinyURL.java:7
Method
encode
(List<String> strs)
algorithm/encodeAndDecodeString.java:4
Method
evalRPN
(String[] tokens)
algorithm/reversePolishNotation.java:4
Method
exist
(char[][] board, String word)
algorithm/wordSearch.java:2
Method
find
Find if there exists any pair of numbers which sum is equal to the value.
algorithm/twoSum-Design.java:14
Method
find132pattern
(int[] nums)
algorithm/132Pattern.java:29
Method
findAllConcatenatedWordsInADict
(String[] words)
algorithm/concatenatedWords.java:7
Method
findAnagrams
(String s, String p)
algorithm/findAllAnagramsInString.java:8
Method
findBlackPixel
(char[][] picture, int N)
algorithm/lonelyPixelII.java:2
Method
findBottomLeftValue
(TreeNode root)
algorithm/findBottomLeftTreeValue.java:3
Method
findCelebrity
(int n)
algorithm/findTheCelebrity.java:7
Method
findCircleNum
(int[][] M)
algorithm/friendsCircle.java:3
Method
findClosestElements
(int[] arr, int k, int x)
algorithm/findKClosestElements.java:10
Method
findDiagonalOrder
(int[][] matrix)
algorithm/diagonalTraverse.java:14
Method
findDisappearedNumbers
(int[] nums)
algorithm/findAllDisappearedNumberInArray.java:5
Method
findDuplicate
(int[] nums)
algorithm/findTheDuplicateNumber.java:9
Method
findDuplicate
(String[] paths)
algorithm/findDuplicateFilesInSystem.java:7
Method
findDuplicateSubtrees
(TreeNode root)
algorithm/findDuplicateSubtrees.java:4
Method
findDuplicates
(int[] nums)
algorithm/findAllDuplicatesInArray.java:7
Method
findErrorNums
(int[] nums)
algorithm/setMismatch.java:4
Method
findFrequentTreeSum
(TreeNode root)
algorithm/mostFrequentSubstreeSum.java:8
Method
findItinerary
(String[][] tickets)
algorithm/reconstructItinerary.java:3
Method
findLHS
(int[] nums)
algorithm/longestHarmoniousSubsequence.java:3
Method
findLadders
(String beginWord, String endWord, List<String> wordList)
algorithm/wordLadderII.java:2
Method
findLeaves
(TreeNode root)
algorithm/findLeavesOfBinaryTree.java:5
Method
findLonelyPixel
(char[][] picture)
algorithm/lonelyPixelI.java:7
Method
findLongestChain
(int[][] pairs)
algorithm/maximumLengthOfPairChain.java:7
Method
findMaxConsecutiveOnes
(int[] nums)
algorithm/maxConsecutiveOnes.java:2
Method
findMaxLength
(int[] nums)
algorithm/contiguousSubarray.java:5
Method
findMedian
()
algorithm/findMedianFromDatastream.java:38
Method
findMedianSortedArrays
(int[] nums1, int[] nums2)
algorithm/medianOfTwoSortedArray.java:3
Method
findMin
(int[] nums)
algorithm/findMinimumInRotatedSortedArray.java:4
Method
findMin
(int[] nums)
algorithm/findMinimumInRotatedSortedArrayII.java:4
Method
findMinArrowShots
(int[][] points)
algorithm/minimumArrowBurstBalloom.java:3
Method
findMinMoves
(int[] machines)
algorithm/superWashingMaching.java:4
Method
findMinStep
(String board, String hand)
algorithm/zumaGame.java:3
Method
findMissingRanges
(int[] nums, int lower, int upper)
algorithm/missingRange.java:2
Method
findMode
(TreeNode root)
algorithm/findModeInBST.java:6
Method
findNthDigit
(int n)
algorithm/nthDigit.java:3
Method
findOrder
(int numCourses, int[][] prerequisites)
algorithm/courseScheduleII.java:5
Method
findPairs
(int[] nums, int k)
algorithm/k-diffPairInArray.java:4
Method
findPaths
(int m, int n, int N, int i, int j)
algorithm/outOfBoundaryPaths.java:3
Method
findPeakElement
(int[] nums)
algorithm/findPeakElement.java:3
Method
findRadius
(int[] houses, int[] heaters)
algorithm/heaters.java:4
Method
findRedundantDirectedConnection
(int[][] edges)
algorithm/redundantCollectionII.java:7
← previous
next →
301–400 of 771, ranked by callers