Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/chenxiangcyr/leetcode-answers
/ functions
Functions
225 in github.com/chenxiangcyr/leetcode-answers
⨍
Functions
225
◇
Types & classes
148
Method
singleNumber
(int[] nums)
136-SingleNumber/Solution.java:2
Method
solve
(char[][] board)
130-SurroundedRegions/Solution.java:2
Method
solveNQueens
(int n)
51-N-Queens/Solution.java:4
Method
solveSudoku
(char[][] board)
37-SudokuSolver/Solution.java:2
Method
sortColors
(int[] nums)
75-SortColors/Solution.java:2
Method
sortList
(ListNode head)
148-SortList/Solution.java:10
Method
sortedArrayToBST
(int[] nums)
108-ConvertSortedArraytoBinarySearchTree/Solution.java:11
Method
sortedListToBST
(ListNode head)
109-ConvertSortedListtoBinarySearchTree/Solution.java:19
Method
spiralOrder
(int[][] matrix)
54-SpiralMatrix/Solution.java:2
Method
strStr
(String haystack, String needle)
28-ImplementstrStr/Solution.java:2
Method
subsets
(int[] nums)
78-Subsets/Solution.java:5
Method
subsetsWithDup
(int[] nums)
90-SubsetsII/Solution.java:5
Method
sumNumbers
(TreeNode root)
129-SumRoottoLeafNumbers/Solution.java:14
Function
swapPairs
* Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * }; */
24-SwapNodesinPairs/Solution.c:8
Method
threeSum
(int[] nums)
15-3Sum/Solution.java:2
Method
threeSumClosest
(int[] nums, int target)
16-3SumClosest/Solution.java:2
Method
totalNQueens
(int n)
52-N-QueensII/Solution.java:6
Method
trap
(int[] height)
42-TrappingRainWater/Solution.java:2
Method
uniquePaths
(int m, int n)
62-UniquePaths/Solution.java:2
Method
uniquePathsRecursive
(int m, int n)
62-UniquePaths/Solution.java:32
Method
uniquePathsWithObstacles
(int[][] obstacleGrid)
63-UniquePathsII/Solution.java:2
Method
wordBreak
(String s, List<String> wordDict)
139-WordBreak/Solution.java:2
Method
wordBreak
(String s, List<String> wordDict)
140-WordBreakII/Solution.java:2
Method
wordBreakRecursive
(String s, List<String> wordDict, int startIdx)
139-WordBreak/Solution.java:32
Method
zigzagLevelOrder
(TreeNode root)
103-BinaryTreeZigzagLevelOrderTraversal/Solution.java:11
← previous
201–225 of 225, ranked by callers