(self)

(self, root: TreeNode)

(result *[]int, root *TreeNode)

(List<Integer> result, Node node)

(List<Integer> result, Node node)

(ListNode prev, ListNode cur)

(ListNode prev, ListNode cur)

(int level, Set<String> startSet, Set<String> endSet, Set<String> meets)

(self, p, i, j)

(self, parent, i, j)

($p, $i, $j)

(char c)

(char c)

()

(Node node, int level,List<List<Integer>> result)

(List<List<Integer>> res, ArrayList<Integer> currList, int n, int k, int m)

(int[] nums, boolean[] flag, List<List<Integer>> result, List<Integer> nowList)

(re [][]int, n int)

(tmp, index, nums)

(result *[][]int, nums []int, index, k int)

(first int, nums []int, res *[][]int)

(String word, String start)

(int i, LinkedList<Integer> currentList)

(int row)

(String s, int level, String digits, List<String> result)

(nums, step = 0, visited = [], item = [], res = [])

(first int, nums []int, res *[][]int)

(int i, String digits, StringBuilder sb, LinkedList<String> resList)

(result, tempList, nums)

(result, nums, tempList, start)

(result, dict, digits, tempStr, start)

(int n, ArrayList<Integer> nums, List<List<Integer>> outout, int first)

(List<List<Integer>> list, List<Integer> tempList, int [] nums)

(List<List<Integer>> list, List<Integer> tempList, int [] nums, boolean [] used)

(int first,LinkedList<Integer> curr)

(int n, ArrayList<Integer> nums, List<List<Integer>> outpu

(int first, LinkedList<Integer> cur)

(int first, List<List<Integer>> output, List<Integer> nums, int n)

(List<String> list,String str, int open , int close, int n)

(List<List<Integer>> res,int[] visited,int[] nums, List<Integer> tmp)

(int start, int n, int k, List<Integer> tmp, List<List<Integer>> list)

(List<List<Integer>> res,int[] visited,int[] nums, List<Integer> tmp)

(List<String> ans, String cur, int open, int close, int max)

(int row, int hills, int next_row, int dales, int count, int n)

(int row, int col, int master, int slave, Stack<Integer> stack)

(int i, int n,Set<Integer> col, Set<Integer> z_diagonal, Set<Integer> f_diagonal)

(self, left, right, n, s)

(self, n, row, track)

(self, n, row, track)

(List<List<Integer>> list, List<Integer> tempList, int[] nums, int start)

(int i, int[] nums, List<List<Integer>> ret, ArrayList<Integer> tmp)

(String combina, String next_data)

(result, nums, tempList = [], visited = [])

(List<List<Integer>> list, List<Integer> tmpList, int start, int[] nums)

(i)

(root, res)

(String start, String end, Set<String> dict, HashMap<String, ArrayList<String>> nodeNeigh

(String start, String end, Set<String> dict, HashMap<String, ArrayList<String>> nodeNeighbors, Has

(int[] data, int target)

(i,j,curStr,currNode)

(int[] preorder, int preStart, int[] inorder, int inStart, int inEnd)

(int val, Node n)

(List<String> wordList, int wordlength)

(int[] preorder, int[] inorder)

(Set<String> words, Set<String> begin, Set<String> end, Map<String, List<String>> mapTree, boolean isFront)

(int[] preorder, int p_start, int p_end, int[] inorder, int i_start, int i_end)

(int[] preorder, int preStart, int preEnd, int[] inorder, int inOrderStart, int inOrderStop)

(words []string)

(String[] words)

(String[] words)

(char[][] board, int i, int j, String str, Set<String> result, Trie trie)

(String[] words)

(String[] words)

(int level, Set<String> beginSet, Set<String> endSet, Set<String> meets)

(char[][] board, int row, int col)

(grid, row, col)

(int[][] grid, int i, int j)

(int[][] grid,int i,int j)

(int[][] grid, int i, int j)

(String beginWord, String word)

(String a, String b)

(String s1, String s2)

(String s1, String s2)

(String s1, String s2)

(int[] nums)

(int position, int[] nums)